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_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:59:24,513 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:59:24,515 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:59:24,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:59:24,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:59:24,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:59:24,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:59:24,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:59:24,533 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:59:24,534 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:59:24,535 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:59:24,536 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:59:24,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:59:24,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:59:24,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:59:24,540 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:59:24,540 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:59:24,541 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:59:24,543 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:59:24,545 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:59:24,546 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:59:24,547 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:59:24,548 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:59:24,549 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:59:24,551 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:59:24,552 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:59:24,552 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:59:24,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:59:24,553 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:59:24,554 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:59:24,554 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:59:24,555 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:59:24,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:59:24,556 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:59:24,557 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:59:24,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:59:24,558 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:59:24,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:59:24,559 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:59:24,560 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:59:24,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:59:24,561 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 12:59:24,576 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:59:24,576 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:59:24,577 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:59:24,578 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:59:24,578 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:59:24,578 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:59:24,578 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:59:24,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:59:24,579 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:59:24,579 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:59:24,579 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:59:24,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:59:24,579 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:59:24,580 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:59:24,580 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:59:24,580 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:59:24,580 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:59:24,580 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:59:24,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:59:24,581 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:59:24,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:59:24,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:59:24,581 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:59:24,582 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:59:24,582 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:59:24,582 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:59:24,582 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:59:24,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:59:24,583 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:59:24,611 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:59:24,623 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:59:24,627 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:59:24,628 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:59:24,628 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:59:24,629 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 12:59:24,688 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d664c6600/fbdc5758866f44b3b6dc9386b52c4a84/FLAGad7d6f149 [2019-09-08 12:59:25,195 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:59:25,196 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 12:59:25,215 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d664c6600/fbdc5758866f44b3b6dc9386b52c4a84/FLAGad7d6f149 [2019-09-08 12:59:25,471 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d664c6600/fbdc5758866f44b3b6dc9386b52c4a84 [2019-09-08 12:59:25,482 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:59:25,483 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:59:25,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:59:25,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:59:25,488 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:59:25,490 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:59:25" (1/1) ... [2019-09-08 12:59:25,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f4a9bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:59:25, skipping insertion in model container [2019-09-08 12:59:25,493 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:59:25" (1/1) ... [2019-09-08 12:59:25,500 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:59:25,561 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:59:25,949 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:59:25,969 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:59:26,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:59:26,091 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:59:26,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:59:26 WrapperNode [2019-09-08 12:59:26,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:59:26,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:59:26,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:59:26,093 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:59:26,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:59:26" (1/1) ... [2019-09-08 12:59:26,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:59:26" (1/1) ... [2019-09-08 12:59:26,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:59:26" (1/1) ... [2019-09-08 12:59:26,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:59:26" (1/1) ... [2019-09-08 12:59:26,137 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:59:26" (1/1) ... [2019-09-08 12:59:26,149 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:59:26" (1/1) ... [2019-09-08 12:59:26,153 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:59:26" (1/1) ... [2019-09-08 12:59:26,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:59:26,159 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:59:26,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:59:26,160 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:59:26,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:59:26" (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 12:59:26,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:59:26,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:59:26,216 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:59:26,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:59:26,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:59:26,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:59:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:59:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:59:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:59:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:59:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:59:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:59:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:59:26,220 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:59:26,221 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:59:26,221 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:59:26,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:59:26,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:59:27,047 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:59:27,047 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:59:27,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:59:27 BoogieIcfgContainer [2019-09-08 12:59:27,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:59:27,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:59:27,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:59:27,054 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:59:27,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:59:25" (1/3) ... [2019-09-08 12:59:27,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af49b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:59:27, skipping insertion in model container [2019-09-08 12:59:27,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:59:26" (2/3) ... [2019-09-08 12:59:27,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af49b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:59:27, skipping insertion in model container [2019-09-08 12:59:27,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:59:27" (3/3) ... [2019-09-08 12:59:27,058 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 12:59:27,068 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:59:27,077 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:59:27,095 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:59:27,130 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:59:27,131 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:59:27,131 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:59:27,132 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:59:27,132 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:59:27,132 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:59:27,132 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:59:27,133 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:59:27,133 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:59:27,155 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-09-08 12:59:27,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 12:59:27,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:27,168 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:27,170 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:27,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:27,176 INFO L82 PathProgramCache]: Analyzing trace with hash -902016562, now seen corresponding path program 1 times [2019-09-08 12:59:27,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:27,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:27,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:27,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:27,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:27,670 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 12:59:27,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:27,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:59:27,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:59:27,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:59:27,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:59:27,700 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 3 states. [2019-09-08 12:59:27,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:27,883 INFO L93 Difference]: Finished difference Result 318 states and 534 transitions. [2019-09-08 12:59:27,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:59:27,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-08 12:59:27,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:27,908 INFO L225 Difference]: With dead ends: 318 [2019-09-08 12:59:27,908 INFO L226 Difference]: Without dead ends: 217 [2019-09-08 12:59:27,916 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 12:59:27,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-08 12:59:28,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2019-09-08 12:59:28,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-09-08 12:59:28,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 333 transitions. [2019-09-08 12:59:28,037 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 333 transitions. Word has length 66 [2019-09-08 12:59:28,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:28,038 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 333 transitions. [2019-09-08 12:59:28,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:59:28,039 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 333 transitions. [2019-09-08 12:59:28,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 12:59:28,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:28,046 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 12:59:28,047 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:28,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:28,048 INFO L82 PathProgramCache]: Analyzing trace with hash 730168783, now seen corresponding path program 1 times [2019-09-08 12:59:28,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:28,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:28,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:28,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:28,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:28,274 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 12:59:28,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:28,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:59:28,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:59:28,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:59:28,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:59:28,277 INFO L87 Difference]: Start difference. First operand 215 states and 333 transitions. Second operand 3 states. [2019-09-08 12:59:28,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:28,325 INFO L93 Difference]: Finished difference Result 507 states and 813 transitions. [2019-09-08 12:59:28,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:59:28,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-08 12:59:28,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:28,328 INFO L225 Difference]: With dead ends: 507 [2019-09-08 12:59:28,329 INFO L226 Difference]: Without dead ends: 353 [2019-09-08 12:59:28,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:59:28,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-09-08 12:59:28,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2019-09-08 12:59:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-09-08 12:59:28,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 556 transitions. [2019-09-08 12:59:28,374 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 556 transitions. Word has length 68 [2019-09-08 12:59:28,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:28,374 INFO L475 AbstractCegarLoop]: Abstraction has 351 states and 556 transitions. [2019-09-08 12:59:28,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:59:28,375 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 556 transitions. [2019-09-08 12:59:28,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 12:59:28,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:28,378 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:28,378 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:28,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:28,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1550224880, now seen corresponding path program 1 times [2019-09-08 12:59:28,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:28,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:28,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:28,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:28,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:28,500 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 12:59:28,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:28,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:59:28,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:59:28,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:59:28,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:59:28,502 INFO L87 Difference]: Start difference. First operand 351 states and 556 transitions. Second operand 3 states. [2019-09-08 12:59:28,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:28,560 INFO L93 Difference]: Finished difference Result 899 states and 1454 transitions. [2019-09-08 12:59:28,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:59:28,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-08 12:59:28,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:28,565 INFO L225 Difference]: With dead ends: 899 [2019-09-08 12:59:28,565 INFO L226 Difference]: Without dead ends: 609 [2019-09-08 12:59:28,568 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 12:59:28,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-09-08 12:59:28,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 607. [2019-09-08 12:59:28,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-09-08 12:59:28,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 972 transitions. [2019-09-08 12:59:28,607 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 972 transitions. Word has length 70 [2019-09-08 12:59:28,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:28,608 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 972 transitions. [2019-09-08 12:59:28,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:59:28,609 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 972 transitions. [2019-09-08 12:59:28,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 12:59:28,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:28,615 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:28,615 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:28,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:28,616 INFO L82 PathProgramCache]: Analyzing trace with hash -2032710127, now seen corresponding path program 1 times [2019-09-08 12:59:28,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:28,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:28,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:28,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:28,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:28,798 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 12:59:28,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:28,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:59:28,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:59:28,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:59:28,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:59:28,803 INFO L87 Difference]: Start difference. First operand 607 states and 972 transitions. Second operand 5 states. [2019-09-08 12:59:29,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:29,066 INFO L93 Difference]: Finished difference Result 2271 states and 3702 transitions. [2019-09-08 12:59:29,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:59:29,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-08 12:59:29,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:29,080 INFO L225 Difference]: With dead ends: 2271 [2019-09-08 12:59:29,081 INFO L226 Difference]: Without dead ends: 1725 [2019-09-08 12:59:29,083 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 12:59:29,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1725 states. [2019-09-08 12:59:29,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1725 to 1431. [2019-09-08 12:59:29,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2019-09-08 12:59:29,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 2318 transitions. [2019-09-08 12:59:29,186 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 2318 transitions. Word has length 72 [2019-09-08 12:59:29,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:29,187 INFO L475 AbstractCegarLoop]: Abstraction has 1431 states and 2318 transitions. [2019-09-08 12:59:29,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:59:29,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 2318 transitions. [2019-09-08 12:59:29,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 12:59:29,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:29,190 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:29,190 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:29,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:29,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1348885045, now seen corresponding path program 1 times [2019-09-08 12:59:29,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:29,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:29,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:29,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:29,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:29,344 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 12:59:29,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:29,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 12:59:29,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 12:59:29,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 12:59:29,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:59:29,346 INFO L87 Difference]: Start difference. First operand 1431 states and 2318 transitions. Second operand 6 states. [2019-09-08 12:59:29,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:29,808 INFO L93 Difference]: Finished difference Result 6563 states and 10657 transitions. [2019-09-08 12:59:29,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:59:29,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-09-08 12:59:29,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:29,836 INFO L225 Difference]: With dead ends: 6563 [2019-09-08 12:59:29,837 INFO L226 Difference]: Without dead ends: 5193 [2019-09-08 12:59:29,840 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 12:59:29,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5193 states. [2019-09-08 12:59:30,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5193 to 5090. [2019-09-08 12:59:30,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5090 states. [2019-09-08 12:59:30,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5090 states to 5090 states and 8227 transitions. [2019-09-08 12:59:30,105 INFO L78 Accepts]: Start accepts. Automaton has 5090 states and 8227 transitions. Word has length 73 [2019-09-08 12:59:30,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:30,106 INFO L475 AbstractCegarLoop]: Abstraction has 5090 states and 8227 transitions. [2019-09-08 12:59:30,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 12:59:30,106 INFO L276 IsEmpty]: Start isEmpty. Operand 5090 states and 8227 transitions. [2019-09-08 12:59:30,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 12:59:30,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:30,109 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:30,109 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:30,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:30,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1795572021, now seen corresponding path program 1 times [2019-09-08 12:59:30,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:30,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:30,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:30,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:30,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:30,175 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 12:59:30,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:30,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:59:30,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:59:30,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:59:30,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:59:30,177 INFO L87 Difference]: Start difference. First operand 5090 states and 8227 transitions. Second operand 3 states. [2019-09-08 12:59:30,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:30,541 INFO L93 Difference]: Finished difference Result 12056 states and 19550 transitions. [2019-09-08 12:59:30,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:59:30,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 12:59:30,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:30,584 INFO L225 Difference]: With dead ends: 12056 [2019-09-08 12:59:30,584 INFO L226 Difference]: Without dead ends: 7085 [2019-09-08 12:59:30,597 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 12:59:30,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7085 states. [2019-09-08 12:59:31,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7085 to 7083. [2019-09-08 12:59:31,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7083 states. [2019-09-08 12:59:31,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7083 states to 7083 states and 11458 transitions. [2019-09-08 12:59:31,073 INFO L78 Accepts]: Start accepts. Automaton has 7083 states and 11458 transitions. Word has length 74 [2019-09-08 12:59:31,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:31,074 INFO L475 AbstractCegarLoop]: Abstraction has 7083 states and 11458 transitions. [2019-09-08 12:59:31,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:59:31,074 INFO L276 IsEmpty]: Start isEmpty. Operand 7083 states and 11458 transitions. [2019-09-08 12:59:31,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 12:59:31,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:31,084 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:31,084 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:31,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:31,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1561348457, now seen corresponding path program 1 times [2019-09-08 12:59:31,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:31,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:31,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:31,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:31,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:31,187 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 12:59:31,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:31,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:59:31,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:59:31,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:59:31,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:59:31,189 INFO L87 Difference]: Start difference. First operand 7083 states and 11458 transitions. Second operand 3 states. [2019-09-08 12:59:31,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:31,521 INFO L93 Difference]: Finished difference Result 13833 states and 22425 transitions. [2019-09-08 12:59:31,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:59:31,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 12:59:31,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:31,578 INFO L225 Difference]: With dead ends: 13833 [2019-09-08 12:59:31,578 INFO L226 Difference]: Without dead ends: 9748 [2019-09-08 12:59:31,590 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 12:59:31,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9748 states. [2019-09-08 12:59:32,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9748 to 9746. [2019-09-08 12:59:32,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9746 states. [2019-09-08 12:59:32,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9746 states to 9746 states and 15681 transitions. [2019-09-08 12:59:32,087 INFO L78 Accepts]: Start accepts. Automaton has 9746 states and 15681 transitions. Word has length 74 [2019-09-08 12:59:32,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:32,087 INFO L475 AbstractCegarLoop]: Abstraction has 9746 states and 15681 transitions. [2019-09-08 12:59:32,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:59:32,088 INFO L276 IsEmpty]: Start isEmpty. Operand 9746 states and 15681 transitions. [2019-09-08 12:59:32,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 12:59:32,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:32,089 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:32,089 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:32,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:32,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1191289000, now seen corresponding path program 1 times [2019-09-08 12:59:32,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:32,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:32,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:32,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:32,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:32,187 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 12:59:32,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:32,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:59:32,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:59:32,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:59:32,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:59:32,190 INFO L87 Difference]: Start difference. First operand 9746 states and 15681 transitions. Second operand 4 states. [2019-09-08 12:59:32,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:32,826 INFO L93 Difference]: Finished difference Result 24880 states and 40083 transitions. [2019-09-08 12:59:32,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:59:32,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-09-08 12:59:32,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:32,875 INFO L225 Difference]: With dead ends: 24880 [2019-09-08 12:59:32,875 INFO L226 Difference]: Without dead ends: 15236 [2019-09-08 12:59:32,898 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 12:59:32,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15236 states. [2019-09-08 12:59:34,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15236 to 15181. [2019-09-08 12:59:34,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15181 states. [2019-09-08 12:59:34,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15181 states to 15181 states and 24351 transitions. [2019-09-08 12:59:34,080 INFO L78 Accepts]: Start accepts. Automaton has 15181 states and 24351 transitions. Word has length 74 [2019-09-08 12:59:34,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:34,081 INFO L475 AbstractCegarLoop]: Abstraction has 15181 states and 24351 transitions. [2019-09-08 12:59:34,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:59:34,081 INFO L276 IsEmpty]: Start isEmpty. Operand 15181 states and 24351 transitions. [2019-09-08 12:59:34,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 12:59:34,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:34,082 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:34,082 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:34,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:34,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1031073657, now seen corresponding path program 1 times [2019-09-08 12:59:34,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:34,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:34,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:34,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:34,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:34,159 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 12:59:34,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:34,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:59:34,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:59:34,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:59:34,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:59:34,161 INFO L87 Difference]: Start difference. First operand 15181 states and 24351 transitions. Second operand 3 states. [2019-09-08 12:59:34,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:34,841 INFO L93 Difference]: Finished difference Result 30227 states and 48561 transitions. [2019-09-08 12:59:34,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:59:34,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 12:59:34,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:34,893 INFO L225 Difference]: With dead ends: 30227 [2019-09-08 12:59:34,893 INFO L226 Difference]: Without dead ends: 20915 [2019-09-08 12:59:34,914 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 12:59:34,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20915 states. [2019-09-08 12:59:35,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20915 to 20913. [2019-09-08 12:59:35,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20913 states. [2019-09-08 12:59:35,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20913 states to 20913 states and 33282 transitions. [2019-09-08 12:59:35,802 INFO L78 Accepts]: Start accepts. Automaton has 20913 states and 33282 transitions. Word has length 74 [2019-09-08 12:59:35,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:35,802 INFO L475 AbstractCegarLoop]: Abstraction has 20913 states and 33282 transitions. [2019-09-08 12:59:35,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:59:35,802 INFO L276 IsEmpty]: Start isEmpty. Operand 20913 states and 33282 transitions. [2019-09-08 12:59:35,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 12:59:35,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:35,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:35,804 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:35,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:35,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1672252252, now seen corresponding path program 1 times [2019-09-08 12:59:35,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:35,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:35,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:35,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:35,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:35,900 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 12:59:35,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:35,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:59:35,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:59:35,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:59:35,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:59:35,902 INFO L87 Difference]: Start difference. First operand 20913 states and 33282 transitions. Second operand 4 states. [2019-09-08 12:59:37,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:37,523 INFO L93 Difference]: Finished difference Result 67623 states and 107759 transitions. [2019-09-08 12:59:37,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:59:37,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-09-08 12:59:37,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:37,683 INFO L225 Difference]: With dead ends: 67623 [2019-09-08 12:59:37,683 INFO L226 Difference]: Without dead ends: 46805 [2019-09-08 12:59:37,729 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 12:59:37,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46805 states. [2019-09-08 12:59:38,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46805 to 31642. [2019-09-08 12:59:38,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31642 states. [2019-09-08 12:59:39,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31642 states to 31642 states and 50126 transitions. [2019-09-08 12:59:39,055 INFO L78 Accepts]: Start accepts. Automaton has 31642 states and 50126 transitions. Word has length 75 [2019-09-08 12:59:39,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:39,056 INFO L475 AbstractCegarLoop]: Abstraction has 31642 states and 50126 transitions. [2019-09-08 12:59:39,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:59:39,056 INFO L276 IsEmpty]: Start isEmpty. Operand 31642 states and 50126 transitions. [2019-09-08 12:59:39,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 12:59:39,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:39,057 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:39,058 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:39,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:39,058 INFO L82 PathProgramCache]: Analyzing trace with hash -772989972, now seen corresponding path program 1 times [2019-09-08 12:59:39,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:39,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:39,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:39,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:39,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:39,213 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 12:59:39,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:39,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:59:39,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:59:39,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:59:39,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:59:39,216 INFO L87 Difference]: Start difference. First operand 31642 states and 50126 transitions. Second operand 5 states. [2019-09-08 12:59:40,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:40,709 INFO L93 Difference]: Finished difference Result 65949 states and 104542 transitions. [2019-09-08 12:59:40,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:59:40,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-08 12:59:40,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:40,810 INFO L225 Difference]: With dead ends: 65949 [2019-09-08 12:59:40,810 INFO L226 Difference]: Without dead ends: 34402 [2019-09-08 12:59:40,870 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 12:59:40,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34402 states. [2019-09-08 12:59:42,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34402 to 31642. [2019-09-08 12:59:42,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31642 states. [2019-09-08 12:59:42,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31642 states to 31642 states and 49976 transitions. [2019-09-08 12:59:42,863 INFO L78 Accepts]: Start accepts. Automaton has 31642 states and 49976 transitions. Word has length 77 [2019-09-08 12:59:42,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:42,864 INFO L475 AbstractCegarLoop]: Abstraction has 31642 states and 49976 transitions. [2019-09-08 12:59:42,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:59:42,864 INFO L276 IsEmpty]: Start isEmpty. Operand 31642 states and 49976 transitions. [2019-09-08 12:59:42,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 12:59:42,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:42,865 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:42,865 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:42,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:42,866 INFO L82 PathProgramCache]: Analyzing trace with hash -579116247, now seen corresponding path program 1 times [2019-09-08 12:59:42,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:42,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:42,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:42,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:42,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:43,042 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 12:59:43,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:43,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:59:43,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:59:43,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:59:43,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:59:43,044 INFO L87 Difference]: Start difference. First operand 31642 states and 49976 transitions. Second operand 5 states. [2019-09-08 12:59:45,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:45,240 INFO L93 Difference]: Finished difference Result 103625 states and 164009 transitions. [2019-09-08 12:59:45,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:59:45,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-09-08 12:59:45,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:45,389 INFO L225 Difference]: With dead ends: 103625 [2019-09-08 12:59:45,389 INFO L226 Difference]: Without dead ends: 72078 [2019-09-08 12:59:45,450 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 12:59:45,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72078 states. [2019-09-08 12:59:48,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72078 to 43903. [2019-09-08 12:59:48,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43903 states. [2019-09-08 12:59:48,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43903 states to 43903 states and 69159 transitions. [2019-09-08 12:59:48,343 INFO L78 Accepts]: Start accepts. Automaton has 43903 states and 69159 transitions. Word has length 80 [2019-09-08 12:59:48,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:48,344 INFO L475 AbstractCegarLoop]: Abstraction has 43903 states and 69159 transitions. [2019-09-08 12:59:48,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:59:48,344 INFO L276 IsEmpty]: Start isEmpty. Operand 43903 states and 69159 transitions. [2019-09-08 12:59:48,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:59:48,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:48,345 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:48,345 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:48,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:48,346 INFO L82 PathProgramCache]: Analyzing trace with hash -774643767, now seen corresponding path program 1 times [2019-09-08 12:59:48,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:48,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:48,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:48,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:48,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:48,437 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 12:59:48,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:48,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:59:48,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:59:48,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:59:48,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:59:48,439 INFO L87 Difference]: Start difference. First operand 43903 states and 69159 transitions. Second operand 5 states. [2019-09-08 12:59:51,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:51,090 INFO L93 Difference]: Finished difference Result 76991 states and 120573 transitions. [2019-09-08 12:59:51,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:59:51,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-08 12:59:51,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:51,218 INFO L225 Difference]: With dead ends: 76991 [2019-09-08 12:59:51,219 INFO L226 Difference]: Without dead ends: 76989 [2019-09-08 12:59:51,239 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 12:59:51,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76989 states. [2019-09-08 12:59:54,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76989 to 44931. [2019-09-08 12:59:54,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44931 states. [2019-09-08 12:59:54,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44931 states to 44931 states and 70178 transitions. [2019-09-08 12:59:54,517 INFO L78 Accepts]: Start accepts. Automaton has 44931 states and 70178 transitions. Word has length 81 [2019-09-08 12:59:54,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:54,518 INFO L475 AbstractCegarLoop]: Abstraction has 44931 states and 70178 transitions. [2019-09-08 12:59:54,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:59:54,518 INFO L276 IsEmpty]: Start isEmpty. Operand 44931 states and 70178 transitions. [2019-09-08 12:59:54,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:59:54,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:54,521 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:54,522 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:54,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:54,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1389875202, now seen corresponding path program 1 times [2019-09-08 12:59:54,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:54,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:54,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:54,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:54,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:54,692 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 12:59:54,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:54,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:59:54,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:59:54,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:59:54,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:59:54,694 INFO L87 Difference]: Start difference. First operand 44931 states and 70178 transitions. Second operand 4 states. [2019-09-08 12:59:58,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:58,326 INFO L93 Difference]: Finished difference Result 126826 states and 198578 transitions. [2019-09-08 12:59:58,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:59:58,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-08 12:59:58,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:58,480 INFO L225 Difference]: With dead ends: 126826 [2019-09-08 12:59:58,480 INFO L226 Difference]: Without dead ends: 88113 [2019-09-08 12:59:58,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 12:59:58,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88113 states. [2019-09-08 13:00:03,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88113 to 81200. [2019-09-08 13:00:03,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81200 states. [2019-09-08 13:00:03,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81200 states to 81200 states and 126679 transitions. [2019-09-08 13:00:03,946 INFO L78 Accepts]: Start accepts. Automaton has 81200 states and 126679 transitions. Word has length 105 [2019-09-08 13:00:03,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:00:03,946 INFO L475 AbstractCegarLoop]: Abstraction has 81200 states and 126679 transitions. [2019-09-08 13:00:03,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:00:03,947 INFO L276 IsEmpty]: Start isEmpty. Operand 81200 states and 126679 transitions. [2019-09-08 13:00:03,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 13:00:03,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:00:03,949 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:00:03,950 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:00:03,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:00:03,950 INFO L82 PathProgramCache]: Analyzing trace with hash 451828384, now seen corresponding path program 1 times [2019-09-08 13:00:03,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:00:03,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:00:03,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:03,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:00:03,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:00:04,026 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:00:04,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:00:04,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:00:04,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:00:04,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:00:04,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:00:04,027 INFO L87 Difference]: Start difference. First operand 81200 states and 126679 transitions. Second operand 3 states. [2019-09-08 13:00:06,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:00:06,907 INFO L93 Difference]: Finished difference Result 148886 states and 232502 transitions. [2019-09-08 13:00:06,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:00:06,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-08 13:00:06,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:00:07,021 INFO L225 Difference]: With dead ends: 148886 [2019-09-08 13:00:07,022 INFO L226 Difference]: Without dead ends: 67781 [2019-09-08 13:00:07,109 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 13:00:07,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67781 states. [2019-09-08 13:00:10,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67781 to 67662. [2019-09-08 13:00:10,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67662 states. [2019-09-08 13:00:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67662 states to 67662 states and 105085 transitions. [2019-09-08 13:00:10,221 INFO L78 Accepts]: Start accepts. Automaton has 67662 states and 105085 transitions. Word has length 105 [2019-09-08 13:00:10,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:00:10,222 INFO L475 AbstractCegarLoop]: Abstraction has 67662 states and 105085 transitions. [2019-09-08 13:00:10,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:00:10,222 INFO L276 IsEmpty]: Start isEmpty. Operand 67662 states and 105085 transitions. [2019-09-08 13:00:10,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 13:00:10,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:00:10,224 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:00:10,224 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:00:10,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:00:10,224 INFO L82 PathProgramCache]: Analyzing trace with hash -2140593730, now seen corresponding path program 1 times [2019-09-08 13:00:10,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:00:10,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:00:10,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:10,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:00:10,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:00:10,383 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 13:00:10,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:00:10,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:00:10,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:00:10,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:00:10,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:00:10,387 INFO L87 Difference]: Start difference. First operand 67662 states and 105085 transitions. Second operand 4 states. [2019-09-08 13:00:17,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:00:17,469 INFO L93 Difference]: Finished difference Result 166162 states and 257965 transitions. [2019-09-08 13:00:17,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:00:17,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-08 13:00:17,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:00:17,667 INFO L225 Difference]: With dead ends: 166162 [2019-09-08 13:00:17,667 INFO L226 Difference]: Without dead ends: 123840 [2019-09-08 13:00:17,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 13:00:17,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123840 states. [2019-09-08 13:00:22,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123840 to 107403. [2019-09-08 13:00:22,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107403 states. [2019-09-08 13:00:23,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107403 states to 107403 states and 166628 transitions. [2019-09-08 13:00:23,078 INFO L78 Accepts]: Start accepts. Automaton has 107403 states and 166628 transitions. Word has length 105 [2019-09-08 13:00:23,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:00:23,078 INFO L475 AbstractCegarLoop]: Abstraction has 107403 states and 166628 transitions. [2019-09-08 13:00:23,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:00:23,078 INFO L276 IsEmpty]: Start isEmpty. Operand 107403 states and 166628 transitions. [2019-09-08 13:00:23,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 13:00:23,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:00:23,079 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:00:23,080 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:00:23,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:00:23,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1024080765, now seen corresponding path program 1 times [2019-09-08 13:00:23,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:00:23,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:00:23,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:23,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:00:23,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:00:23,186 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 13:00:23,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:00:23,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:00:23,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:00:23,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:00:23,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:00:23,188 INFO L87 Difference]: Start difference. First operand 107403 states and 166628 transitions. Second operand 5 states. [2019-09-08 13:00:31,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:00:31,142 INFO L93 Difference]: Finished difference Result 148074 states and 229847 transitions. [2019-09-08 13:00:31,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:00:31,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-08 13:00:31,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:00:31,345 INFO L225 Difference]: With dead ends: 148074 [2019-09-08 13:00:31,345 INFO L226 Difference]: Without dead ends: 135512 [2019-09-08 13:00:31,388 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 13:00:31,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135512 states. [2019-09-08 13:00:37,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135512 to 129560. [2019-09-08 13:00:37,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129560 states. [2019-09-08 13:00:37,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129560 states to 129560 states and 200637 transitions. [2019-09-08 13:00:37,765 INFO L78 Accepts]: Start accepts. Automaton has 129560 states and 200637 transitions. Word has length 106 [2019-09-08 13:00:37,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:00:37,765 INFO L475 AbstractCegarLoop]: Abstraction has 129560 states and 200637 transitions. [2019-09-08 13:00:37,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:00:37,766 INFO L276 IsEmpty]: Start isEmpty. Operand 129560 states and 200637 transitions. [2019-09-08 13:00:37,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 13:00:37,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:00:37,767 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:00:37,767 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:00:37,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:00:37,768 INFO L82 PathProgramCache]: Analyzing trace with hash -522040011, now seen corresponding path program 1 times [2019-09-08 13:00:37,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:00:37,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:00:37,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:37,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:00:37,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:00:37,834 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 13:00:37,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:00:37,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:00:37,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:00:37,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:00:37,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:00:37,836 INFO L87 Difference]: Start difference. First operand 129560 states and 200637 transitions. Second operand 3 states. [2019-09-08 13:00:50,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:00:50,090 INFO L93 Difference]: Finished difference Result 245456 states and 380945 transitions. [2019-09-08 13:00:50,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:00:50,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-08 13:00:50,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:00:50,416 INFO L225 Difference]: With dead ends: 245456 [2019-09-08 13:00:50,416 INFO L226 Difference]: Without dead ends: 198944 [2019-09-08 13:00:50,491 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 13:00:50,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198944 states. [2019-09-08 13:01:03,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198944 to 198430. [2019-09-08 13:01:03,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198430 states. [2019-09-08 13:01:03,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198430 states to 198430 states and 306997 transitions. [2019-09-08 13:01:03,603 INFO L78 Accepts]: Start accepts. Automaton has 198430 states and 306997 transitions. Word has length 108 [2019-09-08 13:01:03,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:01:03,603 INFO L475 AbstractCegarLoop]: Abstraction has 198430 states and 306997 transitions. [2019-09-08 13:01:03,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:01:03,604 INFO L276 IsEmpty]: Start isEmpty. Operand 198430 states and 306997 transitions. [2019-09-08 13:01:03,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 13:01:03,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:01:03,605 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:01:03,605 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:01:03,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:01:03,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1372872252, now seen corresponding path program 1 times [2019-09-08 13:01:03,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:01:03,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:01:03,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:03,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:01:03,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:01:03,713 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 13:01:03,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 13:01:03,714 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 13:01:03,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:01:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:01:03,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 13:01:03,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 13:01:03,960 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 13:01:03,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 13:01:03,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 13:01:03,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:01:03,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:01:03,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:01:03,969 INFO L87 Difference]: Start difference. First operand 198430 states and 306997 transitions. Second operand 8 states. [2019-09-08 13:01:31,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:01:31,587 INFO L93 Difference]: Finished difference Result 540444 states and 841401 transitions. [2019-09-08 13:01:31,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 13:01:31,588 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 108 [2019-09-08 13:01:31,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:01:32,795 INFO L225 Difference]: With dead ends: 540444 [2019-09-08 13:01:32,795 INFO L226 Difference]: Without dead ends: 467070 [2019-09-08 13:01:32,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2019-09-08 13:01:33,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467070 states. [2019-09-08 13:02:00,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467070 to 332773. [2019-09-08 13:02:00,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332773 states. [2019-09-08 13:02:01,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332773 states to 332773 states and 515019 transitions. [2019-09-08 13:02:01,470 INFO L78 Accepts]: Start accepts. Automaton has 332773 states and 515019 transitions. Word has length 108 [2019-09-08 13:02:01,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:02:01,471 INFO L475 AbstractCegarLoop]: Abstraction has 332773 states and 515019 transitions. [2019-09-08 13:02:01,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 13:02:01,471 INFO L276 IsEmpty]: Start isEmpty. Operand 332773 states and 515019 transitions. [2019-09-08 13:02:01,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 13:02:01,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:02:01,473 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:02:01,473 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:02:01,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:02:01,473 INFO L82 PathProgramCache]: Analyzing trace with hash 477203296, now seen corresponding path program 1 times [2019-09-08 13:02:01,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:02:01,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:02:01,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:01,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:02:01,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:02:01,549 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 13:02:01,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:02:01,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:02:01,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:02:01,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:02:01,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:02:01,550 INFO L87 Difference]: Start difference. First operand 332773 states and 515019 transitions. Second operand 3 states. [2019-09-08 13:02:43,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:02:43,064 INFO L93 Difference]: Finished difference Result 981590 states and 1516994 transitions. [2019-09-08 13:02:43,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:02:43,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-08 13:02:43,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:02:44,229 INFO L225 Difference]: With dead ends: 981590 [2019-09-08 13:02:44,229 INFO L226 Difference]: Without dead ends: 648882 [2019-09-08 13:02:44,538 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 13:02:45,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648882 states. [2019-09-08 13:03:44,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648882 to 648880. [2019-09-08 13:03:44,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648880 states. [2019-09-08 13:03:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648880 states to 648880 states and 996103 transitions. [2019-09-08 13:03:45,894 INFO L78 Accepts]: Start accepts. Automaton has 648880 states and 996103 transitions. Word has length 109 [2019-09-08 13:03:45,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:45,895 INFO L475 AbstractCegarLoop]: Abstraction has 648880 states and 996103 transitions. [2019-09-08 13:03:45,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:03:45,895 INFO L276 IsEmpty]: Start isEmpty. Operand 648880 states and 996103 transitions. [2019-09-08 13:03:45,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 13:03:45,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:45,897 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:45,897 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:45,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:45,898 INFO L82 PathProgramCache]: Analyzing trace with hash -512137558, now seen corresponding path program 1 times [2019-09-08 13:03:45,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:45,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:45,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:45,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:45,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:45,960 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:03:45,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:45,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:03:45,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:03:45,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:03:45,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:03:45,962 INFO L87 Difference]: Start difference. First operand 648880 states and 996103 transitions. Second operand 3 states. [2019-09-08 13:05:20,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:20,064 INFO L93 Difference]: Finished difference Result 1904583 states and 2918443 transitions. [2019-09-08 13:05:20,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:05:20,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-08 13:05:20,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:22,661 INFO L225 Difference]: With dead ends: 1904583 [2019-09-08 13:05:22,662 INFO L226 Difference]: Without dead ends: 1255875 [2019-09-08 13:05:23,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:05:24,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255875 states. [2019-09-08 13:07:26,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255875 to 1255873. [2019-09-08 13:07:26,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1255873 states. [2019-09-08 13:07:30,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255873 states to 1255873 states and 1908941 transitions. [2019-09-08 13:07:30,796 INFO L78 Accepts]: Start accepts. Automaton has 1255873 states and 1908941 transitions. Word has length 109 [2019-09-08 13:07:30,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:30,796 INFO L475 AbstractCegarLoop]: Abstraction has 1255873 states and 1908941 transitions. [2019-09-08 13:07:30,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:07:30,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1255873 states and 1908941 transitions. [2019-09-08 13:07:30,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 13:07:30,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:30,800 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:30,800 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:30,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:30,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1951603517, now seen corresponding path program 1 times [2019-09-08 13:07:30,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:30,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:30,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:30,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:30,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:30,861 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 13:07:30,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:30,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:07:30,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:07:30,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:07:30,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:07:30,862 INFO L87 Difference]: Start difference. First operand 1255873 states and 1908941 transitions. Second operand 3 states.