java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label11_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 18:50:05,334 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 18:50:05,336 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 18:50:05,348 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 18:50:05,349 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 18:50:05,350 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 18:50:05,351 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 18:50:05,353 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 18:50:05,355 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 18:50:05,355 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 18:50:05,356 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 18:50:05,357 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 18:50:05,358 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 18:50:05,359 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 18:50:05,360 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 18:50:05,361 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 18:50:05,361 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 18:50:05,363 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 18:50:05,365 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 18:50:05,367 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 18:50:05,368 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 18:50:05,370 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 18:50:05,374 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 18:50:05,374 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 18:50:05,375 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 18:50:05,377 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 18:50:05,381 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 18:50:05,382 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 18:50:05,386 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 18:50:05,387 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 18:50:05,388 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 18:50:05,388 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 18:50:05,388 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 18:50:05,389 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 18:50:05,392 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 18:50:05,392 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 18:50:05,393 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-23 18:50:05,408 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 18:50:05,408 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 18:50:05,409 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 18:50:05,409 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 18:50:05,409 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 18:50:05,410 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 18:50:05,410 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 18:50:05,410 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 18:50:05,410 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 18:50:05,410 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 18:50:05,411 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 18:50:05,411 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 18:50:05,411 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 18:50:05,411 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 18:50:05,411 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 18:50:05,412 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 18:50:05,412 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 18:50:05,412 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 18:50:05,412 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 18:50:05,412 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:50:05,413 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 18:50:05,413 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 18:50:05,413 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 18:50:05,413 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 18:50:05,413 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 18:50:05,414 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 18:50:05,414 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 18:50:05,414 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 18:50:05,470 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 18:50:05,484 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 18:50:05,488 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 18:50:05,490 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 18:50:05,490 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 18:50:05,491 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label11_true-unreach-call.c [2018-10-23 18:50:05,554 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/eb66b7826/7b47d4988702432c89a24df5d66048de/FLAG8f6d11530 [2018-10-23 18:50:06,232 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 18:50:06,234 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label11_true-unreach-call.c [2018-10-23 18:50:06,251 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/eb66b7826/7b47d4988702432c89a24df5d66048de/FLAG8f6d11530 [2018-10-23 18:50:06,270 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/eb66b7826/7b47d4988702432c89a24df5d66048de [2018-10-23 18:50:06,282 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 18:50:06,284 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 18:50:06,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 18:50:06,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 18:50:06,291 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 18:50:06,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:50:06" (1/1) ... [2018-10-23 18:50:06,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f51eb09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:06, skipping insertion in model container [2018-10-23 18:50:06,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:50:06" (1/1) ... [2018-10-23 18:50:06,306 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 18:50:06,406 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 18:50:07,169 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:50:07,174 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 18:50:07,430 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:50:07,455 INFO L193 MainTranslator]: Completed translation [2018-10-23 18:50:07,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:07 WrapperNode [2018-10-23 18:50:07,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 18:50:07,457 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 18:50:07,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 18:50:07,457 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 18:50:07,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:07" (1/1) ... [2018-10-23 18:50:07,522 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:07" (1/1) ... [2018-10-23 18:50:07,751 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 18:50:07,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 18:50:07,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 18:50:07,752 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 18:50:07,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:07" (1/1) ... [2018-10-23 18:50:07,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:07" (1/1) ... [2018-10-23 18:50:07,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:07" (1/1) ... [2018-10-23 18:50:07,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:07" (1/1) ... [2018-10-23 18:50:07,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:07" (1/1) ... [2018-10-23 18:50:07,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:07" (1/1) ... [2018-10-23 18:50:07,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:07" (1/1) ... [2018-10-23 18:50:07,885 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 18:50:07,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 18:50:07,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 18:50:07,886 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 18:50:07,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:50:07,957 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 18:50:07,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 18:50:07,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 18:50:13,649 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 18:50:13,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:50:13 BoogieIcfgContainer [2018-10-23 18:50:13,650 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 18:50:13,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 18:50:13,651 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 18:50:13,655 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 18:50:13,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:50:06" (1/3) ... [2018-10-23 18:50:13,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aae6672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:50:13, skipping insertion in model container [2018-10-23 18:50:13,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:07" (2/3) ... [2018-10-23 18:50:13,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aae6672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:50:13, skipping insertion in model container [2018-10-23 18:50:13,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:50:13" (3/3) ... [2018-10-23 18:50:13,659 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label11_true-unreach-call.c [2018-10-23 18:50:13,670 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 18:50:13,681 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 18:50:13,699 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 18:50:13,738 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 18:50:13,738 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 18:50:13,739 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 18:50:13,739 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 18:50:13,739 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 18:50:13,739 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 18:50:13,739 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 18:50:13,740 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 18:50:13,740 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 18:50:13,765 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-23 18:50:13,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-23 18:50:13,790 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:13,792 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:13,799 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:13,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:13,806 INFO L82 PathProgramCache]: Analyzing trace with hash -73727940, now seen corresponding path program 1 times [2018-10-23 18:50:13,808 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:13,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:13,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:13,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:13,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:14,744 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-23 18:50:14,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:50:14,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:14,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:14,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:14,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:14,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:14,879 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-23 18:50:18,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:18,672 INFO L93 Difference]: Finished difference Result 1027 states and 1865 transitions. [2018-10-23 18:50:18,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:18,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2018-10-23 18:50:18,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:18,704 INFO L225 Difference]: With dead ends: 1027 [2018-10-23 18:50:18,704 INFO L226 Difference]: Without dead ends: 717 [2018-10-23 18:50:18,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:18,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-23 18:50:18,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2018-10-23 18:50:18,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-10-23 18:50:18,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1145 transitions. [2018-10-23 18:50:18,816 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1145 transitions. Word has length 194 [2018-10-23 18:50:18,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:18,818 INFO L481 AbstractCegarLoop]: Abstraction has 715 states and 1145 transitions. [2018-10-23 18:50:18,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:18,818 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1145 transitions. [2018-10-23 18:50:18,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-23 18:50:18,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:18,826 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:18,826 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:18,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:18,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1649660795, now seen corresponding path program 1 times [2018-10-23 18:50:18,827 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:18,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:18,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:18,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:18,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:18,968 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:50:18,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:18,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:50:18,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:18,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:18,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:18,974 INFO L87 Difference]: Start difference. First operand 715 states and 1145 transitions. Second operand 3 states. [2018-10-23 18:50:20,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:20,815 INFO L93 Difference]: Finished difference Result 2058 states and 3347 transitions. [2018-10-23 18:50:20,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:20,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2018-10-23 18:50:20,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:20,826 INFO L225 Difference]: With dead ends: 2058 [2018-10-23 18:50:20,827 INFO L226 Difference]: Without dead ends: 1345 [2018-10-23 18:50:20,835 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:20,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-10-23 18:50:20,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1331. [2018-10-23 18:50:20,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-10-23 18:50:20,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2076 transitions. [2018-10-23 18:50:20,888 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2076 transitions. Word has length 203 [2018-10-23 18:50:20,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:20,888 INFO L481 AbstractCegarLoop]: Abstraction has 1331 states and 2076 transitions. [2018-10-23 18:50:20,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:20,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2076 transitions. [2018-10-23 18:50:20,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-23 18:50:20,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:20,894 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:20,895 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:20,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:20,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1743599183, now seen corresponding path program 1 times [2018-10-23 18:50:20,895 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:20,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:20,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:20,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:20,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:21,272 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:50:21,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:21,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:21,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:21,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:21,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:21,275 INFO L87 Difference]: Start difference. First operand 1331 states and 2076 transitions. Second operand 3 states. [2018-10-23 18:50:24,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:24,748 INFO L93 Difference]: Finished difference Result 3891 states and 6117 transitions. [2018-10-23 18:50:24,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:24,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-10-23 18:50:24,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:24,763 INFO L225 Difference]: With dead ends: 3891 [2018-10-23 18:50:24,764 INFO L226 Difference]: Without dead ends: 2562 [2018-10-23 18:50:24,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:24,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2018-10-23 18:50:24,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2557. [2018-10-23 18:50:24,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2557 states. [2018-10-23 18:50:24,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 3774 transitions. [2018-10-23 18:50:24,816 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 3774 transitions. Word has length 211 [2018-10-23 18:50:24,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:24,817 INFO L481 AbstractCegarLoop]: Abstraction has 2557 states and 3774 transitions. [2018-10-23 18:50:24,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:24,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 3774 transitions. [2018-10-23 18:50:24,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-23 18:50:24,824 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:24,824 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:24,824 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:24,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:24,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1812376770, now seen corresponding path program 1 times [2018-10-23 18:50:24,825 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:24,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:24,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:24,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:24,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:25,031 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:50:25,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:25,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:50:25,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:25,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:25,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:25,033 INFO L87 Difference]: Start difference. First operand 2557 states and 3774 transitions. Second operand 3 states. [2018-10-23 18:50:26,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:26,712 INFO L93 Difference]: Finished difference Result 6396 states and 9368 transitions. [2018-10-23 18:50:26,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:26,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2018-10-23 18:50:26,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:26,733 INFO L225 Difference]: With dead ends: 6396 [2018-10-23 18:50:26,733 INFO L226 Difference]: Without dead ends: 3841 [2018-10-23 18:50:26,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:26,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3841 states. [2018-10-23 18:50:26,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3841 to 3837. [2018-10-23 18:50:26,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3837 states. [2018-10-23 18:50:26,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 5572 transitions. [2018-10-23 18:50:26,806 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 5572 transitions. Word has length 223 [2018-10-23 18:50:26,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:26,808 INFO L481 AbstractCegarLoop]: Abstraction has 3837 states and 5572 transitions. [2018-10-23 18:50:26,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:26,808 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 5572 transitions. [2018-10-23 18:50:26,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-23 18:50:26,817 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:26,818 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:26,818 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:26,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:26,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1480172138, now seen corresponding path program 1 times [2018-10-23 18:50:26,819 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:26,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:26,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:26,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:26,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:27,163 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-23 18:50:27,350 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:50:27,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:50:27,351 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 18:50:27,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:27,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:50:27,763 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-10-23 18:50:27,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:50:27,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-10-23 18:50:27,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 18:50:27,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 18:50:27,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 18:50:27,800 INFO L87 Difference]: Start difference. First operand 3837 states and 5572 transitions. Second operand 6 states. [2018-10-23 18:50:27,976 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-23 18:50:28,656 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-23 18:50:36,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:36,000 INFO L93 Difference]: Finished difference Result 25612 states and 37422 transitions. [2018-10-23 18:50:36,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-23 18:50:36,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 231 [2018-10-23 18:50:36,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:36,082 INFO L225 Difference]: With dead ends: 25612 [2018-10-23 18:50:36,082 INFO L226 Difference]: Without dead ends: 21777 [2018-10-23 18:50:36,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-23 18:50:36,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21777 states. [2018-10-23 18:50:36,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21777 to 21749. [2018-10-23 18:50:36,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21749 states. [2018-10-23 18:50:36,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21749 states to 21749 states and 28388 transitions. [2018-10-23 18:50:36,513 INFO L78 Accepts]: Start accepts. Automaton has 21749 states and 28388 transitions. Word has length 231 [2018-10-23 18:50:36,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:36,514 INFO L481 AbstractCegarLoop]: Abstraction has 21749 states and 28388 transitions. [2018-10-23 18:50:36,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 18:50:36,514 INFO L276 IsEmpty]: Start isEmpty. Operand 21749 states and 28388 transitions. [2018-10-23 18:50:36,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-23 18:50:36,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:36,557 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:36,557 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:36,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:36,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1458638854, now seen corresponding path program 1 times [2018-10-23 18:50:36,558 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:36,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:36,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:36,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:36,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:36,796 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:50:36,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:36,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:36,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:36,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:36,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:36,798 INFO L87 Difference]: Start difference. First operand 21749 states and 28388 transitions. Second operand 3 states. [2018-10-23 18:50:39,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:39,193 INFO L93 Difference]: Finished difference Result 43170 states and 56423 transitions. [2018-10-23 18:50:39,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:39,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2018-10-23 18:50:39,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:39,241 INFO L225 Difference]: With dead ends: 43170 [2018-10-23 18:50:39,242 INFO L226 Difference]: Without dead ends: 21423 [2018-10-23 18:50:39,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:39,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21423 states. [2018-10-23 18:50:39,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21423 to 21416. [2018-10-23 18:50:39,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21416 states. [2018-10-23 18:50:39,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21416 states to 21416 states and 26340 transitions. [2018-10-23 18:50:39,554 INFO L78 Accepts]: Start accepts. Automaton has 21416 states and 26340 transitions. Word has length 245 [2018-10-23 18:50:39,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:39,554 INFO L481 AbstractCegarLoop]: Abstraction has 21416 states and 26340 transitions. [2018-10-23 18:50:39,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:39,554 INFO L276 IsEmpty]: Start isEmpty. Operand 21416 states and 26340 transitions. [2018-10-23 18:50:39,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-23 18:50:39,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:39,600 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:39,601 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:39,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:39,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1653105828, now seen corresponding path program 1 times [2018-10-23 18:50:39,601 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:39,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:39,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:39,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:39,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:39,760 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-23 18:50:39,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:39,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:50:39,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:39,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:39,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:39,762 INFO L87 Difference]: Start difference. First operand 21416 states and 26340 transitions. Second operand 3 states. [2018-10-23 18:50:41,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:41,465 INFO L93 Difference]: Finished difference Result 42750 states and 52566 transitions. [2018-10-23 18:50:41,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:41,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-10-23 18:50:41,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:41,514 INFO L225 Difference]: With dead ends: 42750 [2018-10-23 18:50:41,514 INFO L226 Difference]: Without dead ends: 21336 [2018-10-23 18:50:41,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:41,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21336 states. [2018-10-23 18:50:41,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21336 to 20724. [2018-10-23 18:50:41,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20724 states. [2018-10-23 18:50:41,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20724 states to 20724 states and 25148 transitions. [2018-10-23 18:50:41,945 INFO L78 Accepts]: Start accepts. Automaton has 20724 states and 25148 transitions. Word has length 261 [2018-10-23 18:50:41,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:41,945 INFO L481 AbstractCegarLoop]: Abstraction has 20724 states and 25148 transitions. [2018-10-23 18:50:41,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:41,945 INFO L276 IsEmpty]: Start isEmpty. Operand 20724 states and 25148 transitions. [2018-10-23 18:50:41,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-23 18:50:41,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:41,974 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:41,974 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:41,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:41,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1354619751, now seen corresponding path program 1 times [2018-10-23 18:50:41,974 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:41,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:41,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:41,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:41,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:42,429 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:50:42,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:42,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:50:42,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:50:42,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:50:42,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:50:42,432 INFO L87 Difference]: Start difference. First operand 20724 states and 25148 transitions. Second operand 5 states. [2018-10-23 18:50:44,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:44,999 INFO L93 Difference]: Finished difference Result 69861 states and 84598 transitions. [2018-10-23 18:50:45,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 18:50:45,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 266 [2018-10-23 18:50:45,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:45,079 INFO L225 Difference]: With dead ends: 69861 [2018-10-23 18:50:45,080 INFO L226 Difference]: Without dead ends: 49139 [2018-10-23 18:50:45,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:50:45,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49139 states. [2018-10-23 18:50:45,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49139 to 47904. [2018-10-23 18:50:45,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47904 states. [2018-10-23 18:50:45,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47904 states to 47904 states and 56703 transitions. [2018-10-23 18:50:45,626 INFO L78 Accepts]: Start accepts. Automaton has 47904 states and 56703 transitions. Word has length 266 [2018-10-23 18:50:45,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:45,627 INFO L481 AbstractCegarLoop]: Abstraction has 47904 states and 56703 transitions. [2018-10-23 18:50:45,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 18:50:45,627 INFO L276 IsEmpty]: Start isEmpty. Operand 47904 states and 56703 transitions. [2018-10-23 18:50:45,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-23 18:50:45,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:45,646 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:45,646 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:45,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:45,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1278485182, now seen corresponding path program 1 times [2018-10-23 18:50:45,647 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:45,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:45,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:45,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:45,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:46,289 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:50:46,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:46,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:46,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:46,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:46,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:46,291 INFO L87 Difference]: Start difference. First operand 47904 states and 56703 transitions. Second operand 4 states. [2018-10-23 18:50:48,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:48,077 INFO L93 Difference]: Finished difference Result 126994 states and 149971 transitions. [2018-10-23 18:50:48,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:48,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 285 [2018-10-23 18:50:48,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:48,163 INFO L225 Difference]: With dead ends: 126994 [2018-10-23 18:50:48,164 INFO L226 Difference]: Without dead ends: 79092 [2018-10-23 18:50:48,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:48,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79092 states. [2018-10-23 18:50:48,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79092 to 77664. [2018-10-23 18:50:48,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77664 states. [2018-10-23 18:50:48,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77664 states to 77664 states and 88158 transitions. [2018-10-23 18:50:48,967 INFO L78 Accepts]: Start accepts. Automaton has 77664 states and 88158 transitions. Word has length 285 [2018-10-23 18:50:48,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:48,967 INFO L481 AbstractCegarLoop]: Abstraction has 77664 states and 88158 transitions. [2018-10-23 18:50:48,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:48,967 INFO L276 IsEmpty]: Start isEmpty. Operand 77664 states and 88158 transitions. [2018-10-23 18:50:48,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-10-23 18:50:48,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:49,000 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:49,000 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:49,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:49,001 INFO L82 PathProgramCache]: Analyzing trace with hash -310432137, now seen corresponding path program 1 times [2018-10-23 18:50:49,001 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:49,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:49,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:49,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:49,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:49,238 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-10-23 18:50:49,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:49,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:50:49,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:50:49,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:50:49,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:50:49,240 INFO L87 Difference]: Start difference. First operand 77664 states and 88158 transitions. Second operand 5 states. [2018-10-23 18:50:52,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:52,287 INFO L93 Difference]: Finished difference Result 200561 states and 228116 transitions. [2018-10-23 18:50:52,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 18:50:52,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 343 [2018-10-23 18:50:52,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:52,436 INFO L225 Difference]: With dead ends: 200561 [2018-10-23 18:50:52,437 INFO L226 Difference]: Without dead ends: 122899 [2018-10-23 18:50:52,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:50:52,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122899 states. [2018-10-23 18:50:53,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122899 to 120193. [2018-10-23 18:50:53,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120193 states. [2018-10-23 18:50:53,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120193 states to 120193 states and 136330 transitions. [2018-10-23 18:50:53,600 INFO L78 Accepts]: Start accepts. Automaton has 120193 states and 136330 transitions. Word has length 343 [2018-10-23 18:50:53,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:53,600 INFO L481 AbstractCegarLoop]: Abstraction has 120193 states and 136330 transitions. [2018-10-23 18:50:53,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 18:50:53,601 INFO L276 IsEmpty]: Start isEmpty. Operand 120193 states and 136330 transitions. [2018-10-23 18:50:53,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-23 18:50:53,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:53,654 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:53,654 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:53,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:53,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1887185285, now seen corresponding path program 1 times [2018-10-23 18:50:53,655 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:53,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:53,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:53,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:53,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:50:54,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:54,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:54,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:54,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:54,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:54,200 INFO L87 Difference]: Start difference. First operand 120193 states and 136330 transitions. Second operand 4 states. [2018-10-23 18:50:56,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:56,805 INFO L93 Difference]: Finished difference Result 253863 states and 287648 transitions. [2018-10-23 18:50:56,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:56,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 346 [2018-10-23 18:50:56,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:56,971 INFO L225 Difference]: With dead ends: 253863 [2018-10-23 18:50:56,971 INFO L226 Difference]: Without dead ends: 133670 [2018-10-23 18:50:57,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:57,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133670 states. [2018-10-23 18:50:58,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133670 to 125701. [2018-10-23 18:50:58,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125701 states. [2018-10-23 18:50:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125701 states to 125701 states and 142381 transitions. [2018-10-23 18:50:58,202 INFO L78 Accepts]: Start accepts. Automaton has 125701 states and 142381 transitions. Word has length 346 [2018-10-23 18:50:58,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:58,202 INFO L481 AbstractCegarLoop]: Abstraction has 125701 states and 142381 transitions. [2018-10-23 18:50:58,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:58,202 INFO L276 IsEmpty]: Start isEmpty. Operand 125701 states and 142381 transitions. [2018-10-23 18:50:58,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-10-23 18:50:58,233 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:58,233 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-23 18:50:58,233 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:58,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:58,234 INFO L82 PathProgramCache]: Analyzing trace with hash -308493581, now seen corresponding path program 1 times [2018-10-23 18:50:58,234 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:58,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:58,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:58,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:58,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:58,630 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-23 18:50:58,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:58,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:58,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:58,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:58,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:58,632 INFO L87 Difference]: Start difference. First operand 125701 states and 142381 transitions. Second operand 4 states. [2018-10-23 18:51:02,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:51:02,249 INFO L93 Difference]: Finished difference Result 383508 states and 430610 transitions. [2018-10-23 18:51:02,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:51:02,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 351 [2018-10-23 18:51:02,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:51:02,523 INFO L225 Difference]: With dead ends: 383508 [2018-10-23 18:51:02,523 INFO L226 Difference]: Without dead ends: 257809 [2018-10-23 18:51:02,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:51:02,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257809 states. [2018-10-23 18:51:06,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257809 to 199723. [2018-10-23 18:51:06,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199723 states. [2018-10-23 18:51:06,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199723 states to 199723 states and 222879 transitions. [2018-10-23 18:51:06,518 INFO L78 Accepts]: Start accepts. Automaton has 199723 states and 222879 transitions. Word has length 351 [2018-10-23 18:51:06,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:51:06,518 INFO L481 AbstractCegarLoop]: Abstraction has 199723 states and 222879 transitions. [2018-10-23 18:51:06,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:51:06,519 INFO L276 IsEmpty]: Start isEmpty. Operand 199723 states and 222879 transitions. [2018-10-23 18:51:06,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-10-23 18:51:06,559 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:51:06,559 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 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] [2018-10-23 18:51:06,559 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:51:06,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:51:06,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2131786340, now seen corresponding path program 1 times [2018-10-23 18:51:06,560 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:51:06,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:51:06,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:06,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:51:06,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:51:06,880 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-23 18:51:06,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:51:06,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:51:06,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:51:06,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:51:06,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:51:06,882 INFO L87 Difference]: Start difference. First operand 199723 states and 222879 transitions. Second operand 5 states. [2018-10-23 18:51:13,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:51:13,124 INFO L93 Difference]: Finished difference Result 920219 states and 1025126 transitions. [2018-10-23 18:51:13,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 18:51:13,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 372 [2018-10-23 18:51:13,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:51:16,288 INFO L225 Difference]: With dead ends: 920219 [2018-10-23 18:51:16,288 INFO L226 Difference]: Without dead ends: 720498 [2018-10-23 18:51:16,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:51:17,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720498 states. [2018-10-23 18:51:31,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720498 to 521142. [2018-10-23 18:51:31,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521142 states. [2018-10-23 18:51:33,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521142 states to 521142 states and 579669 transitions. [2018-10-23 18:51:33,331 INFO L78 Accepts]: Start accepts. Automaton has 521142 states and 579669 transitions. Word has length 372 [2018-10-23 18:51:33,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:51:33,332 INFO L481 AbstractCegarLoop]: Abstraction has 521142 states and 579669 transitions. [2018-10-23 18:51:33,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 18:51:33,332 INFO L276 IsEmpty]: Start isEmpty. Operand 521142 states and 579669 transitions. [2018-10-23 18:51:33,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2018-10-23 18:51:33,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:51:33,391 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:51:33,391 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:51:33,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:51:33,391 INFO L82 PathProgramCache]: Analyzing trace with hash -656143452, now seen corresponding path program 1 times [2018-10-23 18:51:33,391 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:51:33,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:51:33,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:33,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:51:33,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:51:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-10-23 18:51:33,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:51:33,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:51:33,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:51:33,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:51:33,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:51:33,729 INFO L87 Difference]: Start difference. First operand 521142 states and 579669 transitions. Second operand 4 states. [2018-10-23 18:51:40,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:51:40,307 INFO L93 Difference]: Finished difference Result 1051794 states and 1170526 transitions. [2018-10-23 18:51:40,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:51:40,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 401 [2018-10-23 18:51:40,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:51:40,979 INFO L225 Difference]: With dead ends: 1051794 [2018-10-23 18:51:40,979 INFO L226 Difference]: Without dead ends: 530654 [2018-10-23 18:51:41,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:51:41,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530654 states. [2018-10-23 18:51:49,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530654 to 522788. [2018-10-23 18:51:49,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522788 states. [2018-10-23 18:51:49,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522788 states to 522788 states and 580184 transitions. [2018-10-23 18:51:50,000 INFO L78 Accepts]: Start accepts. Automaton has 522788 states and 580184 transitions. Word has length 401 [2018-10-23 18:51:50,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:51:50,000 INFO L481 AbstractCegarLoop]: Abstraction has 522788 states and 580184 transitions. [2018-10-23 18:51:50,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:51:50,000 INFO L276 IsEmpty]: Start isEmpty. Operand 522788 states and 580184 transitions. [2018-10-23 18:51:50,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2018-10-23 18:51:50,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:51:50,064 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:51:50,065 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:51:50,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:51:50,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1619004822, now seen corresponding path program 1 times [2018-10-23 18:51:50,065 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:51:50,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:51:50,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:50,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:51:50,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:51:58,602 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-10-23 18:51:58,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:51:58,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:51:58,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:51:58,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:51:58,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:51:58,603 INFO L87 Difference]: Start difference. First operand 522788 states and 580184 transitions. Second operand 3 states. [2018-10-23 18:52:05,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:52:05,032 INFO L93 Difference]: Finished difference Result 1457648 states and 1614754 transitions. [2018-10-23 18:52:05,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:52:05,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 451 [2018-10-23 18:52:05,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:52:06,264 INFO L225 Difference]: With dead ends: 1457648 [2018-10-23 18:52:06,265 INFO L226 Difference]: Without dead ends: 934862 [2018-10-23 18:52:06,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:52:07,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934862 states. [2018-10-23 18:52:18,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934862 to 892015. [2018-10-23 18:52:18,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892015 states. [2018-10-23 18:52:22,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892015 states to 892015 states and 983556 transitions. [2018-10-23 18:52:22,325 INFO L78 Accepts]: Start accepts. Automaton has 892015 states and 983556 transitions. Word has length 451 [2018-10-23 18:52:22,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:52:22,326 INFO L481 AbstractCegarLoop]: Abstraction has 892015 states and 983556 transitions. [2018-10-23 18:52:22,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:52:22,326 INFO L276 IsEmpty]: Start isEmpty. Operand 892015 states and 983556 transitions. [2018-10-23 18:52:22,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2018-10-23 18:52:22,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:52:22,431 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:52:22,431 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:52:22,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:52:22,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1514659374, now seen corresponding path program 1 times [2018-10-23 18:52:22,432 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:52:22,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:52:22,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:22,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:22,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:22,947 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-23 18:52:23,173 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-23 18:52:23,444 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-23 18:52:24,136 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 337 proven. 29 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-23 18:52:24,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:52:24,136 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 18:52:24,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:24,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:52:32,771 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 256 proven. 115 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-23 18:52:32,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 18:52:32,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3] total 11 [2018-10-23 18:52:32,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-23 18:52:32,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-23 18:52:32,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-10-23 18:52:32,795 INFO L87 Difference]: Start difference. First operand 892015 states and 983556 transitions. Second operand 12 states. [2018-10-23 18:52:33,550 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 20