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.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:27:23,660 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:27:23,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:27:23,679 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:27:23,680 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:27:23,681 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:27:23,683 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:27:23,691 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:27:23,695 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:27:23,697 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:27:23,699 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:27:23,701 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:27:23,701 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:27:23,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:27:23,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:27:23,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:27:23,708 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:27:23,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:27:23,711 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:27:23,716 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:27:23,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:27:23,722 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:27:23,724 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:27:23,725 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:27:23,727 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:27:23,727 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:27:23,727 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:27:23,729 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:27:23,730 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:27:23,731 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:27:23,731 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:27:23,733 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:27:23,734 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:27:23,734 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:27:23,736 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:27:23,736 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:27:23,737 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:27:23,737 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:27:23,737 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:27:23,738 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:27:23,739 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:27:23,739 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:27:23,753 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:27:23,753 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:27:23,754 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:27:23,754 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:27:23,754 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:27:23,755 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:27:23,755 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:27:23,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:27:23,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:27:23,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:27:23,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:27:23,758 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:27:23,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:27:23,758 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:27:23,758 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:27:23,759 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:27:23,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:27:23,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:27:23,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:27:23,759 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:27:23,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:27:23,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:27:23,761 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:27:23,761 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:27:23,762 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:27:23,762 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:27:23,762 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:27:23,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:27:23,763 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:27:23,806 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:27:23,819 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:27:23,823 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:27:23,825 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:27:23,825 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:27:23,826 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.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 09:27:23,903 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58e9d8ff6/f9ae30f7a0f94135beb255bb008645d5/FLAGc06ca0a12 [2019-09-08 09:27:24,327 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:27:24,327 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 09:27:24,337 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58e9d8ff6/f9ae30f7a0f94135beb255bb008645d5/FLAGc06ca0a12 [2019-09-08 09:27:24,705 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58e9d8ff6/f9ae30f7a0f94135beb255bb008645d5 [2019-09-08 09:27:24,715 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:27:24,717 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:27:24,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:27:24,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:27:24,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:27:24,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:27:24" (1/1) ... [2019-09-08 09:27:24,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45625c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:27:24, skipping insertion in model container [2019-09-08 09:27:24,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:27:24" (1/1) ... [2019-09-08 09:27:24,732 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:27:24,775 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:27:25,023 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:27:25,128 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:27:25,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:27:25,225 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:27:25,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:27:25 WrapperNode [2019-09-08 09:27:25,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:27:25,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:27:25,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:27:25,226 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:27:25,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:27:25" (1/1) ... [2019-09-08 09:27:25,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:27:25" (1/1) ... [2019-09-08 09:27:25,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:27:25" (1/1) ... [2019-09-08 09:27:25,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:27:25" (1/1) ... [2019-09-08 09:27:25,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:27:25" (1/1) ... [2019-09-08 09:27:25,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:27:25" (1/1) ... [2019-09-08 09:27:25,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:27:25" (1/1) ... [2019-09-08 09:27:25,301 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:27:25,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:27:25,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:27:25,302 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:27:25,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:27:25" (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:27:25,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:27:25,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:27:25,352 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:27:25,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:27:25,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:27:25,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 09:27:25,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:27:25,353 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:27:25,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:27:25,353 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:27:25,353 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:27:25,354 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:27:25,354 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:27:25,354 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:27:25,354 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:27:25,354 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:27:25,354 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:27:25,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:27:25,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:27:26,114 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:27:26,115 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:27:26,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:27:26 BoogieIcfgContainer [2019-09-08 09:27:26,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:27:26,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:27:26,118 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:27:26,122 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:27:26,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:27:24" (1/3) ... [2019-09-08 09:27:26,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aebcc4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:27:26, skipping insertion in model container [2019-09-08 09:27:26,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:27:25" (2/3) ... [2019-09-08 09:27:26,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aebcc4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:27:26, skipping insertion in model container [2019-09-08 09:27:26,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:27:26" (3/3) ... [2019-09-08 09:27:26,130 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 09:27:26,139 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:27:26,163 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 09:27:26,183 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 09:27:26,218 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:27:26,219 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:27:26,219 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:27:26,219 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:27:26,220 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:27:26,220 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:27:26,220 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:27:26,220 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:27:26,220 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:27:26,251 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2019-09-08 09:27:26,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 09:27:26,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:26,267 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] [2019-09-08 09:27:26,269 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:26,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:26,276 INFO L82 PathProgramCache]: Analyzing trace with hash -720461132, now seen corresponding path program 1 times [2019-09-08 09:27:26,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:26,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:26,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:26,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:26,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:26,776 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:27:26,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:26,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:27:26,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:27:26,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:27:26,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:27:26,805 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 3 states. [2019-09-08 09:27:26,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:26,980 INFO L93 Difference]: Finished difference Result 304 states and 507 transitions. [2019-09-08 09:27:26,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:27:26,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-09-08 09:27:26,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:27,024 INFO L225 Difference]: With dead ends: 304 [2019-09-08 09:27:27,024 INFO L226 Difference]: Without dead ends: 209 [2019-09-08 09:27:27,028 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:27:27,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-08 09:27:27,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2019-09-08 09:27:27,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-08 09:27:27,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 325 transitions. [2019-09-08 09:27:27,098 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 325 transitions. Word has length 54 [2019-09-08 09:27:27,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:27,100 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 325 transitions. [2019-09-08 09:27:27,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:27:27,100 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 325 transitions. [2019-09-08 09:27:27,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 09:27:27,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:27,105 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] [2019-09-08 09:27:27,106 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:27,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:27,106 INFO L82 PathProgramCache]: Analyzing trace with hash 485026305, now seen corresponding path program 1 times [2019-09-08 09:27:27,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:27,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:27,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:27,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:27,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:27,219 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:27:27,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:27,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:27:27,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:27:27,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:27:27,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:27:27,225 INFO L87 Difference]: Start difference. First operand 206 states and 325 transitions. Second operand 3 states. [2019-09-08 09:27:27,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:27,304 INFO L93 Difference]: Finished difference Result 500 states and 809 transitions. [2019-09-08 09:27:27,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:27:27,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-08 09:27:27,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:27,310 INFO L225 Difference]: With dead ends: 500 [2019-09-08 09:27:27,310 INFO L226 Difference]: Without dead ends: 346 [2019-09-08 09:27:27,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:27:27,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-08 09:27:27,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 342. [2019-09-08 09:27:27,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-09-08 09:27:27,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 547 transitions. [2019-09-08 09:27:27,381 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 547 transitions. Word has length 56 [2019-09-08 09:27:27,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:27,382 INFO L475 AbstractCegarLoop]: Abstraction has 342 states and 547 transitions. [2019-09-08 09:27:27,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:27:27,382 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 547 transitions. [2019-09-08 09:27:27,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 09:27:27,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:27,385 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] [2019-09-08 09:27:27,386 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:27,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:27,388 INFO L82 PathProgramCache]: Analyzing trace with hash -231379372, now seen corresponding path program 1 times [2019-09-08 09:27:27,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:27,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:27,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:27,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:27,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:27,512 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:27:27,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:27,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:27:27,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:27:27,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:27:27,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:27:27,515 INFO L87 Difference]: Start difference. First operand 342 states and 547 transitions. Second operand 3 states. [2019-09-08 09:27:27,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:27,585 INFO L93 Difference]: Finished difference Result 894 states and 1449 transitions. [2019-09-08 09:27:27,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:27:27,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-08 09:27:27,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:27,591 INFO L225 Difference]: With dead ends: 894 [2019-09-08 09:27:27,592 INFO L226 Difference]: Without dead ends: 604 [2019-09-08 09:27:27,596 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:27:27,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-09-08 09:27:27,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 598. [2019-09-08 09:27:27,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-09-08 09:27:27,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 959 transitions. [2019-09-08 09:27:27,642 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 959 transitions. Word has length 58 [2019-09-08 09:27:27,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:27,645 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 959 transitions. [2019-09-08 09:27:27,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:27:27,645 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 959 transitions. [2019-09-08 09:27:27,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 09:27:27,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:27,653 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:27:27,654 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:27,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:27,656 INFO L82 PathProgramCache]: Analyzing trace with hash -2058083487, now seen corresponding path program 1 times [2019-09-08 09:27:27,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:27,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:27,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:27,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:27,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:27,824 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:27:27,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:27,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:27:27,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:27:27,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:27:27,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:27:27,827 INFO L87 Difference]: Start difference. First operand 598 states and 959 transitions. Second operand 5 states. [2019-09-08 09:27:28,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:28,041 INFO L93 Difference]: Finished difference Result 2010 states and 3285 transitions. [2019-09-08 09:27:28,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:27:28,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-09-08 09:27:28,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:28,050 INFO L225 Difference]: With dead ends: 2010 [2019-09-08 09:27:28,050 INFO L226 Difference]: Without dead ends: 1464 [2019-09-08 09:27:28,052 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:27:28,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2019-09-08 09:27:28,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1304. [2019-09-08 09:27:28,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1304 states. [2019-09-08 09:27:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 2119 transitions. [2019-09-08 09:27:28,139 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 2119 transitions. Word has length 60 [2019-09-08 09:27:28,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:28,139 INFO L475 AbstractCegarLoop]: Abstraction has 1304 states and 2119 transitions. [2019-09-08 09:27:28,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:27:28,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 2119 transitions. [2019-09-08 09:27:28,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 09:27:28,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:28,142 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] [2019-09-08 09:27:28,142 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:28,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:28,142 INFO L82 PathProgramCache]: Analyzing trace with hash 562310865, now seen corresponding path program 1 times [2019-09-08 09:27:28,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:28,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:28,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:28,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:28,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:28,254 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:27:28,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:28,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:27:28,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:27:28,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:27:28,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:27:28,256 INFO L87 Difference]: Start difference. First operand 1304 states and 2119 transitions. Second operand 6 states. [2019-09-08 09:27:28,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:28,619 INFO L93 Difference]: Finished difference Result 5144 states and 8398 transitions. [2019-09-08 09:27:28,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 09:27:28,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-09-08 09:27:28,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:28,640 INFO L225 Difference]: With dead ends: 5144 [2019-09-08 09:27:28,640 INFO L226 Difference]: Without dead ends: 3892 [2019-09-08 09:27:28,643 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:27:28,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3892 states. [2019-09-08 09:27:28,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3892 to 3797. [2019-09-08 09:27:28,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3797 states. [2019-09-08 09:27:28,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3797 states to 3797 states and 6184 transitions. [2019-09-08 09:27:28,893 INFO L78 Accepts]: Start accepts. Automaton has 3797 states and 6184 transitions. Word has length 61 [2019-09-08 09:27:28,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:28,894 INFO L475 AbstractCegarLoop]: Abstraction has 3797 states and 6184 transitions. [2019-09-08 09:27:28,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:27:28,894 INFO L276 IsEmpty]: Start isEmpty. Operand 3797 states and 6184 transitions. [2019-09-08 09:27:28,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 09:27:28,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:28,896 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:27:28,897 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:28,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:28,897 INFO L82 PathProgramCache]: Analyzing trace with hash 194715176, now seen corresponding path program 1 times [2019-09-08 09:27:28,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:28,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:28,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:28,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:28,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:29,015 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:27:29,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:29,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:27:29,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:27:29,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:27:29,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:27:29,019 INFO L87 Difference]: Start difference. First operand 3797 states and 6184 transitions. Second operand 4 states. [2019-09-08 09:27:29,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:29,388 INFO L93 Difference]: Finished difference Result 8873 states and 14504 transitions. [2019-09-08 09:27:29,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:27:29,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-08 09:27:29,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:29,416 INFO L225 Difference]: With dead ends: 8873 [2019-09-08 09:27:29,417 INFO L226 Difference]: Without dead ends: 5465 [2019-09-08 09:27:29,426 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:27:29,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5465 states. [2019-09-08 09:27:29,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5465 to 5438. [2019-09-08 09:27:29,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5438 states. [2019-09-08 09:27:29,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5438 states to 5438 states and 8859 transitions. [2019-09-08 09:27:29,685 INFO L78 Accepts]: Start accepts. Automaton has 5438 states and 8859 transitions. Word has length 62 [2019-09-08 09:27:29,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:29,685 INFO L475 AbstractCegarLoop]: Abstraction has 5438 states and 8859 transitions. [2019-09-08 09:27:29,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:27:29,686 INFO L276 IsEmpty]: Start isEmpty. Operand 5438 states and 8859 transitions. [2019-09-08 09:27:29,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 09:27:29,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:29,688 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] [2019-09-08 09:27:29,689 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:29,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:29,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1105297432, now seen corresponding path program 1 times [2019-09-08 09:27:29,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:29,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:29,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:29,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:29,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:29,736 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:27:29,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:29,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:27:29,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:27:29,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:27:29,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:27:29,738 INFO L87 Difference]: Start difference. First operand 5438 states and 8859 transitions. Second operand 3 states. [2019-09-08 09:27:30,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:30,152 INFO L93 Difference]: Finished difference Result 11855 states and 19394 transitions. [2019-09-08 09:27:30,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:27:30,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-08 09:27:30,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:30,202 INFO L225 Difference]: With dead ends: 11855 [2019-09-08 09:27:30,203 INFO L226 Difference]: Without dead ends: 7992 [2019-09-08 09:27:30,213 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:27:30,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7992 states. [2019-09-08 09:27:30,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7992 to 7990. [2019-09-08 09:27:30,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7990 states. [2019-09-08 09:27:30,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7990 states to 7990 states and 12984 transitions. [2019-09-08 09:27:30,654 INFO L78 Accepts]: Start accepts. Automaton has 7990 states and 12984 transitions. Word has length 63 [2019-09-08 09:27:30,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:30,654 INFO L475 AbstractCegarLoop]: Abstraction has 7990 states and 12984 transitions. [2019-09-08 09:27:30,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:27:30,655 INFO L276 IsEmpty]: Start isEmpty. Operand 7990 states and 12984 transitions. [2019-09-08 09:27:30,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 09:27:30,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:30,656 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] [2019-09-08 09:27:30,656 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:30,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:30,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1482146261, now seen corresponding path program 1 times [2019-09-08 09:27:30,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:30,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:30,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:30,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:30,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:30,704 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:27:30,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:30,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:27:30,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:27:30,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:27:30,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:27:30,706 INFO L87 Difference]: Start difference. First operand 7990 states and 12984 transitions. Second operand 3 states. [2019-09-08 09:27:31,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:31,120 INFO L93 Difference]: Finished difference Result 16170 states and 26378 transitions. [2019-09-08 09:27:31,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:27:31,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-08 09:27:31,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:31,178 INFO L225 Difference]: With dead ends: 16170 [2019-09-08 09:27:31,179 INFO L226 Difference]: Without dead ends: 10909 [2019-09-08 09:27:31,192 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:27:31,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10909 states. [2019-09-08 09:27:31,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10909 to 10907. [2019-09-08 09:27:31,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10907 states. [2019-09-08 09:27:31,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10907 states to 10907 states and 17666 transitions. [2019-09-08 09:27:31,802 INFO L78 Accepts]: Start accepts. Automaton has 10907 states and 17666 transitions. Word has length 63 [2019-09-08 09:27:31,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:31,802 INFO L475 AbstractCegarLoop]: Abstraction has 10907 states and 17666 transitions. [2019-09-08 09:27:31,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:27:31,803 INFO L276 IsEmpty]: Start isEmpty. Operand 10907 states and 17666 transitions. [2019-09-08 09:27:31,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 09:27:31,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:31,804 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] [2019-09-08 09:27:31,804 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:31,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:31,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1688708728, now seen corresponding path program 1 times [2019-09-08 09:27:31,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:31,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:31,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:31,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:31,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:31,865 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:27:31,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:31,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:27:31,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:27:31,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:27:31,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:27:31,867 INFO L87 Difference]: Start difference. First operand 10907 states and 17666 transitions. Second operand 4 states. [2019-09-08 09:27:32,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:32,893 INFO L93 Difference]: Finished difference Result 31726 states and 51595 transitions. [2019-09-08 09:27:32,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:27:32,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-08 09:27:32,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:32,940 INFO L225 Difference]: With dead ends: 31726 [2019-09-08 09:27:32,940 INFO L226 Difference]: Without dead ends: 20951 [2019-09-08 09:27:32,965 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:27:32,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20951 states. [2019-09-08 09:27:33,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20951 to 15881. [2019-09-08 09:27:33,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15881 states. [2019-09-08 09:27:33,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15881 states to 15881 states and 25711 transitions. [2019-09-08 09:27:33,721 INFO L78 Accepts]: Start accepts. Automaton has 15881 states and 25711 transitions. Word has length 63 [2019-09-08 09:27:33,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:33,722 INFO L475 AbstractCegarLoop]: Abstraction has 15881 states and 25711 transitions. [2019-09-08 09:27:33,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:27:33,722 INFO L276 IsEmpty]: Start isEmpty. Operand 15881 states and 25711 transitions. [2019-09-08 09:27:33,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 09:27:33,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:33,723 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] [2019-09-08 09:27:33,724 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:33,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:33,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1436633073, now seen corresponding path program 1 times [2019-09-08 09:27:33,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:33,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:33,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:33,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:33,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:33,773 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:27:33,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:33,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:27:33,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:27:33,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:27:33,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:27:33,775 INFO L87 Difference]: Start difference. First operand 15881 states and 25711 transitions. Second operand 3 states. [2019-09-08 09:27:34,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:34,448 INFO L93 Difference]: Finished difference Result 36355 states and 59312 transitions. [2019-09-08 09:27:34,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:27:34,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-08 09:27:34,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:34,499 INFO L225 Difference]: With dead ends: 36355 [2019-09-08 09:27:34,499 INFO L226 Difference]: Without dead ends: 23750 [2019-09-08 09:27:34,525 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:27:34,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23750 states. [2019-09-08 09:27:35,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23750 to 23748. [2019-09-08 09:27:35,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23748 states. [2019-09-08 09:27:35,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23748 states to 23748 states and 38365 transitions. [2019-09-08 09:27:35,446 INFO L78 Accepts]: Start accepts. Automaton has 23748 states and 38365 transitions. Word has length 63 [2019-09-08 09:27:35,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:35,447 INFO L475 AbstractCegarLoop]: Abstraction has 23748 states and 38365 transitions. [2019-09-08 09:27:35,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:27:35,447 INFO L276 IsEmpty]: Start isEmpty. Operand 23748 states and 38365 transitions. [2019-09-08 09:27:35,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 09:27:35,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:35,448 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] [2019-09-08 09:27:35,449 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:35,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:35,449 INFO L82 PathProgramCache]: Analyzing trace with hash -2138186360, now seen corresponding path program 1 times [2019-09-08 09:27:35,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:35,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:35,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:35,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:35,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:35,593 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:27:35,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:35,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:27:35,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:27:35,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:27:35,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:27:35,595 INFO L87 Difference]: Start difference. First operand 23748 states and 38365 transitions. Second operand 5 states. [2019-09-08 09:27:37,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:37,072 INFO L93 Difference]: Finished difference Result 49205 states and 79572 transitions. [2019-09-08 09:27:37,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:27:37,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-09-08 09:27:37,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:37,139 INFO L225 Difference]: With dead ends: 49205 [2019-09-08 09:27:37,139 INFO L226 Difference]: Without dead ends: 25536 [2019-09-08 09:27:37,177 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:27:37,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25536 states. [2019-09-08 09:27:38,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25536 to 23748. [2019-09-08 09:27:38,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23748 states. [2019-09-08 09:27:38,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23748 states to 23748 states and 38230 transitions. [2019-09-08 09:27:38,058 INFO L78 Accepts]: Start accepts. Automaton has 23748 states and 38230 transitions. Word has length 65 [2019-09-08 09:27:38,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:38,058 INFO L475 AbstractCegarLoop]: Abstraction has 23748 states and 38230 transitions. [2019-09-08 09:27:38,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:27:38,058 INFO L276 IsEmpty]: Start isEmpty. Operand 23748 states and 38230 transitions. [2019-09-08 09:27:38,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 09:27:38,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:38,060 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:27:38,060 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:38,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:38,060 INFO L82 PathProgramCache]: Analyzing trace with hash -2099405191, now seen corresponding path program 1 times [2019-09-08 09:27:38,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:38,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:38,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:38,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:38,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:38,183 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:27:38,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:38,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:27:38,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:27:38,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:27:38,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:27:38,185 INFO L87 Difference]: Start difference. First operand 23748 states and 38230 transitions. Second operand 5 states. [2019-09-08 09:27:39,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:39,583 INFO L93 Difference]: Finished difference Result 66916 states and 107918 transitions. [2019-09-08 09:27:39,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:27:39,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-08 09:27:39,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:39,653 INFO L225 Difference]: With dead ends: 66916 [2019-09-08 09:27:39,653 INFO L226 Difference]: Without dead ends: 43247 [2019-09-08 09:27:39,688 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:27:39,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43247 states. [2019-09-08 09:27:41,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43247 to 43245. [2019-09-08 09:27:41,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43245 states. [2019-09-08 09:27:41,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43245 states to 43245 states and 69231 transitions. [2019-09-08 09:27:41,931 INFO L78 Accepts]: Start accepts. Automaton has 43245 states and 69231 transitions. Word has length 68 [2019-09-08 09:27:41,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:41,931 INFO L475 AbstractCegarLoop]: Abstraction has 43245 states and 69231 transitions. [2019-09-08 09:27:41,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:27:41,931 INFO L276 IsEmpty]: Start isEmpty. Operand 43245 states and 69231 transitions. [2019-09-08 09:27:41,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 09:27:41,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:41,932 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:27:41,933 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:41,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:41,933 INFO L82 PathProgramCache]: Analyzing trace with hash -658960795, now seen corresponding path program 1 times [2019-09-08 09:27:41,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:41,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:41,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:41,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:41,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:42,025 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:27:42,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:42,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:27:42,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:27:42,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:27:42,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:27:42,027 INFO L87 Difference]: Start difference. First operand 43245 states and 69231 transitions. Second operand 5 states. [2019-09-08 09:27:44,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:44,214 INFO L93 Difference]: Finished difference Result 76093 states and 121094 transitions. [2019-09-08 09:27:44,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:27:44,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-09-08 09:27:44,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:44,313 INFO L225 Difference]: With dead ends: 76093 [2019-09-08 09:27:44,313 INFO L226 Difference]: Without dead ends: 76091 [2019-09-08 09:27:44,330 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:27:44,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76091 states. [2019-09-08 09:27:47,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76091 to 44321. [2019-09-08 09:27:47,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44321 states. [2019-09-08 09:27:47,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44321 states to 44321 states and 70298 transitions. [2019-09-08 09:27:47,429 INFO L78 Accepts]: Start accepts. Automaton has 44321 states and 70298 transitions. Word has length 69 [2019-09-08 09:27:47,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:47,429 INFO L475 AbstractCegarLoop]: Abstraction has 44321 states and 70298 transitions. [2019-09-08 09:27:47,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:27:47,430 INFO L276 IsEmpty]: Start isEmpty. Operand 44321 states and 70298 transitions. [2019-09-08 09:27:47,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 09:27:47,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:47,432 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] [2019-09-08 09:27:47,433 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:47,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:47,433 INFO L82 PathProgramCache]: Analyzing trace with hash 921927418, now seen corresponding path program 1 times [2019-09-08 09:27:47,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:47,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:47,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:47,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:47,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:47,507 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:27:47,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:47,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:27:47,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:27:47,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:27:47,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:27:47,508 INFO L87 Difference]: Start difference. First operand 44321 states and 70298 transitions. Second operand 3 states. [2019-09-08 09:27:48,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:48,752 INFO L93 Difference]: Finished difference Result 82621 states and 131514 transitions. [2019-09-08 09:27:48,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:27:48,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-09-08 09:27:48,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:48,800 INFO L225 Difference]: With dead ends: 82621 [2019-09-08 09:27:48,801 INFO L226 Difference]: Without dead ends: 38379 [2019-09-08 09:27:48,851 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:27:48,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38379 states. [2019-09-08 09:27:50,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38379 to 38377. [2019-09-08 09:27:50,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38377 states. [2019-09-08 09:27:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38377 states to 38377 states and 60917 transitions. [2019-09-08 09:27:50,340 INFO L78 Accepts]: Start accepts. Automaton has 38377 states and 60917 transitions. Word has length 91 [2019-09-08 09:27:50,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:50,340 INFO L475 AbstractCegarLoop]: Abstraction has 38377 states and 60917 transitions. [2019-09-08 09:27:50,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:27:50,341 INFO L276 IsEmpty]: Start isEmpty. Operand 38377 states and 60917 transitions. [2019-09-08 09:27:50,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 09:27:50,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:50,342 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] [2019-09-08 09:27:50,343 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:50,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:50,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1253263059, now seen corresponding path program 1 times [2019-09-08 09:27:50,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:50,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:50,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:50,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:50,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:50,413 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:27:50,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:50,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:27:50,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:27:50,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:27:50,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:27:50,415 INFO L87 Difference]: Start difference. First operand 38377 states and 60917 transitions. Second operand 3 states. [2019-09-08 09:27:51,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:51,603 INFO L93 Difference]: Finished difference Result 53973 states and 85815 transitions. [2019-09-08 09:27:51,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:27:51,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-09-08 09:27:51,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:51,618 INFO L225 Difference]: With dead ends: 53973 [2019-09-08 09:27:51,618 INFO L226 Difference]: Without dead ends: 15702 [2019-09-08 09:27:51,637 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:27:51,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15702 states. [2019-09-08 09:27:52,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15702 to 15700. [2019-09-08 09:27:52,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15700 states. [2019-09-08 09:27:52,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15700 states to 15700 states and 24869 transitions. [2019-09-08 09:27:52,139 INFO L78 Accepts]: Start accepts. Automaton has 15700 states and 24869 transitions. Word has length 91 [2019-09-08 09:27:52,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:52,140 INFO L475 AbstractCegarLoop]: Abstraction has 15700 states and 24869 transitions. [2019-09-08 09:27:52,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:27:52,140 INFO L276 IsEmpty]: Start isEmpty. Operand 15700 states and 24869 transitions. [2019-09-08 09:27:52,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 09:27:52,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:52,141 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] [2019-09-08 09:27:52,141 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:52,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:52,141 INFO L82 PathProgramCache]: Analyzing trace with hash 2025166105, now seen corresponding path program 1 times [2019-09-08 09:27:52,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:52,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:52,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:52,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:52,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:52,224 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:27:52,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 09:27:52,226 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) [2019-09-08 09:27:52,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 09:27:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:52,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 09:27:52,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 09:27:52,523 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-08 09:27:52,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 09:27:52,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 09:27:52,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 09:27:52,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 09:27:52,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:27:52,538 INFO L87 Difference]: Start difference. First operand 15700 states and 24869 transitions. Second operand 8 states. [2019-09-08 09:27:54,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:54,164 INFO L93 Difference]: Finished difference Result 35599 states and 56657 transitions. [2019-09-08 09:27:54,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 09:27:54,165 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2019-09-08 09:27:54,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:54,314 INFO L225 Difference]: With dead ends: 35599 [2019-09-08 09:27:54,314 INFO L226 Difference]: Without dead ends: 26567 [2019-09-08 09:27:54,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 92 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:27:54,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26567 states. [2019-09-08 09:27:55,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26567 to 22034. [2019-09-08 09:27:55,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22034 states. [2019-09-08 09:27:55,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22034 states to 22034 states and 34799 transitions. [2019-09-08 09:27:55,706 INFO L78 Accepts]: Start accepts. Automaton has 22034 states and 34799 transitions. Word has length 93 [2019-09-08 09:27:55,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:55,706 INFO L475 AbstractCegarLoop]: Abstraction has 22034 states and 34799 transitions. [2019-09-08 09:27:55,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 09:27:55,706 INFO L276 IsEmpty]: Start isEmpty. Operand 22034 states and 34799 transitions. [2019-09-08 09:27:55,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 09:27:55,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:55,709 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] [2019-09-08 09:27:55,709 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:55,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:55,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1450195081, now seen corresponding path program 1 times [2019-09-08 09:27:55,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:55,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:55,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:55,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:55,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:55,809 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:27:55,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:55,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:27:55,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:27:55,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:27:55,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:27:55,811 INFO L87 Difference]: Start difference. First operand 22034 states and 34799 transitions. Second operand 5 states. [2019-09-08 09:27:56,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:56,963 INFO L93 Difference]: Finished difference Result 43134 states and 68293 transitions. [2019-09-08 09:27:56,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:27:56,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-08 09:27:56,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:57,009 INFO L225 Difference]: With dead ends: 43134 [2019-09-08 09:27:57,010 INFO L226 Difference]: Without dead ends: 27768 [2019-09-08 09:27:57,034 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:27:57,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27768 states. [2019-09-08 09:27:58,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27768 to 27554. [2019-09-08 09:27:58,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27554 states. [2019-09-08 09:27:58,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27554 states to 27554 states and 43491 transitions. [2019-09-08 09:27:58,253 INFO L78 Accepts]: Start accepts. Automaton has 27554 states and 43491 transitions. Word has length 93 [2019-09-08 09:27:58,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:58,254 INFO L475 AbstractCegarLoop]: Abstraction has 27554 states and 43491 transitions. [2019-09-08 09:27:58,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:27:58,254 INFO L276 IsEmpty]: Start isEmpty. Operand 27554 states and 43491 transitions. [2019-09-08 09:27:58,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 09:27:58,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:58,256 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] [2019-09-08 09:27:58,256 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:58,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:58,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1798175298, now seen corresponding path program 1 times [2019-09-08 09:27:58,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:58,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:58,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:58,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:58,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:58,312 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:27:58,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:58,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:27:58,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:27:58,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:27:58,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:27:58,314 INFO L87 Difference]: Start difference. First operand 27554 states and 43491 transitions. Second operand 3 states. [2019-09-08 09:28:00,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:28:00,192 INFO L93 Difference]: Finished difference Result 75450 states and 119245 transitions. [2019-09-08 09:28:00,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:28:00,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-08 09:28:00,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:28:00,244 INFO L225 Difference]: With dead ends: 75450 [2019-09-08 09:28:00,244 INFO L226 Difference]: Without dead ends: 49768 [2019-09-08 09:28:00,265 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:28:00,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49768 states. [2019-09-08 09:28:02,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49768 to 49651. [2019-09-08 09:28:02,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49651 states. [2019-09-08 09:28:02,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49651 states to 49651 states and 78319 transitions. [2019-09-08 09:28:02,101 INFO L78 Accepts]: Start accepts. Automaton has 49651 states and 78319 transitions. Word has length 94 [2019-09-08 09:28:02,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:28:02,102 INFO L475 AbstractCegarLoop]: Abstraction has 49651 states and 78319 transitions. [2019-09-08 09:28:02,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:28:02,102 INFO L276 IsEmpty]: Start isEmpty. Operand 49651 states and 78319 transitions. [2019-09-08 09:28:02,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 09:28:02,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:28:02,105 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] [2019-09-08 09:28:02,105 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:28:02,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:28:02,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1673572506, now seen corresponding path program 1 times [2019-09-08 09:28:02,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:28:02,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:28:02,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:02,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:28:02,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:02,165 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:28:02,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:28:02,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:28:02,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:28:02,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:28:02,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:28:02,167 INFO L87 Difference]: Start difference. First operand 49651 states and 78319 transitions. Second operand 3 states. [2019-09-08 09:28:03,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:28:03,215 INFO L93 Difference]: Finished difference Result 71106 states and 112327 transitions. [2019-09-08 09:28:03,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:28:03,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-08 09:28:03,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:28:03,239 INFO L225 Difference]: With dead ends: 71106 [2019-09-08 09:28:03,240 INFO L226 Difference]: Without dead ends: 21584 [2019-09-08 09:28:03,276 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:28:03,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21584 states. [2019-09-08 09:28:04,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21584 to 21582. [2019-09-08 09:28:04,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21582 states. [2019-09-08 09:28:04,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21582 states to 21582 states and 33939 transitions. [2019-09-08 09:28:04,073 INFO L78 Accepts]: Start accepts. Automaton has 21582 states and 33939 transitions. Word has length 94 [2019-09-08 09:28:04,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:28:04,073 INFO L475 AbstractCegarLoop]: Abstraction has 21582 states and 33939 transitions. [2019-09-08 09:28:04,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:28:04,074 INFO L276 IsEmpty]: Start isEmpty. Operand 21582 states and 33939 transitions. [2019-09-08 09:28:04,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 09:28:04,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:28:04,075 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] [2019-09-08 09:28:04,076 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:28:04,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:28:04,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1834623754, now seen corresponding path program 1 times [2019-09-08 09:28:04,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:28:04,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:28:04,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:04,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:28:04,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:04,171 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:28:04,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 09:28:04,172 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 09:28:04,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:28:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:04,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 09:28:04,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 09:28:04,357 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 09:28:04,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 09:28:04,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 09:28:04,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 09:28:04,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 09:28:04,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:28:04,370 INFO L87 Difference]: Start difference. First operand 21582 states and 33939 transitions. Second operand 8 states. [2019-09-08 09:28:05,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:28:05,989 INFO L93 Difference]: Finished difference Result 40508 states and 63999 transitions. [2019-09-08 09:28:05,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 09:28:05,989 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-09-08 09:28:05,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:28:06,020 INFO L225 Difference]: With dead ends: 40508 [2019-09-08 09:28:06,020 INFO L226 Difference]: Without dead ends: 31069 [2019-09-08 09:28:06,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-09-08 09:28:06,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31069 states. [2019-09-08 09:28:06,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31069 to 25799. [2019-09-08 09:28:06,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25799 states. [2019-09-08 09:28:07,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25799 states to 25799 states and 40618 transitions. [2019-09-08 09:28:07,037 INFO L78 Accepts]: Start accepts. Automaton has 25799 states and 40618 transitions. Word has length 95 [2019-09-08 09:28:07,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:28:07,037 INFO L475 AbstractCegarLoop]: Abstraction has 25799 states and 40618 transitions. [2019-09-08 09:28:07,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 09:28:07,037 INFO L276 IsEmpty]: Start isEmpty. Operand 25799 states and 40618 transitions. [2019-09-08 09:28:07,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 09:28:07,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:28:07,039 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] [2019-09-08 09:28:07,039 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:28:07,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:28:07,039 INFO L82 PathProgramCache]: Analyzing trace with hash 542691699, now seen corresponding path program 1 times [2019-09-08 09:28:07,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:28:07,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:28:07,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:07,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:28:07,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:07,155 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:28:07,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:28:07,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:28:07,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:28:07,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:28:07,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:28:07,156 INFO L87 Difference]: Start difference. First operand 25799 states and 40618 transitions. Second operand 4 states. [2019-09-08 09:28:09,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:28:09,204 INFO L93 Difference]: Finished difference Result 76033 states and 119671 transitions. [2019-09-08 09:28:09,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:28:09,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-09-08 09:28:09,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:28:09,265 INFO L225 Difference]: With dead ends: 76033 [2019-09-08 09:28:09,265 INFO L226 Difference]: Without dead ends: 50247 [2019-09-08 09:28:09,292 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:28:09,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50247 states. [2019-09-08 09:28:11,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50247 to 50245. [2019-09-08 09:28:11,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50245 states. [2019-09-08 09:28:11,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50245 states to 50245 states and 78526 transitions. [2019-09-08 09:28:11,691 INFO L78 Accepts]: Start accepts. Automaton has 50245 states and 78526 transitions. Word has length 96 [2019-09-08 09:28:11,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:28:11,692 INFO L475 AbstractCegarLoop]: Abstraction has 50245 states and 78526 transitions. [2019-09-08 09:28:11,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:28:11,692 INFO L276 IsEmpty]: Start isEmpty. Operand 50245 states and 78526 transitions. [2019-09-08 09:28:11,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 09:28:11,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:28:11,694 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] [2019-09-08 09:28:11,695 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:28:11,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:28:11,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1261540347, now seen corresponding path program 1 times [2019-09-08 09:28:11,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:28:11,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:28:11,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:11,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:28:11,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:11,728 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:28:11,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:28:11,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:28:11,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:28:11,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:28:11,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:28:11,729 INFO L87 Difference]: Start difference. First operand 50245 states and 78526 transitions. Second operand 3 states. [2019-09-08 09:28:17,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:28:17,139 INFO L93 Difference]: Finished difference Result 150689 states and 235508 transitions. [2019-09-08 09:28:17,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:28:17,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-08 09:28:17,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:28:17,258 INFO L225 Difference]: With dead ends: 150689 [2019-09-08 09:28:17,258 INFO L226 Difference]: Without dead ends: 100476 [2019-09-08 09:28:17,298 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:28:17,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100476 states. [2019-09-08 09:28:20,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100476 to 50247. [2019-09-08 09:28:20,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50247 states. [2019-09-08 09:28:20,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50247 states to 50247 states and 78528 transitions. [2019-09-08 09:28:20,109 INFO L78 Accepts]: Start accepts. Automaton has 50247 states and 78528 transitions. Word has length 97 [2019-09-08 09:28:20,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:28:20,109 INFO L475 AbstractCegarLoop]: Abstraction has 50247 states and 78528 transitions. [2019-09-08 09:28:20,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:28:20,109 INFO L276 IsEmpty]: Start isEmpty. Operand 50247 states and 78528 transitions. [2019-09-08 09:28:20,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 09:28:20,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:28:20,111 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] [2019-09-08 09:28:20,111 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:28:20,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:28:20,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1833528204, now seen corresponding path program 1 times [2019-09-08 09:28:20,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:28:20,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:28:20,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:20,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:28:20,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:20,237 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:28:20,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:28:20,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:28:20,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:28:20,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:28:20,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:28:20,241 INFO L87 Difference]: Start difference. First operand 50247 states and 78528 transitions. Second operand 4 states. [2019-09-08 09:28:25,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:28:25,565 INFO L93 Difference]: Finished difference Result 148015 states and 231224 transitions. [2019-09-08 09:28:25,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:28:25,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-08 09:28:25,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:28:25,677 INFO L225 Difference]: With dead ends: 148015 [2019-09-08 09:28:25,677 INFO L226 Difference]: Without dead ends: 97802 [2019-09-08 09:28:25,717 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:28:25,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97802 states. [2019-09-08 09:28:33,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97802 to 97800. [2019-09-08 09:28:33,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97800 states. [2019-09-08 09:28:33,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97800 states to 97800 states and 151680 transitions. [2019-09-08 09:28:33,714 INFO L78 Accepts]: Start accepts. Automaton has 97800 states and 151680 transitions. Word has length 98 [2019-09-08 09:28:33,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:28:33,715 INFO L475 AbstractCegarLoop]: Abstraction has 97800 states and 151680 transitions. [2019-09-08 09:28:33,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:28:33,715 INFO L276 IsEmpty]: Start isEmpty. Operand 97800 states and 151680 transitions. [2019-09-08 09:28:33,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 09:28:33,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:28:33,718 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] [2019-09-08 09:28:33,718 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:28:33,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:28:33,718 INFO L82 PathProgramCache]: Analyzing trace with hash -917326106, now seen corresponding path program 1 times [2019-09-08 09:28:33,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:28:33,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:28:33,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:33,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:28:33,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:33,750 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:28:33,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:28:33,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:28:33,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:28:33,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:28:33,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:28:33,751 INFO L87 Difference]: Start difference. First operand 97800 states and 151680 transitions. Second operand 3 states. [2019-09-08 09:28:45,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:28:45,514 INFO L93 Difference]: Finished difference Result 293316 states and 454912 transitions. [2019-09-08 09:28:45,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:28:45,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 09:28:45,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:28:45,768 INFO L225 Difference]: With dead ends: 293316 [2019-09-08 09:28:45,768 INFO L226 Difference]: Without dead ends: 195564 [2019-09-08 09:28:45,847 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:28:45,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195564 states. [2019-09-08 09:28:52,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195564 to 97804. [2019-09-08 09:28:52,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97804 states. [2019-09-08 09:28:52,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97804 states to 97804 states and 151684 transitions. [2019-09-08 09:28:52,993 INFO L78 Accepts]: Start accepts. Automaton has 97804 states and 151684 transitions. Word has length 99 [2019-09-08 09:28:52,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:28:52,993 INFO L475 AbstractCegarLoop]: Abstraction has 97804 states and 151684 transitions. [2019-09-08 09:28:52,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:28:52,993 INFO L276 IsEmpty]: Start isEmpty. Operand 97804 states and 151684 transitions. [2019-09-08 09:28:52,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 09:28:52,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:28:52,997 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] [2019-09-08 09:28:52,997 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:28:52,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:28:52,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1826850017, now seen corresponding path program 1 times [2019-09-08 09:28:52,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:28:52,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:28:52,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:52,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:28:52,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:53,060 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:28:53,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:28:53,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:28:53,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:28:53,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:28:53,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:28:53,061 INFO L87 Difference]: Start difference. First operand 97804 states and 151684 transitions. Second operand 3 states. [2019-09-08 09:29:04,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:29:04,720 INFO L93 Difference]: Finished difference Result 259009 states and 401303 transitions. [2019-09-08 09:29:04,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:29:04,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-08 09:29:04,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:29:04,918 INFO L225 Difference]: With dead ends: 259009 [2019-09-08 09:29:04,918 INFO L226 Difference]: Without dead ends: 161489 [2019-09-08 09:29:04,984 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:29:05,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161489 states. [2019-09-08 09:29:18,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161489 to 161487. [2019-09-08 09:29:18,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161487 states. [2019-09-08 09:29:19,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161487 states to 161487 states and 247861 transitions. [2019-09-08 09:29:19,104 INFO L78 Accepts]: Start accepts. Automaton has 161487 states and 247861 transitions. Word has length 100 [2019-09-08 09:29:19,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:29:19,105 INFO L475 AbstractCegarLoop]: Abstraction has 161487 states and 247861 transitions. [2019-09-08 09:29:19,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:29:19,105 INFO L276 IsEmpty]: Start isEmpty. Operand 161487 states and 247861 transitions. [2019-09-08 09:29:19,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 09:29:19,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:29:19,109 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] [2019-09-08 09:29:19,109 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:29:19,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:29:19,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1677738748, now seen corresponding path program 1 times [2019-09-08 09:29:19,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:29:19,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:29:19,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:19,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:29:19,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:29:19,192 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:29:19,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:29:19,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:29:19,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:29:19,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:29:19,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:29:19,194 INFO L87 Difference]: Start difference. First operand 161487 states and 247861 transitions. Second operand 4 states. [2019-09-08 09:29:30,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:29:30,667 INFO L93 Difference]: Finished difference Result 323300 states and 496092 transitions. [2019-09-08 09:29:30,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:29:30,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-08 09:29:30,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:29:30,883 INFO L225 Difference]: With dead ends: 323300 [2019-09-08 09:29:30,884 INFO L226 Difference]: Without dead ends: 161697 [2019-09-08 09:29:30,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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:29:31,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161697 states. [2019-09-08 09:29:45,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161697 to 161695. [2019-09-08 09:29:45,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161695 states. [2019-09-08 09:29:46,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161695 states to 161695 states and 246669 transitions. [2019-09-08 09:29:46,114 INFO L78 Accepts]: Start accepts. Automaton has 161695 states and 246669 transitions. Word has length 100 [2019-09-08 09:29:46,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:29:46,114 INFO L475 AbstractCegarLoop]: Abstraction has 161695 states and 246669 transitions. [2019-09-08 09:29:46,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:29:46,114 INFO L276 IsEmpty]: Start isEmpty. Operand 161695 states and 246669 transitions. [2019-09-08 09:29:46,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 09:29:46,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:29:46,118 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] [2019-09-08 09:29:46,119 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:29:46,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:29:46,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1762067467, now seen corresponding path program 1 times [2019-09-08 09:29:46,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:29:46,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:29:46,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:46,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:29:46,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:29:46,208 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:29:46,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:29:46,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:29:46,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:29:46,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:29:46,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:29:46,209 INFO L87 Difference]: Start difference. First operand 161695 states and 246669 transitions. Second operand 4 states. [2019-09-08 09:30:00,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:00,031 INFO L93 Difference]: Finished difference Result 225342 states and 343478 transitions. [2019-09-08 09:30:00,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:30:00,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-08 09:30:00,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:00,227 INFO L225 Difference]: With dead ends: 225342 [2019-09-08 09:30:00,227 INFO L226 Difference]: Without dead ends: 161697 [2019-09-08 09:30:00,282 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:30:00,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161697 states. [2019-09-08 09:30:12,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161697 to 161487. [2019-09-08 09:30:12,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161487 states. [2019-09-08 09:30:12,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161487 states to 161487 states and 246411 transitions. [2019-09-08 09:30:12,848 INFO L78 Accepts]: Start accepts. Automaton has 161487 states and 246411 transitions. Word has length 100 [2019-09-08 09:30:12,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:12,848 INFO L475 AbstractCegarLoop]: Abstraction has 161487 states and 246411 transitions. [2019-09-08 09:30:12,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:30:12,848 INFO L276 IsEmpty]: Start isEmpty. Operand 161487 states and 246411 transitions. [2019-09-08 09:30:12,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 09:30:12,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:12,853 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:30:12,853 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:12,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:12,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1839724576, now seen corresponding path program 1 times [2019-09-08 09:30:12,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:12,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:12,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:12,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:12,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:12,888 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:30:12,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:12,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:30:12,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:30:12,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:30:12,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:30:12,890 INFO L87 Difference]: Start difference. First operand 161487 states and 246411 transitions. Second operand 3 states. [2019-09-08 09:30:37,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:37,562 INFO L93 Difference]: Finished difference Result 386511 states and 589475 transitions. [2019-09-08 09:30:37,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:30:37,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-08 09:30:37,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:38,059 INFO L225 Difference]: With dead ends: 386511 [2019-09-08 09:30:38,059 INFO L226 Difference]: Without dead ends: 322866 [2019-09-08 09:30:38,171 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:30:38,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322866 states. [2019-09-08 09:30:56,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322866 to 161495. [2019-09-08 09:30:56,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161495 states. [2019-09-08 09:30:56,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161495 states to 161495 states and 246419 transitions. [2019-09-08 09:30:56,704 INFO L78 Accepts]: Start accepts. Automaton has 161495 states and 246419 transitions. Word has length 101 [2019-09-08 09:30:56,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:56,704 INFO L475 AbstractCegarLoop]: Abstraction has 161495 states and 246419 transitions. [2019-09-08 09:30:56,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:30:56,705 INFO L276 IsEmpty]: Start isEmpty. Operand 161495 states and 246419 transitions. [2019-09-08 09:30:56,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 09:30:56,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:56,709 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:30:56,709 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:56,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:56,710 INFO L82 PathProgramCache]: Analyzing trace with hash -561977027, now seen corresponding path program 1 times [2019-09-08 09:30:56,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:56,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:56,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:56,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:56,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:56,808 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:30:56,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:56,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:30:56,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:30:56,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:30:56,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:30:56,810 INFO L87 Difference]: Start difference. First operand 161495 states and 246419 transitions. Second operand 4 states. [2019-09-08 09:31:24,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:31:24,835 INFO L93 Difference]: Finished difference Result 475397 states and 724714 transitions. [2019-09-08 09:31:24,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:31:24,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-08 09:31:24,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:31:25,261 INFO L225 Difference]: With dead ends: 475397 [2019-09-08 09:31:25,261 INFO L226 Difference]: Without dead ends: 313949 [2019-09-08 09:31:25,376 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:31:25,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313949 states. [2019-09-08 09:31:57,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313949 to 313947. [2019-09-08 09:31:57,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313947 states. [2019-09-08 09:31:57,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313947 states to 313947 states and 474744 transitions. [2019-09-08 09:31:57,600 INFO L78 Accepts]: Start accepts. Automaton has 313947 states and 474744 transitions. Word has length 102 [2019-09-08 09:31:57,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:31:57,600 INFO L475 AbstractCegarLoop]: Abstraction has 313947 states and 474744 transitions. [2019-09-08 09:31:57,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:31:57,600 INFO L276 IsEmpty]: Start isEmpty. Operand 313947 states and 474744 transitions. [2019-09-08 09:31:57,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 09:31:57,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:31:57,609 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:31:57,609 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:31:57,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:31:57,609 INFO L82 PathProgramCache]: Analyzing trace with hash 909068278, now seen corresponding path program 1 times [2019-09-08 09:31:57,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:31:57,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:31:57,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:57,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:31:57,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:31:57,711 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 09:31:57,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:31:57,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:31:57,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:31:57,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:31:57,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:31:57,713 INFO L87 Difference]: Start difference. First operand 313947 states and 474744 transitions. Second operand 4 states. [2019-09-08 09:32:32,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:32,152 INFO L93 Difference]: Finished difference Result 660151 states and 996650 transitions. [2019-09-08 09:32:32,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:32:32,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-08 09:32:32,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:32,691 INFO L225 Difference]: With dead ends: 660151 [2019-09-08 09:32:32,691 INFO L226 Difference]: Without dead ends: 348245 [2019-09-08 09:32:32,902 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:32:33,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348245 states. [2019-09-08 09:33:10,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348245 to 347387. [2019-09-08 09:33:10,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347387 states. [2019-09-08 09:33:10,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347387 states to 347387 states and 522264 transitions. [2019-09-08 09:33:10,788 INFO L78 Accepts]: Start accepts. Automaton has 347387 states and 522264 transitions. Word has length 102 [2019-09-08 09:33:10,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:33:10,788 INFO L475 AbstractCegarLoop]: Abstraction has 347387 states and 522264 transitions. [2019-09-08 09:33:10,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:33:10,788 INFO L276 IsEmpty]: Start isEmpty. Operand 347387 states and 522264 transitions. [2019-09-08 09:33:10,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 09:33:10,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:33:10,793 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:33:10,793 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:33:10,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:33:10,793 INFO L82 PathProgramCache]: Analyzing trace with hash 276868742, now seen corresponding path program 1 times [2019-09-08 09:33:10,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:33:10,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:33:10,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:33:10,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:33:10,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:33:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:33:10,881 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 09:33:10,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:33:10,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:33:10,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:33:10,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:33:10,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:33:10,883 INFO L87 Difference]: Start difference. First operand 347387 states and 522264 transitions. Second operand 4 states. [2019-09-08 09:33:44,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:33:44,095 INFO L93 Difference]: Finished difference Result 667527 states and 1006098 transitions. [2019-09-08 09:33:44,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:33:44,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-08 09:33:44,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:33:44,593 INFO L225 Difference]: With dead ends: 667527 [2019-09-08 09:33:44,593 INFO L226 Difference]: Without dead ends: 322769 [2019-09-08 09:33:44,810 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:33:45,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322769 states. [2019-09-08 09:34:20,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322769 to 322767. [2019-09-08 09:34:20,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322767 states. [2019-09-08 09:34:21,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322767 states to 322767 states and 486116 transitions. [2019-09-08 09:34:21,787 INFO L78 Accepts]: Start accepts. Automaton has 322767 states and 486116 transitions. Word has length 102 [2019-09-08 09:34:21,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:34:21,788 INFO L475 AbstractCegarLoop]: Abstraction has 322767 states and 486116 transitions. [2019-09-08 09:34:21,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:34:21,788 INFO L276 IsEmpty]: Start isEmpty. Operand 322767 states and 486116 transitions. [2019-09-08 09:34:21,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 09:34:21,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:34:21,791 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:34:21,791 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:34:21,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:34:21,792 INFO L82 PathProgramCache]: Analyzing trace with hash -767758119, now seen corresponding path program 1 times [2019-09-08 09:34:21,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:34:21,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:34:21,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:34:21,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:34:21,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:34:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:34:21,842 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 09:34:21,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:34:21,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:34:21,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:34:21,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:34:21,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:34:21,844 INFO L87 Difference]: Start difference. First operand 322767 states and 486116 transitions. Second operand 3 states. [2019-09-08 09:35:14,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:35:14,344 INFO L93 Difference]: Finished difference Result 799777 states and 1209144 transitions. [2019-09-08 09:35:20,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:35:20,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-08 09:35:20,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:35:21,766 INFO L225 Difference]: With dead ends: 799777 [2019-09-08 09:35:21,767 INFO L226 Difference]: Without dead ends: 572271 [2019-09-08 09:35:21,973 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:35:22,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572271 states. [2019-09-08 09:36:19,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572271 to 570377. [2019-09-08 09:36:19,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570377 states. [2019-09-08 09:36:20,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570377 states to 570377 states and 859526 transitions. [2019-09-08 09:36:20,579 INFO L78 Accepts]: Start accepts. Automaton has 570377 states and 859526 transitions. Word has length 104 [2019-09-08 09:36:20,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:36:20,580 INFO L475 AbstractCegarLoop]: Abstraction has 570377 states and 859526 transitions. [2019-09-08 09:36:20,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:36:20,580 INFO L276 IsEmpty]: Start isEmpty. Operand 570377 states and 859526 transitions. [2019-09-08 09:36:20,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 09:36:20,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:36:20,584 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:36:20,584 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:36:20,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:36:20,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1478879878, now seen corresponding path program 1 times [2019-09-08 09:36:20,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:36:20,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:36:20,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:36:20,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:36:20,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:36:20,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:36:20,660 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:36:20,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 09:36:20,660 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 09:36:20,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:36:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:36:20,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 09:36:20,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 09:36:20,866 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 09:36:20,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 09:36:20,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 09:36:20,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 09:36:20,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 09:36:20,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:36:20,884 INFO L87 Difference]: Start difference. First operand 570377 states and 859526 transitions. Second operand 8 states.