java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:39:19,713 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:39:19,717 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:39:19,734 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:39:19,735 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:39:19,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:39:19,738 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:39:19,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:39:19,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:39:19,750 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:39:19,751 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:39:19,752 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:39:19,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:39:19,753 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:39:19,754 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:39:19,755 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:39:19,756 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:39:19,757 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:39:19,759 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:39:19,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:39:19,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:39:19,763 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:39:19,764 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:39:19,765 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:39:19,767 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:39:19,767 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:39:19,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:39:19,768 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:39:19,769 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:39:19,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:39:19,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:39:19,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:39:19,771 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:39:19,772 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:39:19,773 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:39:19,773 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:39:19,774 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:39:19,774 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:39:19,774 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:39:19,776 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:39:19,777 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:39:19,778 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 09:39:19,795 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:39:19,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:39:19,796 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:39:19,796 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:39:19,797 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:39:19,797 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:39:19,797 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:39:19,797 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:39:19,797 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:39:19,798 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:39:19,798 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:39:19,798 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:39:19,798 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:39:19,798 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:39:19,799 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:39:19,799 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:39:19,799 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:39:19,799 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:39:19,799 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:39:19,800 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:39:19,800 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:39:19,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:39:19,800 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:39:19,801 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:39:19,801 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:39:19,801 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:39:19,801 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:39:19,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:39:19,802 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:39:19,830 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:39:19,843 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:39:19,850 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:39:19,851 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:39:19,852 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:39:19,853 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 09:39:19,914 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90beb2ef4/b260b0bf19034c6f95b85782a50c332f/FLAG76bf7e17a [2019-09-08 09:39:20,381 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:39:20,383 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 09:39:20,406 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90beb2ef4/b260b0bf19034c6f95b85782a50c332f/FLAG76bf7e17a [2019-09-08 09:39:20,691 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90beb2ef4/b260b0bf19034c6f95b85782a50c332f [2019-09-08 09:39:20,703 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:39:20,705 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:39:20,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:39:20,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:39:20,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:39:20,710 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:39:20" (1/1) ... [2019-09-08 09:39:20,713 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d09e86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:20, skipping insertion in model container [2019-09-08 09:39:20,713 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:39:20" (1/1) ... [2019-09-08 09:39:20,721 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:39:20,769 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:39:21,216 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:39:21,239 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:39:21,323 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:39:21,346 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:39:21,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:21 WrapperNode [2019-09-08 09:39:21,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:39:21,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:39:21,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:39:21,348 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:39:21,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:21" (1/1) ... [2019-09-08 09:39:21,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:21" (1/1) ... [2019-09-08 09:39:21,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:21" (1/1) ... [2019-09-08 09:39:21,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:21" (1/1) ... [2019-09-08 09:39:21,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:21" (1/1) ... [2019-09-08 09:39:21,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:21" (1/1) ... [2019-09-08 09:39:21,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:21" (1/1) ... [2019-09-08 09:39:21,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:39:21,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:39:21,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:39:21,420 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:39:21,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:39:21,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:39:21,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:39:21,481 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:39:21,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:39:21,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:39:21,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 09:39:21,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:39:21,482 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:39:21,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:39:21,482 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:39:21,482 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:39:21,483 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:39:21,483 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:39:21,483 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:39:21,483 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:39:21,483 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:39:21,484 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:39:21,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:39:21,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:39:22,341 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:39:22,341 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:39:22,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:39:22 BoogieIcfgContainer [2019-09-08 09:39:22,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:39:22,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:39:22,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:39:22,347 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:39:22,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:39:20" (1/3) ... [2019-09-08 09:39:22,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6209251b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:39:22, skipping insertion in model container [2019-09-08 09:39:22,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:21" (2/3) ... [2019-09-08 09:39:22,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6209251b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:39:22, skipping insertion in model container [2019-09-08 09:39:22,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:39:22" (3/3) ... [2019-09-08 09:39:22,351 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 09:39:22,361 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:39:22,370 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 09:39:22,387 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 09:39:22,416 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:39:22,417 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:39:22,417 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:39:22,417 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:39:22,417 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:39:22,418 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:39:22,418 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:39:22,418 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:39:22,418 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:39:22,439 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-09-08 09:39:22,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 09:39:22,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:22,449 INFO L399 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] [2019-09-08 09:39:22,452 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:22,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:22,458 INFO L82 PathProgramCache]: Analyzing trace with hash -940649787, now seen corresponding path program 1 times [2019-09-08 09:39:22,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:22,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:22,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:22,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:22,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:22,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:39:22,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:22,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:39:22,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:39:22,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:39:22,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:39:22,924 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 3 states. [2019-09-08 09:39:23,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:23,092 INFO L93 Difference]: Finished difference Result 310 states and 519 transitions. [2019-09-08 09:39:23,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:39:23,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-08 09:39:23,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:23,109 INFO L225 Difference]: With dead ends: 310 [2019-09-08 09:39:23,109 INFO L226 Difference]: Without dead ends: 215 [2019-09-08 09:39:23,113 INFO L628 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 [2019-09-08 09:39:23,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-09-08 09:39:23,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2019-09-08 09:39:23,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-08 09:39:23,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 331 transitions. [2019-09-08 09:39:23,181 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 331 transitions. Word has length 60 [2019-09-08 09:39:23,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:23,182 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 331 transitions. [2019-09-08 09:39:23,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:39:23,183 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 331 transitions. [2019-09-08 09:39:23,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 09:39:23,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:23,186 INFO L399 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] [2019-09-08 09:39:23,187 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:23,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:23,187 INFO L82 PathProgramCache]: Analyzing trace with hash -662873070, now seen corresponding path program 1 times [2019-09-08 09:39:23,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:23,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:23,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:23,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:23,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:23,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:39:23,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:23,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:39:23,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:39:23,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:39:23,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:39:23,327 INFO L87 Difference]: Start difference. First operand 212 states and 331 transitions. Second operand 3 states. [2019-09-08 09:39:23,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:23,412 INFO L93 Difference]: Finished difference Result 506 states and 815 transitions. [2019-09-08 09:39:23,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:39:23,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-08 09:39:23,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:23,417 INFO L225 Difference]: With dead ends: 506 [2019-09-08 09:39:23,417 INFO L226 Difference]: Without dead ends: 352 [2019-09-08 09:39:23,419 INFO L628 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 [2019-09-08 09:39:23,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-09-08 09:39:23,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 348. [2019-09-08 09:39:23,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-09-08 09:39:23,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 553 transitions. [2019-09-08 09:39:23,459 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 553 transitions. Word has length 62 [2019-09-08 09:39:23,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:23,460 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 553 transitions. [2019-09-08 09:39:23,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:39:23,460 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 553 transitions. [2019-09-08 09:39:23,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 09:39:23,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:23,464 INFO L399 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] [2019-09-08 09:39:23,464 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:23,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:23,465 INFO L82 PathProgramCache]: Analyzing trace with hash 443916901, now seen corresponding path program 1 times [2019-09-08 09:39:23,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:23,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:23,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:23,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:23,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:23,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:39:23,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:23,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:39:23,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:39:23,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:39:23,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:39:23,585 INFO L87 Difference]: Start difference. First operand 348 states and 553 transitions. Second operand 3 states. [2019-09-08 09:39:23,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:23,683 INFO L93 Difference]: Finished difference Result 900 states and 1455 transitions. [2019-09-08 09:39:23,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:39:23,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-08 09:39:23,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:23,691 INFO L225 Difference]: With dead ends: 900 [2019-09-08 09:39:23,691 INFO L226 Difference]: Without dead ends: 610 [2019-09-08 09:39:23,697 INFO L628 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 [2019-09-08 09:39:23,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-09-08 09:39:23,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 604. [2019-09-08 09:39:23,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-09-08 09:39:23,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 965 transitions. [2019-09-08 09:39:23,773 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 965 transitions. Word has length 64 [2019-09-08 09:39:23,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:23,776 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 965 transitions. [2019-09-08 09:39:23,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:39:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 965 transitions. [2019-09-08 09:39:23,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 09:39:23,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:23,790 INFO L399 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] [2019-09-08 09:39:23,790 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:23,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:23,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1638426254, now seen corresponding path program 1 times [2019-09-08 09:39:23,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:23,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:23,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:23,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:23,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:23,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:39:23,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:23,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:39:23,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:39:23,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:39:23,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:39:23,997 INFO L87 Difference]: Start difference. First operand 604 states and 965 transitions. Second operand 5 states. [2019-09-08 09:39:24,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:24,237 INFO L93 Difference]: Finished difference Result 2016 states and 3291 transitions. [2019-09-08 09:39:24,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:39:24,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-09-08 09:39:24,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:24,253 INFO L225 Difference]: With dead ends: 2016 [2019-09-08 09:39:24,253 INFO L226 Difference]: Without dead ends: 1470 [2019-09-08 09:39:24,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:39:24,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2019-09-08 09:39:24,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 1310. [2019-09-08 09:39:24,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2019-09-08 09:39:24,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 2125 transitions. [2019-09-08 09:39:24,342 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 2125 transitions. Word has length 66 [2019-09-08 09:39:24,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:24,342 INFO L475 AbstractCegarLoop]: Abstraction has 1310 states and 2125 transitions. [2019-09-08 09:39:24,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:39:24,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 2125 transitions. [2019-09-08 09:39:24,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 09:39:24,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:24,347 INFO L399 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] [2019-09-08 09:39:24,348 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:24,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:24,349 INFO L82 PathProgramCache]: Analyzing trace with hash 686783218, now seen corresponding path program 1 times [2019-09-08 09:39:24,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:24,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:24,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:24,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:24,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:24,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:39:24,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:24,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:39:24,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:39:24,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:39:24,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:39:24,490 INFO L87 Difference]: Start difference. First operand 1310 states and 2125 transitions. Second operand 6 states. [2019-09-08 09:39:24,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:24,866 INFO L93 Difference]: Finished difference Result 5150 states and 8404 transitions. [2019-09-08 09:39:24,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 09:39:24,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-09-08 09:39:24,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:24,891 INFO L225 Difference]: With dead ends: 5150 [2019-09-08 09:39:24,892 INFO L226 Difference]: Without dead ends: 3898 [2019-09-08 09:39:24,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:39:24,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3898 states. [2019-09-08 09:39:25,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3898 to 3803. [2019-09-08 09:39:25,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3803 states. [2019-09-08 09:39:25,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3803 states to 3803 states and 6190 transitions. [2019-09-08 09:39:25,186 INFO L78 Accepts]: Start accepts. Automaton has 3803 states and 6190 transitions. Word has length 67 [2019-09-08 09:39:25,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:25,187 INFO L475 AbstractCegarLoop]: Abstraction has 3803 states and 6190 transitions. [2019-09-08 09:39:25,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:39:25,188 INFO L276 IsEmpty]: Start isEmpty. Operand 3803 states and 6190 transitions. [2019-09-08 09:39:25,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 09:39:25,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:25,191 INFO L399 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] [2019-09-08 09:39:25,191 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:25,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:25,192 INFO L82 PathProgramCache]: Analyzing trace with hash -241609159, now seen corresponding path program 1 times [2019-09-08 09:39:25,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:25,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:25,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:25,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:25,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:25,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:39:25,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:25,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:39:25,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:39:25,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:39:25,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:39:25,323 INFO L87 Difference]: Start difference. First operand 3803 states and 6190 transitions. Second operand 4 states. [2019-09-08 09:39:25,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:25,703 INFO L93 Difference]: Finished difference Result 8879 states and 14510 transitions. [2019-09-08 09:39:25,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:39:25,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-08 09:39:25,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:25,734 INFO L225 Difference]: With dead ends: 8879 [2019-09-08 09:39:25,734 INFO L226 Difference]: Without dead ends: 5471 [2019-09-08 09:39:25,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:39:25,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5471 states. [2019-09-08 09:39:26,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5471 to 5444. [2019-09-08 09:39:26,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5444 states. [2019-09-08 09:39:26,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5444 states to 5444 states and 8865 transitions. [2019-09-08 09:39:26,141 INFO L78 Accepts]: Start accepts. Automaton has 5444 states and 8865 transitions. Word has length 68 [2019-09-08 09:39:26,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:26,143 INFO L475 AbstractCegarLoop]: Abstraction has 5444 states and 8865 transitions. [2019-09-08 09:39:26,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:39:26,144 INFO L276 IsEmpty]: Start isEmpty. Operand 5444 states and 8865 transitions. [2019-09-08 09:39:26,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 09:39:26,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:26,146 INFO L399 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] [2019-09-08 09:39:26,147 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:26,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:26,147 INFO L82 PathProgramCache]: Analyzing trace with hash 464144953, now seen corresponding path program 1 times [2019-09-08 09:39:26,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:26,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:26,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:26,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:26,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:26,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:39:26,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:26,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:39:26,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:39:26,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:39:26,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:39:26,241 INFO L87 Difference]: Start difference. First operand 5444 states and 8865 transitions. Second operand 3 states. [2019-09-08 09:39:26,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:26,709 INFO L93 Difference]: Finished difference Result 11861 states and 19400 transitions. [2019-09-08 09:39:26,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:39:26,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-08 09:39:26,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:26,753 INFO L225 Difference]: With dead ends: 11861 [2019-09-08 09:39:26,754 INFO L226 Difference]: Without dead ends: 7998 [2019-09-08 09:39:26,766 INFO L628 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 [2019-09-08 09:39:26,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7998 states. [2019-09-08 09:39:27,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7998 to 7996. [2019-09-08 09:39:27,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7996 states. [2019-09-08 09:39:27,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7996 states to 7996 states and 12990 transitions. [2019-09-08 09:39:27,237 INFO L78 Accepts]: Start accepts. Automaton has 7996 states and 12990 transitions. Word has length 69 [2019-09-08 09:39:27,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:27,238 INFO L475 AbstractCegarLoop]: Abstraction has 7996 states and 12990 transitions. [2019-09-08 09:39:27,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:39:27,238 INFO L276 IsEmpty]: Start isEmpty. Operand 7996 states and 12990 transitions. [2019-09-08 09:39:27,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 09:39:27,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:27,240 INFO L399 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] [2019-09-08 09:39:27,240 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:27,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:27,240 INFO L82 PathProgramCache]: Analyzing trace with hash -2123298740, now seen corresponding path program 1 times [2019-09-08 09:39:27,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:27,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:27,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:27,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:27,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:39:27,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:27,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:39:27,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:39:27,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:39:27,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:39:27,323 INFO L87 Difference]: Start difference. First operand 7996 states and 12990 transitions. Second operand 3 states. [2019-09-08 09:39:27,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:27,788 INFO L93 Difference]: Finished difference Result 16176 states and 26384 transitions. [2019-09-08 09:39:27,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:39:27,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-08 09:39:27,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:27,852 INFO L225 Difference]: With dead ends: 16176 [2019-09-08 09:39:27,852 INFO L226 Difference]: Without dead ends: 10915 [2019-09-08 09:39:27,868 INFO L628 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 [2019-09-08 09:39:27,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10915 states. [2019-09-08 09:39:28,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10915 to 10913. [2019-09-08 09:39:28,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10913 states. [2019-09-08 09:39:28,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10913 states to 10913 states and 17672 transitions. [2019-09-08 09:39:28,442 INFO L78 Accepts]: Start accepts. Automaton has 10913 states and 17672 transitions. Word has length 69 [2019-09-08 09:39:28,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:28,443 INFO L475 AbstractCegarLoop]: Abstraction has 10913 states and 17672 transitions. [2019-09-08 09:39:28,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:39:28,443 INFO L276 IsEmpty]: Start isEmpty. Operand 10913 states and 17672 transitions. [2019-09-08 09:39:28,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 09:39:28,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:28,444 INFO L399 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] [2019-09-08 09:39:28,445 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:28,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:28,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1047556249, now seen corresponding path program 1 times [2019-09-08 09:39:28,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:28,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:28,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:28,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:28,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:39:28,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:28,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:39:28,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:39:28,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:39:28,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:39:28,530 INFO L87 Difference]: Start difference. First operand 10913 states and 17672 transitions. Second operand 4 states. [2019-09-08 09:39:29,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:29,594 INFO L93 Difference]: Finished difference Result 31732 states and 51601 transitions. [2019-09-08 09:39:29,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:39:29,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-09-08 09:39:29,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:29,650 INFO L225 Difference]: With dead ends: 31732 [2019-09-08 09:39:29,651 INFO L226 Difference]: Without dead ends: 20957 [2019-09-08 09:39:29,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:39:29,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20957 states. [2019-09-08 09:39:30,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20957 to 15887. [2019-09-08 09:39:30,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15887 states. [2019-09-08 09:39:30,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15887 states to 15887 states and 25717 transitions. [2019-09-08 09:39:30,481 INFO L78 Accepts]: Start accepts. Automaton has 15887 states and 25717 transitions. Word has length 69 [2019-09-08 09:39:30,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:30,482 INFO L475 AbstractCegarLoop]: Abstraction has 15887 states and 25717 transitions. [2019-09-08 09:39:30,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:39:30,482 INFO L276 IsEmpty]: Start isEmpty. Operand 15887 states and 25717 transitions. [2019-09-08 09:39:30,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 09:39:30,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:30,483 INFO L399 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] [2019-09-08 09:39:30,484 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:30,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:30,484 INFO L82 PathProgramCache]: Analyzing trace with hash 795480594, now seen corresponding path program 1 times [2019-09-08 09:39:30,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:30,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:30,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:30,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:30,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:30,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:39:30,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:30,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:39:30,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:39:30,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:39:30,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:39:30,536 INFO L87 Difference]: Start difference. First operand 15887 states and 25717 transitions. Second operand 3 states. [2019-09-08 09:39:31,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:31,221 INFO L93 Difference]: Finished difference Result 36361 states and 59318 transitions. [2019-09-08 09:39:31,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:39:31,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-08 09:39:31,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:31,282 INFO L225 Difference]: With dead ends: 36361 [2019-09-08 09:39:31,282 INFO L226 Difference]: Without dead ends: 23756 [2019-09-08 09:39:31,314 INFO L628 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 [2019-09-08 09:39:31,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23756 states. [2019-09-08 09:39:32,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23756 to 23754. [2019-09-08 09:39:32,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23754 states. [2019-09-08 09:39:32,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23754 states to 23754 states and 38371 transitions. [2019-09-08 09:39:32,234 INFO L78 Accepts]: Start accepts. Automaton has 23754 states and 38371 transitions. Word has length 69 [2019-09-08 09:39:32,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:32,235 INFO L475 AbstractCegarLoop]: Abstraction has 23754 states and 38371 transitions. [2019-09-08 09:39:32,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:39:32,235 INFO L276 IsEmpty]: Start isEmpty. Operand 23754 states and 38371 transitions. [2019-09-08 09:39:32,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 09:39:32,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:32,236 INFO L399 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] [2019-09-08 09:39:32,237 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:32,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:32,237 INFO L82 PathProgramCache]: Analyzing trace with hash 189572521, now seen corresponding path program 1 times [2019-09-08 09:39:32,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:32,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:32,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:32,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:32,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:32,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:39:32,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:32,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:39:32,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:39:32,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:39:32,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:39:32,369 INFO L87 Difference]: Start difference. First operand 23754 states and 38371 transitions. Second operand 5 states. [2019-09-08 09:39:33,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:33,695 INFO L93 Difference]: Finished difference Result 49211 states and 79578 transitions. [2019-09-08 09:39:33,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:39:33,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 09:39:33,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:33,748 INFO L225 Difference]: With dead ends: 49211 [2019-09-08 09:39:33,748 INFO L226 Difference]: Without dead ends: 25542 [2019-09-08 09:39:33,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:39:33,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25542 states. [2019-09-08 09:39:34,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25542 to 23754. [2019-09-08 09:39:34,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23754 states. [2019-09-08 09:39:34,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23754 states to 23754 states and 38236 transitions. [2019-09-08 09:39:34,707 INFO L78 Accepts]: Start accepts. Automaton has 23754 states and 38236 transitions. Word has length 71 [2019-09-08 09:39:34,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:34,707 INFO L475 AbstractCegarLoop]: Abstraction has 23754 states and 38236 transitions. [2019-09-08 09:39:34,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:39:34,707 INFO L276 IsEmpty]: Start isEmpty. Operand 23754 states and 38236 transitions. [2019-09-08 09:39:34,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 09:39:34,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:34,708 INFO L399 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] [2019-09-08 09:39:34,708 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:34,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:34,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1918442634, now seen corresponding path program 1 times [2019-09-08 09:39:34,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:34,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:34,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:34,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:34,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:34,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:39:34,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:34,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:39:34,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:39:34,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:39:34,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:39:34,847 INFO L87 Difference]: Start difference. First operand 23754 states and 38236 transitions. Second operand 5 states. [2019-09-08 09:39:36,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:36,185 INFO L93 Difference]: Finished difference Result 66922 states and 107924 transitions. [2019-09-08 09:39:36,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:39:36,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-09-08 09:39:36,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:36,263 INFO L225 Difference]: With dead ends: 66922 [2019-09-08 09:39:36,264 INFO L226 Difference]: Without dead ends: 43253 [2019-09-08 09:39:36,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:39:36,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43253 states. [2019-09-08 09:39:38,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43253 to 43251. [2019-09-08 09:39:38,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43251 states. [2019-09-08 09:39:38,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43251 states to 43251 states and 69237 transitions. [2019-09-08 09:39:38,629 INFO L78 Accepts]: Start accepts. Automaton has 43251 states and 69237 transitions. Word has length 74 [2019-09-08 09:39:38,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:38,629 INFO L475 AbstractCegarLoop]: Abstraction has 43251 states and 69237 transitions. [2019-09-08 09:39:38,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:39:38,629 INFO L276 IsEmpty]: Start isEmpty. Operand 43251 states and 69237 transitions. [2019-09-08 09:39:38,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 09:39:38,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:38,630 INFO L399 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] [2019-09-08 09:39:38,630 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:38,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:38,631 INFO L82 PathProgramCache]: Analyzing trace with hash -659729786, now seen corresponding path program 1 times [2019-09-08 09:39:38,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:38,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:38,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:38,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:38,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:38,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:39:38,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:38,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:39:38,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:39:38,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:39:38,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:39:38,720 INFO L87 Difference]: Start difference. First operand 43251 states and 69237 transitions. Second operand 5 states. [2019-09-08 09:39:41,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:41,044 INFO L93 Difference]: Finished difference Result 76099 states and 121100 transitions. [2019-09-08 09:39:41,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:39:41,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-08 09:39:41,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:41,138 INFO L225 Difference]: With dead ends: 76099 [2019-09-08 09:39:41,139 INFO L226 Difference]: Without dead ends: 76097 [2019-09-08 09:39:41,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:39:41,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76097 states. [2019-09-08 09:39:44,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76097 to 44327. [2019-09-08 09:39:44,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44327 states. [2019-09-08 09:39:44,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44327 states to 44327 states and 70304 transitions. [2019-09-08 09:39:44,227 INFO L78 Accepts]: Start accepts. Automaton has 44327 states and 70304 transitions. Word has length 75 [2019-09-08 09:39:44,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:44,227 INFO L475 AbstractCegarLoop]: Abstraction has 44327 states and 70304 transitions. [2019-09-08 09:39:44,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:39:44,228 INFO L276 IsEmpty]: Start isEmpty. Operand 44327 states and 70304 transitions. [2019-09-08 09:39:44,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 09:39:44,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:44,233 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 09:39:44,233 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:44,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:44,233 INFO L82 PathProgramCache]: Analyzing trace with hash -242897637, now seen corresponding path program 1 times [2019-09-08 09:39:44,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:44,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:44,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:44,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:44,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:44,351 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 09:39:44,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:44,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:39:44,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:39:44,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:39:44,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:39:44,353 INFO L87 Difference]: Start difference. First operand 44327 states and 70304 transitions. Second operand 5 states. [2019-09-08 09:39:46,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:46,497 INFO L93 Difference]: Finished difference Result 59339 states and 94224 transitions. [2019-09-08 09:39:46,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:39:46,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 09:39:46,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:46,570 INFO L225 Difference]: With dead ends: 59339 [2019-09-08 09:39:46,570 INFO L226 Difference]: Without dead ends: 54677 [2019-09-08 09:39:46,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:39:46,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54677 states. [2019-09-08 09:39:48,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54677 to 53535. [2019-09-08 09:39:48,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53535 states. [2019-09-08 09:39:48,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53535 states to 53535 states and 84784 transitions. [2019-09-08 09:39:48,689 INFO L78 Accepts]: Start accepts. Automaton has 53535 states and 84784 transitions. Word has length 97 [2019-09-08 09:39:48,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:48,690 INFO L475 AbstractCegarLoop]: Abstraction has 53535 states and 84784 transitions. [2019-09-08 09:39:48,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:39:48,690 INFO L276 IsEmpty]: Start isEmpty. Operand 53535 states and 84784 transitions. [2019-09-08 09:39:48,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 09:39:48,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:48,692 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 09:39:48,692 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:48,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:48,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1464625966, now seen corresponding path program 1 times [2019-09-08 09:39:48,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:48,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:48,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:48,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:48,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:48,760 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:39:48,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:48,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:39:48,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:39:48,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:39:48,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:39:48,761 INFO L87 Difference]: Start difference. First operand 53535 states and 84784 transitions. Second operand 3 states. [2019-09-08 09:39:50,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:50,771 INFO L93 Difference]: Finished difference Result 99623 states and 158368 transitions. [2019-09-08 09:39:50,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:39:50,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-08 09:39:50,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:50,843 INFO L225 Difference]: With dead ends: 99623 [2019-09-08 09:39:50,843 INFO L226 Difference]: Without dead ends: 46173 [2019-09-08 09:39:52,315 INFO L628 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 [2019-09-08 09:39:52,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46173 states. [2019-09-08 09:39:53,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46173 to 46171. [2019-09-08 09:39:53,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46171 states. [2019-09-08 09:39:53,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46171 states to 46171 states and 73211 transitions. [2019-09-08 09:39:53,959 INFO L78 Accepts]: Start accepts. Automaton has 46171 states and 73211 transitions. Word has length 97 [2019-09-08 09:39:53,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:53,959 INFO L475 AbstractCegarLoop]: Abstraction has 46171 states and 73211 transitions. [2019-09-08 09:39:53,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:39:53,960 INFO L276 IsEmpty]: Start isEmpty. Operand 46171 states and 73211 transitions. [2019-09-08 09:39:53,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 09:39:53,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:53,962 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 09:39:53,962 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:53,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:53,963 INFO L82 PathProgramCache]: Analyzing trace with hash 88438004, now seen corresponding path program 1 times [2019-09-08 09:39:53,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:53,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:53,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:53,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:53,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:54,037 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:39:54,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:54,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:39:54,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:39:54,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:39:54,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:39:54,041 INFO L87 Difference]: Start difference. First operand 46171 states and 73211 transitions. Second operand 3 states. [2019-09-08 09:39:54,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:54,986 INFO L93 Difference]: Finished difference Result 65146 states and 103464 transitions. [2019-09-08 09:39:54,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:39:54,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-08 09:39:54,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:55,019 INFO L225 Difference]: With dead ends: 65146 [2019-09-08 09:39:55,020 INFO L226 Difference]: Without dead ends: 19087 [2019-09-08 09:39:55,070 INFO L628 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 [2019-09-08 09:39:55,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19087 states. [2019-09-08 09:39:56,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19087 to 19085. [2019-09-08 09:39:56,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19085 states. [2019-09-08 09:39:56,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19085 states to 19085 states and 30195 transitions. [2019-09-08 09:39:56,382 INFO L78 Accepts]: Start accepts. Automaton has 19085 states and 30195 transitions. Word has length 97 [2019-09-08 09:39:56,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:56,383 INFO L475 AbstractCegarLoop]: Abstraction has 19085 states and 30195 transitions. [2019-09-08 09:39:56,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:39:56,383 INFO L276 IsEmpty]: Start isEmpty. Operand 19085 states and 30195 transitions. [2019-09-08 09:39:56,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 09:39:56,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:56,385 INFO L399 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] [2019-09-08 09:39:56,385 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:56,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:56,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1255185238, now seen corresponding path program 1 times [2019-09-08 09:39:56,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:56,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:56,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:56,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:56,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:56,523 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:39:56,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 09:39:56,524 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 09:39:56,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:56,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 09:39:56,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 09:39:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 09:39:56,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 09:39:56,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 09:39:56,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 09:39:56,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 09:39:56,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:39:56,798 INFO L87 Difference]: Start difference. First operand 19085 states and 30195 transitions. Second operand 8 states. [2019-09-08 09:39:59,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:59,267 INFO L93 Difference]: Finished difference Result 38231 states and 60909 transitions. [2019-09-08 09:39:59,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 09:39:59,268 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2019-09-08 09:39:59,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:59,410 INFO L225 Difference]: With dead ends: 38231 [2019-09-08 09:39:59,410 INFO L226 Difference]: Without dead ends: 27770 [2019-09-08 09:39:59,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-09-08 09:39:59,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27770 states. [2019-09-08 09:40:01,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27770 to 25092. [2019-09-08 09:40:01,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25092 states. [2019-09-08 09:40:01,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25092 states to 25092 states and 39715 transitions. [2019-09-08 09:40:01,137 INFO L78 Accepts]: Start accepts. Automaton has 25092 states and 39715 transitions. Word has length 99 [2019-09-08 09:40:01,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:01,137 INFO L475 AbstractCegarLoop]: Abstraction has 25092 states and 39715 transitions. [2019-09-08 09:40:01,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 09:40:01,137 INFO L276 IsEmpty]: Start isEmpty. Operand 25092 states and 39715 transitions. [2019-09-08 09:40:01,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 09:40:01,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:01,139 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 09:40:01,140 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:01,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:01,140 INFO L82 PathProgramCache]: Analyzing trace with hash -464235949, now seen corresponding path program 1 times [2019-09-08 09:40:01,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:01,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:01,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:01,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:01,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:01,200 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 09:40:01,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:01,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:01,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:01,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:01,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:01,201 INFO L87 Difference]: Start difference. First operand 25092 states and 39715 transitions. Second operand 3 states. [2019-09-08 09:40:03,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:03,508 INFO L93 Difference]: Finished difference Result 68438 states and 108507 transitions. [2019-09-08 09:40:03,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:03,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-08 09:40:03,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:03,685 INFO L225 Difference]: With dead ends: 68438 [2019-09-08 09:40:03,685 INFO L226 Difference]: Without dead ends: 45224 [2019-09-08 09:40:03,720 INFO L628 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 [2019-09-08 09:40:03,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45224 states. [2019-09-08 09:40:05,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45224 to 45145. [2019-09-08 09:40:05,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45145 states. [2019-09-08 09:40:05,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45145 states to 45145 states and 71429 transitions. [2019-09-08 09:40:05,604 INFO L78 Accepts]: Start accepts. Automaton has 45145 states and 71429 transitions. Word has length 100 [2019-09-08 09:40:05,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:05,604 INFO L475 AbstractCegarLoop]: Abstraction has 45145 states and 71429 transitions. [2019-09-08 09:40:05,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:05,604 INFO L276 IsEmpty]: Start isEmpty. Operand 45145 states and 71429 transitions. [2019-09-08 09:40:05,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 09:40:05,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:05,606 INFO L399 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] [2019-09-08 09:40:05,607 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:05,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:05,607 INFO L82 PathProgramCache]: Analyzing trace with hash 358983543, now seen corresponding path program 1 times [2019-09-08 09:40:05,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:05,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:05,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:05,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:05,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:05,675 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:40:05,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:05,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:05,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:05,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:05,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:05,678 INFO L87 Difference]: Start difference. First operand 45145 states and 71429 transitions. Second operand 3 states. [2019-09-08 09:40:07,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:07,009 INFO L93 Difference]: Finished difference Result 64644 states and 102435 transitions. [2019-09-08 09:40:07,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:07,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-08 09:40:07,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:07,047 INFO L225 Difference]: With dead ends: 64644 [2019-09-08 09:40:07,048 INFO L226 Difference]: Without dead ends: 19634 [2019-09-08 09:40:07,095 INFO L628 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 [2019-09-08 09:40:07,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19634 states. [2019-09-08 09:40:07,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19634 to 19632. [2019-09-08 09:40:07,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19632 states. [2019-09-08 09:40:07,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19632 states to 19632 states and 30961 transitions. [2019-09-08 09:40:07,905 INFO L78 Accepts]: Start accepts. Automaton has 19632 states and 30961 transitions. Word has length 100 [2019-09-08 09:40:07,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:07,905 INFO L475 AbstractCegarLoop]: Abstraction has 19632 states and 30961 transitions. [2019-09-08 09:40:07,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:07,905 INFO L276 IsEmpty]: Start isEmpty. Operand 19632 states and 30961 transitions. [2019-09-08 09:40:07,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 09:40:07,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:07,907 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 09:40:07,907 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:07,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:07,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1045071639, now seen corresponding path program 1 times [2019-09-08 09:40:07,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:07,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:07,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:07,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:07,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:07,992 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:40:07,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 09:40:07,992 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 09:40:08,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 09:40:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:08,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 09:40:08,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 09:40:08,198 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-08 09:40:08,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 09:40:08,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 09:40:08,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 09:40:08,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 09:40:08,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:40:08,214 INFO L87 Difference]: Start difference. First operand 19632 states and 30961 transitions. Second operand 8 states. [2019-09-08 09:40:09,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:09,785 INFO L93 Difference]: Finished difference Result 41461 states and 65655 transitions. [2019-09-08 09:40:09,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 09:40:09,786 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-09-08 09:40:09,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:10,047 INFO L225 Difference]: With dead ends: 41461 [2019-09-08 09:40:10,048 INFO L226 Difference]: Without dead ends: 30259 [2019-09-08 09:40:10,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-09-08 09:40:10,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30259 states. [2019-09-08 09:40:11,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30259 to 29680. [2019-09-08 09:40:11,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29680 states. [2019-09-08 09:40:11,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29680 states to 29680 states and 46895 transitions. [2019-09-08 09:40:11,224 INFO L78 Accepts]: Start accepts. Automaton has 29680 states and 46895 transitions. Word has length 101 [2019-09-08 09:40:11,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:11,225 INFO L475 AbstractCegarLoop]: Abstraction has 29680 states and 46895 transitions. [2019-09-08 09:40:11,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 09:40:11,225 INFO L276 IsEmpty]: Start isEmpty. Operand 29680 states and 46895 transitions. [2019-09-08 09:40:11,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 09:40:11,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:11,226 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 09:40:11,227 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:11,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:11,228 INFO L82 PathProgramCache]: Analyzing trace with hash -381064316, now seen corresponding path program 1 times [2019-09-08 09:40:11,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:11,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:11,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:11,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:11,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:11,357 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 09:40:11,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:11,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:40:11,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:40:11,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:40:11,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:40:11,359 INFO L87 Difference]: Start difference. First operand 29680 states and 46895 transitions. Second operand 4 states. [2019-09-08 09:40:13,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:13,817 INFO L93 Difference]: Finished difference Result 87471 states and 138174 transitions. [2019-09-08 09:40:13,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:40:13,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-08 09:40:13,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:13,926 INFO L225 Difference]: With dead ends: 87471 [2019-09-08 09:40:13,926 INFO L226 Difference]: Without dead ends: 57804 [2019-09-08 09:40:13,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:40:14,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57804 states. [2019-09-08 09:40:16,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57804 to 57802. [2019-09-08 09:40:16,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57802 states. [2019-09-08 09:40:16,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57802 states to 57802 states and 90670 transitions. [2019-09-08 09:40:16,824 INFO L78 Accepts]: Start accepts. Automaton has 57802 states and 90670 transitions. Word has length 102 [2019-09-08 09:40:16,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:16,824 INFO L475 AbstractCegarLoop]: Abstraction has 57802 states and 90670 transitions. [2019-09-08 09:40:16,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:40:16,824 INFO L276 IsEmpty]: Start isEmpty. Operand 57802 states and 90670 transitions. [2019-09-08 09:40:16,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 09:40:16,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:16,826 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 09:40:16,826 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:16,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:16,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1735669958, now seen corresponding path program 1 times [2019-09-08 09:40:16,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:16,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:16,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:16,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:16,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:16,869 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 09:40:16,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:16,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:16,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:16,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:16,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:16,871 INFO L87 Difference]: Start difference. First operand 57802 states and 90670 transitions. Second operand 3 states. [2019-09-08 09:40:23,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:23,835 INFO L93 Difference]: Finished difference Result 173360 states and 271940 transitions. [2019-09-08 09:40:23,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:23,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-09-08 09:40:23,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:24,003 INFO L225 Difference]: With dead ends: 173360 [2019-09-08 09:40:24,003 INFO L226 Difference]: Without dead ends: 115590 [2019-09-08 09:40:24,063 INFO L628 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 [2019-09-08 09:40:24,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115590 states. [2019-09-08 09:40:27,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115590 to 57804. [2019-09-08 09:40:27,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57804 states. [2019-09-08 09:40:27,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57804 states to 57804 states and 90672 transitions. [2019-09-08 09:40:27,774 INFO L78 Accepts]: Start accepts. Automaton has 57804 states and 90672 transitions. Word has length 103 [2019-09-08 09:40:27,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:27,775 INFO L475 AbstractCegarLoop]: Abstraction has 57804 states and 90672 transitions. [2019-09-08 09:40:27,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:27,775 INFO L276 IsEmpty]: Start isEmpty. Operand 57804 states and 90672 transitions. [2019-09-08 09:40:27,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 09:40:27,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:27,777 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 09:40:27,777 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:27,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:27,777 INFO L82 PathProgramCache]: Analyzing trace with hash -854773197, now seen corresponding path program 1 times [2019-09-08 09:40:27,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:27,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:27,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:27,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:27,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:27,842 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 09:40:27,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:27,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:27,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:27,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:27,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:27,844 INFO L87 Difference]: Start difference. First operand 57804 states and 90672 transitions. Second operand 3 states. [2019-09-08 09:40:35,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:35,275 INFO L93 Difference]: Finished difference Result 170126 states and 266799 transitions. [2019-09-08 09:40:35,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:35,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-08 09:40:35,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:35,414 INFO L225 Difference]: With dead ends: 170126 [2019-09-08 09:40:35,414 INFO L226 Difference]: Without dead ends: 112502 [2019-09-08 09:40:35,461 INFO L628 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 [2019-09-08 09:40:35,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112502 states. [2019-09-08 09:40:43,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112502 to 112500. [2019-09-08 09:40:43,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112500 states. [2019-09-08 09:40:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112500 states to 112500 states and 175119 transitions. [2019-09-08 09:40:44,054 INFO L78 Accepts]: Start accepts. Automaton has 112500 states and 175119 transitions. Word has length 104 [2019-09-08 09:40:44,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:44,055 INFO L475 AbstractCegarLoop]: Abstraction has 112500 states and 175119 transitions. [2019-09-08 09:40:44,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:44,055 INFO L276 IsEmpty]: Start isEmpty. Operand 112500 states and 175119 transitions. [2019-09-08 09:40:44,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 09:40:44,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:44,058 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 09:40:44,058 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:44,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:44,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1855097296, now seen corresponding path program 1 times [2019-09-08 09:40:44,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:44,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:44,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:44,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:44,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:44,164 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 09:40:44,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:44,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:40:44,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:40:44,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:40:44,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:40:44,166 INFO L87 Difference]: Start difference. First operand 112500 states and 175119 transitions. Second operand 4 states. [2019-09-08 09:40:48,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:48,847 INFO L93 Difference]: Finished difference Result 198252 states and 308085 transitions. [2019-09-08 09:40:48,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:40:48,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-08 09:40:48,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:48,977 INFO L225 Difference]: With dead ends: 198252 [2019-09-08 09:40:48,978 INFO L226 Difference]: Without dead ends: 85922 [2019-09-08 09:40:49,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:40:49,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85922 states. [2019-09-08 09:40:57,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85922 to 85922. [2019-09-08 09:40:57,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85922 states. [2019-09-08 09:40:57,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85922 states to 85922 states and 133191 transitions. [2019-09-08 09:40:57,473 INFO L78 Accepts]: Start accepts. Automaton has 85922 states and 133191 transitions. Word has length 104 [2019-09-08 09:40:57,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:57,473 INFO L475 AbstractCegarLoop]: Abstraction has 85922 states and 133191 transitions. [2019-09-08 09:40:57,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:40:57,473 INFO L276 IsEmpty]: Start isEmpty. Operand 85922 states and 133191 transitions. [2019-09-08 09:40:57,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 09:40:57,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:57,476 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 09:40:57,476 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:57,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:57,477 INFO L82 PathProgramCache]: Analyzing trace with hash -836909356, now seen corresponding path program 1 times [2019-09-08 09:40:57,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:57,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:57,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:57,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:57,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:57,667 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:40:57,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 09:40:57,668 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 09:40:57,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 09:40:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:57,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 09:40:57,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 09:40:57,842 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 09:40:57,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 09:40:57,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2019-09-08 09:40:57,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 09:40:57,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 09:40:57,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:40:57,850 INFO L87 Difference]: Start difference. First operand 85922 states and 133191 transitions. Second operand 9 states. [2019-09-08 09:41:05,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:05,666 INFO L93 Difference]: Finished difference Result 165841 states and 257375 transitions. [2019-09-08 09:41:05,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:41:05,667 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 106 [2019-09-08 09:41:05,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:05,910 INFO L225 Difference]: With dead ends: 165841 [2019-09-08 09:41:05,911 INFO L226 Difference]: Without dead ends: 140575 [2019-09-08 09:41:05,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:41:06,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140575 states. [2019-09-08 09:41:14,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140575 to 134895. [2019-09-08 09:41:14,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134895 states. [2019-09-08 09:41:14,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134895 states to 134895 states and 208809 transitions. [2019-09-08 09:41:14,948 INFO L78 Accepts]: Start accepts. Automaton has 134895 states and 208809 transitions. Word has length 106 [2019-09-08 09:41:14,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:14,948 INFO L475 AbstractCegarLoop]: Abstraction has 134895 states and 208809 transitions. [2019-09-08 09:41:14,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 09:41:14,948 INFO L276 IsEmpty]: Start isEmpty. Operand 134895 states and 208809 transitions. [2019-09-08 09:41:14,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 09:41:14,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:14,952 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 09:41:14,952 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:14,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:14,952 INFO L82 PathProgramCache]: Analyzing trace with hash 998727188, now seen corresponding path program 1 times [2019-09-08 09:41:14,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:14,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:14,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:14,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:14,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:15,082 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 09:41:15,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:15,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:41:15,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:41:15,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:41:15,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:41:15,084 INFO L87 Difference]: Start difference. First operand 134895 states and 208809 transitions. Second operand 4 states. [2019-09-08 09:41:31,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:31,552 INFO L93 Difference]: Finished difference Result 355547 states and 549838 transitions. [2019-09-08 09:41:31,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:41:31,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-08 09:41:31,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:31,955 INFO L225 Difference]: With dead ends: 355547 [2019-09-08 09:41:31,955 INFO L226 Difference]: Without dead ends: 220675 [2019-09-08 09:41:32,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:41:32,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220675 states. [2019-09-08 09:41:50,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220675 to 220673. [2019-09-08 09:41:50,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220673 states. [2019-09-08 09:41:51,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220673 states to 220673 states and 338121 transitions. [2019-09-08 09:41:51,196 INFO L78 Accepts]: Start accepts. Automaton has 220673 states and 338121 transitions. Word has length 106 [2019-09-08 09:41:51,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:51,196 INFO L475 AbstractCegarLoop]: Abstraction has 220673 states and 338121 transitions. [2019-09-08 09:41:51,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:41:51,196 INFO L276 IsEmpty]: Start isEmpty. Operand 220673 states and 338121 transitions. [2019-09-08 09:41:51,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 09:41:51,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:51,201 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 09:41:51,201 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:51,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:51,201 INFO L82 PathProgramCache]: Analyzing trace with hash -229277515, now seen corresponding path program 1 times [2019-09-08 09:41:51,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:51,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:51,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:51,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:51,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:51,271 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 09:41:51,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:51,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:41:51,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:41:51,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:41:51,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:41:51,272 INFO L87 Difference]: Start difference. First operand 220673 states and 338121 transitions. Second operand 3 states. [2019-09-08 09:42:23,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:23,555 INFO L93 Difference]: Finished difference Result 649321 states and 994208 transitions. [2019-09-08 09:42:23,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:42:23,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-08 09:42:23,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:24,280 INFO L225 Difference]: With dead ends: 649321 [2019-09-08 09:42:24,281 INFO L226 Difference]: Without dead ends: 429060 [2019-09-08 09:42:24,478 INFO L628 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 [2019-09-08 09:42:24,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429060 states. [2019-09-08 09:43:05,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429060 to 429058. [2019-09-08 09:43:05,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429058 states. [2019-09-08 09:43:06,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429058 states to 429058 states and 651716 transitions. [2019-09-08 09:43:06,669 INFO L78 Accepts]: Start accepts. Automaton has 429058 states and 651716 transitions. Word has length 108 [2019-09-08 09:43:06,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:06,669 INFO L475 AbstractCegarLoop]: Abstraction has 429058 states and 651716 transitions. [2019-09-08 09:43:06,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:43:06,669 INFO L276 IsEmpty]: Start isEmpty. Operand 429058 states and 651716 transitions. [2019-09-08 09:43:06,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 09:43:06,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:06,678 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 09:43:06,678 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:06,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:06,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1206084882, now seen corresponding path program 1 times [2019-09-08 09:43:06,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:06,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:06,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:06,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:06,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:06,777 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 09:43:06,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:06,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:43:06,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:43:06,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:43:06,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:43:06,778 INFO L87 Difference]: Start difference. First operand 429058 states and 651716 transitions. Second operand 4 states. [2019-09-08 09:43:38,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:38,137 INFO L93 Difference]: Finished difference Result 691170 states and 1048343 transitions. [2019-09-08 09:43:38,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:43:38,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-08 09:43:38,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:38,752 INFO L225 Difference]: With dead ends: 691170 [2019-09-08 09:43:38,752 INFO L226 Difference]: Without dead ends: 348120 [2019-09-08 09:43:39,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:43:39,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348120 states. [2019-09-08 09:44:11,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348120 to 348120. [2019-09-08 09:44:11,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348120 states. [2019-09-08 09:44:12,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348120 states to 348120 states and 527214 transitions. [2019-09-08 09:44:12,069 INFO L78 Accepts]: Start accepts. Automaton has 348120 states and 527214 transitions. Word has length 108 [2019-09-08 09:44:12,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:44:12,069 INFO L475 AbstractCegarLoop]: Abstraction has 348120 states and 527214 transitions. [2019-09-08 09:44:12,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:44:12,069 INFO L276 IsEmpty]: Start isEmpty. Operand 348120 states and 527214 transitions. [2019-09-08 09:44:12,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 09:44:12,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:12,077 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 09:44:12,077 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:12,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:12,077 INFO L82 PathProgramCache]: Analyzing trace with hash 2089837102, now seen corresponding path program 1 times [2019-09-08 09:44:12,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:12,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:12,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:12,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:12,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:12,126 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 09:44:12,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:12,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:44:12,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:44:12,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:44:12,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:44:12,128 INFO L87 Difference]: Start difference. First operand 348120 states and 527214 transitions. Second operand 3 states. [2019-09-08 09:45:12,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:45:12,645 INFO L93 Difference]: Finished difference Result 1037076 states and 1568177 transitions. [2019-09-08 09:45:12,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:45:12,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-08 09:45:12,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:45:14,020 INFO L225 Difference]: With dead ends: 1037076 [2019-09-08 09:45:14,021 INFO L226 Difference]: Without dead ends: 689775 [2019-09-08 09:45:14,345 INFO L628 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 [2019-09-08 09:45:14,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689775 states. [2019-09-08 09:46:22,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689775 to 689773. [2019-09-08 09:46:22,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689773 states. [2019-09-08 09:46:24,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689773 states to 689773 states and 1036190 transitions. [2019-09-08 09:46:24,500 INFO L78 Accepts]: Start accepts. Automaton has 689773 states and 1036190 transitions. Word has length 110 [2019-09-08 09:46:24,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:46:24,501 INFO L475 AbstractCegarLoop]: Abstraction has 689773 states and 1036190 transitions. [2019-09-08 09:46:24,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:46:24,501 INFO L276 IsEmpty]: Start isEmpty. Operand 689773 states and 1036190 transitions. [2019-09-08 09:46:24,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 09:46:24,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:24,511 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 09:46:24,511 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:24,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:24,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1973856727, now seen corresponding path program 1 times [2019-09-08 09:46:24,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:24,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:24,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:24,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:24,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:24,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 09:46:24,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:24,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:46:24,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:46:24,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:46:24,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:46:24,640 INFO L87 Difference]: Start difference. First operand 689773 states and 1036190 transitions. Second operand 4 states. [2019-09-08 09:48:37,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:37,347 INFO L93 Difference]: Finished difference Result 2030486 states and 3046461 transitions. [2019-09-08 09:48:37,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:48:37,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-08 09:48:37,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:40,264 INFO L225 Difference]: With dead ends: 2030486 [2019-09-08 09:48:40,264 INFO L226 Difference]: Without dead ends: 1340756 [2019-09-08 09:48:40,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:48:42,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340756 states.