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.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:54:27,601 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:54:27,603 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:54:27,614 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:54:27,615 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:54:27,616 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:54:27,617 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:54:27,619 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:54:27,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:54:27,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:54:27,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:54:27,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:54:27,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:54:27,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:54:27,626 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:54:27,627 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:54:27,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:54:27,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:54:27,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:54:27,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:54:27,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:54:27,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:54:27,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:54:27,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:54:27,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:54:27,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:54:27,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:54:27,642 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:54:27,642 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:54:27,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:54:27,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:54:27,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:54:27,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:54:27,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:54:27,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:54:27,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:54:27,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:54:27,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:54:27,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:54:27,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:54:27,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:54:27,650 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:54:27,664 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:54:27,665 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:54:27,666 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:54:27,666 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:54:27,666 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:54:27,667 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:54:27,667 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:54:27,667 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:54:27,667 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:54:27,667 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:54:27,668 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:54:27,668 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:54:27,668 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:54:27,668 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:54:27,668 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:54:27,669 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:54:27,669 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:54:27,669 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:54:27,669 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:54:27,669 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:54:27,670 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:54:27,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:54:27,670 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:54:27,670 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:54:27,670 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:54:27,671 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:54:27,671 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:54:27,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:54:27,671 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:54:27,700 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:54:27,712 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:54:27,716 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:54:27,717 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:54:27,718 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:54:27,718 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.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 12:54:27,778 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8488f062d/577a8f7febf549bba582c3042cc08ea0/FLAG18b9e97dd [2019-09-08 12:54:28,337 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:54:28,339 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 12:54:28,355 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8488f062d/577a8f7febf549bba582c3042cc08ea0/FLAG18b9e97dd [2019-09-08 12:54:28,587 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8488f062d/577a8f7febf549bba582c3042cc08ea0 [2019-09-08 12:54:28,600 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:54:28,601 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:54:28,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:54:28,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:54:28,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:54:28,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:54:28" (1/1) ... [2019-09-08 12:54:28,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57d59ffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:28, skipping insertion in model container [2019-09-08 12:54:28,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:54:28" (1/1) ... [2019-09-08 12:54:28,623 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:54:28,684 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:54:29,078 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:54:29,093 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:54:29,205 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:54:29,247 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:54:29,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:29 WrapperNode [2019-09-08 12:54:29,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:54:29,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:54:29,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:54:29,248 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:54:29,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:29" (1/1) ... [2019-09-08 12:54:29,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:29" (1/1) ... [2019-09-08 12:54:29,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:29" (1/1) ... [2019-09-08 12:54:29,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:29" (1/1) ... [2019-09-08 12:54:29,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:29" (1/1) ... [2019-09-08 12:54:29,301 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:29" (1/1) ... [2019-09-08 12:54:29,305 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:29" (1/1) ... [2019-09-08 12:54:29,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:54:29,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:54:29,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:54:29,311 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:54:29,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:29" (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:54:29,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:54:29,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:54:29,372 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:54:29,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:54:29,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:54:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:54:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:54:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:54:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:54:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:54:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:54:29,374 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:54:29,374 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:54:29,374 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:54:29,374 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:54:29,374 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:54:29,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:54:29,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:54:30,202 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:54:30,202 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:54:30,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:54:30 BoogieIcfgContainer [2019-09-08 12:54:30,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:54:30,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:54:30,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:54:30,208 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:54:30,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:54:28" (1/3) ... [2019-09-08 12:54:30,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6f7ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:54:30, skipping insertion in model container [2019-09-08 12:54:30,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:29" (2/3) ... [2019-09-08 12:54:30,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6f7ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:54:30, skipping insertion in model container [2019-09-08 12:54:30,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:54:30" (3/3) ... [2019-09-08 12:54:30,216 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 12:54:30,226 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:54:30,248 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:54:30,265 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:54:30,298 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:54:30,299 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:54:30,299 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:54:30,299 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:54:30,300 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:54:30,300 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:54:30,300 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:54:30,300 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:54:30,300 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:54:30,324 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-09-08 12:54:30,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 12:54:30,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:30,336 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:54:30,338 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:30,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:30,344 INFO L82 PathProgramCache]: Analyzing trace with hash -902016562, now seen corresponding path program 1 times [2019-09-08 12:54:30,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:30,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:30,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:30,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:30,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:30,810 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:54:30,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:30,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:54:30,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:54:30,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:54:30,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:30,835 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 3 states. [2019-09-08 12:54:30,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:30,976 INFO L93 Difference]: Finished difference Result 330 states and 554 transitions. [2019-09-08 12:54:30,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:54:30,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-08 12:54:30,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:31,004 INFO L225 Difference]: With dead ends: 330 [2019-09-08 12:54:31,004 INFO L226 Difference]: Without dead ends: 229 [2019-09-08 12:54:31,013 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:54:31,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-09-08 12:54:31,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2019-09-08 12:54:31,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-08 12:54:31,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 353 transitions. [2019-09-08 12:54:31,087 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 353 transitions. Word has length 66 [2019-09-08 12:54:31,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:31,087 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 353 transitions. [2019-09-08 12:54:31,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:54:31,088 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 353 transitions. [2019-09-08 12:54:31,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 12:54:31,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:31,092 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:54:31,092 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:31,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:31,093 INFO L82 PathProgramCache]: Analyzing trace with hash 730168783, now seen corresponding path program 1 times [2019-09-08 12:54:31,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:31,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:31,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:31,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:31,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:31,257 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:54:31,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:31,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:54:31,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:54:31,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:54:31,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:31,260 INFO L87 Difference]: Start difference. First operand 227 states and 353 transitions. Second operand 3 states. [2019-09-08 12:54:31,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:31,342 INFO L93 Difference]: Finished difference Result 543 states and 873 transitions. [2019-09-08 12:54:31,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:54:31,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-08 12:54:31,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:31,348 INFO L225 Difference]: With dead ends: 543 [2019-09-08 12:54:31,348 INFO L226 Difference]: Without dead ends: 377 [2019-09-08 12:54:31,352 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:54:31,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-09-08 12:54:31,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2019-09-08 12:54:31,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-08 12:54:31,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 596 transitions. [2019-09-08 12:54:31,421 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 596 transitions. Word has length 68 [2019-09-08 12:54:31,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:31,424 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 596 transitions. [2019-09-08 12:54:31,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:54:31,425 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 596 transitions. [2019-09-08 12:54:31,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 12:54:31,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:31,432 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:54:31,433 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:31,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:31,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1550224880, now seen corresponding path program 1 times [2019-09-08 12:54:31,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:31,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:31,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:31,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:31,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:31,556 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:54:31,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:31,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:54:31,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:54:31,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:54:31,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:31,558 INFO L87 Difference]: Start difference. First operand 375 states and 596 transitions. Second operand 3 states. [2019-09-08 12:54:31,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:31,630 INFO L93 Difference]: Finished difference Result 971 states and 1574 transitions. [2019-09-08 12:54:31,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:54:31,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-08 12:54:31,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:31,635 INFO L225 Difference]: With dead ends: 971 [2019-09-08 12:54:31,635 INFO L226 Difference]: Without dead ends: 657 [2019-09-08 12:54:31,638 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:54:31,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-09-08 12:54:31,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 655. [2019-09-08 12:54:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-09-08 12:54:31,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1052 transitions. [2019-09-08 12:54:31,676 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1052 transitions. Word has length 70 [2019-09-08 12:54:31,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:31,677 INFO L475 AbstractCegarLoop]: Abstraction has 655 states and 1052 transitions. [2019-09-08 12:54:31,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:54:31,677 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1052 transitions. [2019-09-08 12:54:31,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 12:54:31,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:31,680 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:54:31,680 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:31,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:31,680 INFO L82 PathProgramCache]: Analyzing trace with hash -2032710127, now seen corresponding path program 1 times [2019-09-08 12:54:31,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:31,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:31,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:31,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:31,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:31,841 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:54:31,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:31,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:54:31,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:54:31,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:54:31,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:54:31,845 INFO L87 Difference]: Start difference. First operand 655 states and 1052 transitions. Second operand 5 states. [2019-09-08 12:54:32,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:32,046 INFO L93 Difference]: Finished difference Result 2187 states and 3582 transitions. [2019-09-08 12:54:32,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:54:32,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-08 12:54:32,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:32,058 INFO L225 Difference]: With dead ends: 2187 [2019-09-08 12:54:32,059 INFO L226 Difference]: Without dead ends: 1593 [2019-09-08 12:54:32,061 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:54:32,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2019-09-08 12:54:32,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1421. [2019-09-08 12:54:32,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2019-09-08 12:54:32,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2313 transitions. [2019-09-08 12:54:32,148 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2313 transitions. Word has length 72 [2019-09-08 12:54:32,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:32,149 INFO L475 AbstractCegarLoop]: Abstraction has 1421 states and 2313 transitions. [2019-09-08 12:54:32,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:54:32,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2313 transitions. [2019-09-08 12:54:32,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 12:54:32,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:32,151 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:54:32,152 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:32,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:32,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1348885045, now seen corresponding path program 1 times [2019-09-08 12:54:32,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:32,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:32,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:32,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:32,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:32,300 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:54:32,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:32,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 12:54:32,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 12:54:32,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 12:54:32,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:54:32,302 INFO L87 Difference]: Start difference. First operand 1421 states and 2313 transitions. Second operand 6 states. [2019-09-08 12:54:32,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:32,691 INFO L93 Difference]: Finished difference Result 5599 states and 9165 transitions. [2019-09-08 12:54:32,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:54:32,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-09-08 12:54:32,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:32,716 INFO L225 Difference]: With dead ends: 5599 [2019-09-08 12:54:32,716 INFO L226 Difference]: Without dead ends: 4239 [2019-09-08 12:54:32,720 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:54:32,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4239 states. [2019-09-08 12:54:32,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4239 to 4136. [2019-09-08 12:54:32,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4136 states. [2019-09-08 12:54:32,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4136 states to 4136 states and 6750 transitions. [2019-09-08 12:54:32,951 INFO L78 Accepts]: Start accepts. Automaton has 4136 states and 6750 transitions. Word has length 73 [2019-09-08 12:54:32,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:32,952 INFO L475 AbstractCegarLoop]: Abstraction has 4136 states and 6750 transitions. [2019-09-08 12:54:32,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 12:54:32,952 INFO L276 IsEmpty]: Start isEmpty. Operand 4136 states and 6750 transitions. [2019-09-08 12:54:32,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 12:54:32,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:32,955 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:54:32,956 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:32,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:32,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1795572021, now seen corresponding path program 1 times [2019-09-08 12:54:32,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:32,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:32,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:32,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:32,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:33,024 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:54:33,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:33,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:54:33,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:54:33,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:54:33,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:33,027 INFO L87 Difference]: Start difference. First operand 4136 states and 6750 transitions. Second operand 3 states. [2019-09-08 12:54:33,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:33,398 INFO L93 Difference]: Finished difference Result 9044 states and 14832 transitions. [2019-09-08 12:54:33,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:54:33,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 12:54:33,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:33,433 INFO L225 Difference]: With dead ends: 9044 [2019-09-08 12:54:33,434 INFO L226 Difference]: Without dead ends: 6131 [2019-09-08 12:54:33,441 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:54:33,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6131 states. [2019-09-08 12:54:33,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6131 to 6129. [2019-09-08 12:54:33,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6129 states. [2019-09-08 12:54:33,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6129 states to 6129 states and 9981 transitions. [2019-09-08 12:54:33,782 INFO L78 Accepts]: Start accepts. Automaton has 6129 states and 9981 transitions. Word has length 74 [2019-09-08 12:54:33,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:33,782 INFO L475 AbstractCegarLoop]: Abstraction has 6129 states and 9981 transitions. [2019-09-08 12:54:33,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:54:33,783 INFO L276 IsEmpty]: Start isEmpty. Operand 6129 states and 9981 transitions. [2019-09-08 12:54:33,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 12:54:33,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:33,784 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:54:33,785 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:33,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:33,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1561348457, now seen corresponding path program 1 times [2019-09-08 12:54:33,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:33,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:33,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:33,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:33,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:33,901 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:54:33,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:33,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:54:33,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:54:33,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:54:33,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:33,903 INFO L87 Difference]: Start difference. First operand 6129 states and 9981 transitions. Second operand 3 states. [2019-09-08 12:54:34,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:34,242 INFO L93 Difference]: Finished difference Result 12027 states and 19634 transitions. [2019-09-08 12:54:34,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:54:34,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 12:54:34,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:34,289 INFO L225 Difference]: With dead ends: 12027 [2019-09-08 12:54:34,289 INFO L226 Difference]: Without dead ends: 8439 [2019-09-08 12:54:34,300 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:54:34,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8439 states. [2019-09-08 12:54:34,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8439 to 8437. [2019-09-08 12:54:34,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8437 states. [2019-09-08 12:54:34,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8437 states to 8437 states and 13683 transitions. [2019-09-08 12:54:34,856 INFO L78 Accepts]: Start accepts. Automaton has 8437 states and 13683 transitions. Word has length 74 [2019-09-08 12:54:34,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:34,856 INFO L475 AbstractCegarLoop]: Abstraction has 8437 states and 13683 transitions. [2019-09-08 12:54:34,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:54:34,856 INFO L276 IsEmpty]: Start isEmpty. Operand 8437 states and 13683 transitions. [2019-09-08 12:54:34,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 12:54:34,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:34,858 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:54:34,858 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:34,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:34,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1191289000, now seen corresponding path program 1 times [2019-09-08 12:54:34,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:34,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:34,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:34,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:34,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:34,950 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:54:34,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:34,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:54:34,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:54:34,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:54:34,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:54:34,952 INFO L87 Difference]: Start difference. First operand 8437 states and 13683 transitions. Second operand 4 states. [2019-09-08 12:54:35,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:35,603 INFO L93 Difference]: Finished difference Result 21121 states and 34309 transitions. [2019-09-08 12:54:35,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:54:35,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-09-08 12:54:35,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:35,650 INFO L225 Difference]: With dead ends: 21121 [2019-09-08 12:54:35,650 INFO L226 Difference]: Without dead ends: 13079 [2019-09-08 12:54:35,667 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:54:35,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13079 states. [2019-09-08 12:54:36,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13079 to 13035. [2019-09-08 12:54:36,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13035 states. [2019-09-08 12:54:36,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13035 states to 13035 states and 21086 transitions. [2019-09-08 12:54:36,351 INFO L78 Accepts]: Start accepts. Automaton has 13035 states and 21086 transitions. Word has length 74 [2019-09-08 12:54:36,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:36,351 INFO L475 AbstractCegarLoop]: Abstraction has 13035 states and 21086 transitions. [2019-09-08 12:54:36,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:54:36,352 INFO L276 IsEmpty]: Start isEmpty. Operand 13035 states and 21086 transitions. [2019-09-08 12:54:36,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 12:54:36,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:36,353 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:54:36,353 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:36,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:36,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1031073657, now seen corresponding path program 1 times [2019-09-08 12:54:36,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:36,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:36,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:36,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:36,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:36,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:36,411 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:54:36,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:36,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:54:36,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:54:36,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:54:36,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:36,413 INFO L87 Difference]: Start difference. First operand 13035 states and 21086 transitions. Second operand 3 states. [2019-09-08 12:54:37,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:37,590 INFO L93 Difference]: Finished difference Result 26195 states and 42422 transitions. [2019-09-08 12:54:37,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:54:37,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 12:54:37,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:37,651 INFO L225 Difference]: With dead ends: 26195 [2019-09-08 12:54:37,652 INFO L226 Difference]: Without dead ends: 17770 [2019-09-08 12:54:37,677 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:54:37,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17770 states. [2019-09-08 12:54:38,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17770 to 17768. [2019-09-08 12:54:38,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17768 states. [2019-09-08 12:54:38,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17768 states to 17768 states and 28544 transitions. [2019-09-08 12:54:38,431 INFO L78 Accepts]: Start accepts. Automaton has 17768 states and 28544 transitions. Word has length 74 [2019-09-08 12:54:38,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:38,432 INFO L475 AbstractCegarLoop]: Abstraction has 17768 states and 28544 transitions. [2019-09-08 12:54:38,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:54:38,432 INFO L276 IsEmpty]: Start isEmpty. Operand 17768 states and 28544 transitions. [2019-09-08 12:54:38,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 12:54:38,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:38,433 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:54:38,433 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:38,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:38,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1672252252, now seen corresponding path program 1 times [2019-09-08 12:54:38,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:38,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:38,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:38,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:38,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:38,511 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:54:38,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:38,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:54:38,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:54:38,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:54:38,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:54:38,513 INFO L87 Difference]: Start difference. First operand 17768 states and 28544 transitions. Second operand 4 states. [2019-09-08 12:54:39,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:39,729 INFO L93 Difference]: Finished difference Result 57121 states and 91905 transitions. [2019-09-08 12:54:39,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:54:39,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-09-08 12:54:39,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:39,836 INFO L225 Difference]: With dead ends: 57121 [2019-09-08 12:54:39,837 INFO L226 Difference]: Without dead ends: 39448 [2019-09-08 12:54:39,880 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:54:39,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39448 states. [2019-09-08 12:54:41,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39448 to 26203. [2019-09-08 12:54:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26203 states. [2019-09-08 12:54:41,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26203 states to 26203 states and 41961 transitions. [2019-09-08 12:54:41,377 INFO L78 Accepts]: Start accepts. Automaton has 26203 states and 41961 transitions. Word has length 75 [2019-09-08 12:54:41,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:41,381 INFO L475 AbstractCegarLoop]: Abstraction has 26203 states and 41961 transitions. [2019-09-08 12:54:41,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:54:41,381 INFO L276 IsEmpty]: Start isEmpty. Operand 26203 states and 41961 transitions. [2019-09-08 12:54:41,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 12:54:41,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:41,383 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:54:41,383 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:41,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:41,384 INFO L82 PathProgramCache]: Analyzing trace with hash -772989972, now seen corresponding path program 1 times [2019-09-08 12:54:41,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:41,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:41,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:41,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:41,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:41,554 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:54:41,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:41,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:54:41,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:54:41,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:54:41,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:54:41,555 INFO L87 Difference]: Start difference. First operand 26203 states and 41961 transitions. Second operand 5 states. [2019-09-08 12:54:43,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:43,002 INFO L93 Difference]: Finished difference Result 54283 states and 87000 transitions. [2019-09-08 12:54:43,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:54:43,003 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-08 12:54:43,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:43,082 INFO L225 Difference]: With dead ends: 54283 [2019-09-08 12:54:43,083 INFO L226 Difference]: Without dead ends: 28175 [2019-09-08 12:54:43,138 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:54:43,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28175 states. [2019-09-08 12:54:44,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28175 to 26203. [2019-09-08 12:54:44,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26203 states. [2019-09-08 12:54:44,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26203 states to 26203 states and 41826 transitions. [2019-09-08 12:54:44,148 INFO L78 Accepts]: Start accepts. Automaton has 26203 states and 41826 transitions. Word has length 77 [2019-09-08 12:54:44,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:44,148 INFO L475 AbstractCegarLoop]: Abstraction has 26203 states and 41826 transitions. [2019-09-08 12:54:44,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:54:44,148 INFO L276 IsEmpty]: Start isEmpty. Operand 26203 states and 41826 transitions. [2019-09-08 12:54:44,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 12:54:44,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:44,149 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:54:44,150 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:44,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:44,150 INFO L82 PathProgramCache]: Analyzing trace with hash -579116247, now seen corresponding path program 1 times [2019-09-08 12:54:44,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:44,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:44,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:44,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:44,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:44,311 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:54:44,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:44,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:54:44,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:54:44,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:54:44,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:54:44,313 INFO L87 Difference]: Start difference. First operand 26203 states and 41826 transitions. Second operand 5 states. [2019-09-08 12:54:45,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:45,954 INFO L93 Difference]: Finished difference Result 84907 states and 135887 transitions. [2019-09-08 12:54:45,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:54:45,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-09-08 12:54:45,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:46,114 INFO L225 Difference]: With dead ends: 84907 [2019-09-08 12:54:46,114 INFO L226 Difference]: Without dead ends: 58799 [2019-09-08 12:54:46,155 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:54:46,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58799 states. [2019-09-08 12:54:48,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58799 to 36841. [2019-09-08 12:54:48,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36841 states. [2019-09-08 12:54:48,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36841 states to 36841 states and 58607 transitions. [2019-09-08 12:54:48,525 INFO L78 Accepts]: Start accepts. Automaton has 36841 states and 58607 transitions. Word has length 80 [2019-09-08 12:54:48,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:48,526 INFO L475 AbstractCegarLoop]: Abstraction has 36841 states and 58607 transitions. [2019-09-08 12:54:48,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:54:48,526 INFO L276 IsEmpty]: Start isEmpty. Operand 36841 states and 58607 transitions. [2019-09-08 12:54:48,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:54:48,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:48,527 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:54:48,527 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:48,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:48,527 INFO L82 PathProgramCache]: Analyzing trace with hash -774643767, now seen corresponding path program 1 times [2019-09-08 12:54:48,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:48,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:48,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:48,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:48,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:48,644 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:54:48,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:48,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:54:48,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:54:48,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:54:48,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:54:48,646 INFO L87 Difference]: Start difference. First operand 36841 states and 58607 transitions. Second operand 5 states. [2019-09-08 12:54:51,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:51,321 INFO L93 Difference]: Finished difference Result 65272 states and 103275 transitions. [2019-09-08 12:54:51,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:54:51,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-08 12:54:51,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:51,417 INFO L225 Difference]: With dead ends: 65272 [2019-09-08 12:54:51,417 INFO L226 Difference]: Without dead ends: 65270 [2019-09-08 12:54:51,434 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:54:51,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65270 states. [2019-09-08 12:54:54,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65270 to 37697. [2019-09-08 12:54:54,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37697 states. [2019-09-08 12:54:54,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37697 states to 37697 states and 59454 transitions. [2019-09-08 12:54:54,279 INFO L78 Accepts]: Start accepts. Automaton has 37697 states and 59454 transitions. Word has length 81 [2019-09-08 12:54:54,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:54,279 INFO L475 AbstractCegarLoop]: Abstraction has 37697 states and 59454 transitions. [2019-09-08 12:54:54,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:54:54,280 INFO L276 IsEmpty]: Start isEmpty. Operand 37697 states and 59454 transitions. [2019-09-08 12:54:54,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:54:54,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:54,283 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:54:54,283 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:54,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:54,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1389875202, now seen corresponding path program 1 times [2019-09-08 12:54:54,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:54,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:54,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:54,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:54,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:54,396 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:54:54,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:54,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:54:54,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:54:54,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:54:54,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:54:54,399 INFO L87 Difference]: Start difference. First operand 37697 states and 59454 transitions. Second operand 5 states. [2019-09-08 12:54:56,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:56,470 INFO L93 Difference]: Finished difference Result 61813 states and 97966 transitions. [2019-09-08 12:54:56,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:54:56,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-08 12:54:56,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:56,526 INFO L225 Difference]: With dead ends: 61813 [2019-09-08 12:54:56,527 INFO L226 Difference]: Without dead ends: 43482 [2019-09-08 12:54:56,547 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:54:56,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43482 states. [2019-09-08 12:54:58,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43482 to 42943. [2019-09-08 12:54:58,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42943 states. [2019-09-08 12:54:58,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42943 states to 42943 states and 67653 transitions. [2019-09-08 12:54:58,089 INFO L78 Accepts]: Start accepts. Automaton has 42943 states and 67653 transitions. Word has length 105 [2019-09-08 12:54:58,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:58,089 INFO L475 AbstractCegarLoop]: Abstraction has 42943 states and 67653 transitions. [2019-09-08 12:54:58,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:54:58,089 INFO L276 IsEmpty]: Start isEmpty. Operand 42943 states and 67653 transitions. [2019-09-08 12:54:58,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:54:58,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:58,093 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:54:58,093 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:58,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:58,093 INFO L82 PathProgramCache]: Analyzing trace with hash 451828384, now seen corresponding path program 1 times [2019-09-08 12:54:58,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:58,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:58,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:58,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:58,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:58,210 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 12:54:58,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:58,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:54:58,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:54:58,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:54:58,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:54:58,212 INFO L87 Difference]: Start difference. First operand 42943 states and 67653 transitions. Second operand 5 states. [2019-09-08 12:55:00,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:00,146 INFO L93 Difference]: Finished difference Result 52275 states and 82551 transitions. [2019-09-08 12:55:00,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:55:00,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-08 12:55:00,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:00,208 INFO L225 Difference]: With dead ends: 52275 [2019-09-08 12:55:00,208 INFO L226 Difference]: Without dead ends: 47113 [2019-09-08 12:55:00,224 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:55:00,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47113 states. [2019-09-08 12:55:02,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47113 to 45863. [2019-09-08 12:55:02,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45863 states. [2019-09-08 12:55:02,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45863 states to 45863 states and 72269 transitions. [2019-09-08 12:55:02,134 INFO L78 Accepts]: Start accepts. Automaton has 45863 states and 72269 transitions. Word has length 105 [2019-09-08 12:55:02,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:02,134 INFO L475 AbstractCegarLoop]: Abstraction has 45863 states and 72269 transitions. [2019-09-08 12:55:02,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:55:02,135 INFO L276 IsEmpty]: Start isEmpty. Operand 45863 states and 72269 transitions. [2019-09-08 12:55:02,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:55:02,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:02,138 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:55:02,138 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:02,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:02,139 INFO L82 PathProgramCache]: Analyzing trace with hash -2140593730, now seen corresponding path program 1 times [2019-09-08 12:55:02,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:02,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:02,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:02,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:02,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:02,234 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:55:02,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:55:02,236 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 12:55:02,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:02,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 12:55:02,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:55:02,539 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 12:55:02,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:55:02,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 12:55:02,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:55:02,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:55:02,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:55:02,555 INFO L87 Difference]: Start difference. First operand 45863 states and 72269 transitions. Second operand 8 states. [2019-09-08 12:55:08,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:08,337 INFO L93 Difference]: Finished difference Result 95528 states and 151475 transitions. [2019-09-08 12:55:08,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 12:55:08,338 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2019-09-08 12:55:08,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:08,693 INFO L225 Difference]: With dead ends: 95528 [2019-09-08 12:55:08,694 INFO L226 Difference]: Without dead ends: 74562 [2019-09-08 12:55:08,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:55:08,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74562 states. [2019-09-08 12:55:13,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74562 to 70816. [2019-09-08 12:55:13,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70816 states. [2019-09-08 12:55:13,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70816 states to 70816 states and 112007 transitions. [2019-09-08 12:55:13,383 INFO L78 Accepts]: Start accepts. Automaton has 70816 states and 112007 transitions. Word has length 105 [2019-09-08 12:55:13,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:13,384 INFO L475 AbstractCegarLoop]: Abstraction has 70816 states and 112007 transitions. [2019-09-08 12:55:13,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:55:13,384 INFO L276 IsEmpty]: Start isEmpty. Operand 70816 states and 112007 transitions. [2019-09-08 12:55:13,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:55:13,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:13,389 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:55:13,390 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:13,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:13,390 INFO L82 PathProgramCache]: Analyzing trace with hash 134984115, now seen corresponding path program 1 times [2019-09-08 12:55:13,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:13,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:13,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:13,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:13,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:13,469 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 12:55:13,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:13,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:55:13,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:55:13,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:55:13,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:55:13,471 INFO L87 Difference]: Start difference. First operand 70816 states and 112007 transitions. Second operand 3 states. [2019-09-08 12:55:19,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:19,575 INFO L93 Difference]: Finished difference Result 167583 states and 266182 transitions. [2019-09-08 12:55:19,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:55:19,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-08 12:55:19,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:19,832 INFO L225 Difference]: With dead ends: 167583 [2019-09-08 12:55:19,832 INFO L226 Difference]: Without dead ends: 121033 [2019-09-08 12:55:19,911 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:55:20,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121033 states. [2019-09-08 12:55:24,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121033 to 120759. [2019-09-08 12:55:24,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120759 states. [2019-09-08 12:55:25,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120759 states to 120759 states and 191248 transitions. [2019-09-08 12:55:25,120 INFO L78 Accepts]: Start accepts. Automaton has 120759 states and 191248 transitions. Word has length 106 [2019-09-08 12:55:25,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:25,121 INFO L475 AbstractCegarLoop]: Abstraction has 120759 states and 191248 transitions. [2019-09-08 12:55:25,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:55:25,121 INFO L276 IsEmpty]: Start isEmpty. Operand 120759 states and 191248 transitions. [2019-09-08 12:55:25,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:55:25,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:25,126 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:55:25,126 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:25,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:25,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1864454230, now seen corresponding path program 1 times [2019-09-08 12:55:25,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:25,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:25,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:25,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:25,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:25,196 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:55:25,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:25,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:55:25,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:55:25,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:55:25,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:55:25,198 INFO L87 Difference]: Start difference. First operand 120759 states and 191248 transitions. Second operand 3 states. [2019-09-08 12:55:36,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:36,810 INFO L93 Difference]: Finished difference Result 354771 states and 561331 transitions. [2019-09-08 12:55:36,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:55:36,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-08 12:55:36,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:37,172 INFO L225 Difference]: With dead ends: 354771 [2019-09-08 12:55:37,172 INFO L226 Difference]: Without dead ends: 234107 [2019-09-08 12:55:37,274 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:55:37,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234107 states. [2019-09-08 12:55:51,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234107 to 234105. [2019-09-08 12:55:51,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234105 states. [2019-09-08 12:55:52,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234105 states to 234105 states and 367877 transitions. [2019-09-08 12:55:52,203 INFO L78 Accepts]: Start accepts. Automaton has 234105 states and 367877 transitions. Word has length 107 [2019-09-08 12:55:52,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:52,203 INFO L475 AbstractCegarLoop]: Abstraction has 234105 states and 367877 transitions. [2019-09-08 12:55:52,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:55:52,204 INFO L276 IsEmpty]: Start isEmpty. Operand 234105 states and 367877 transitions. [2019-09-08 12:55:52,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:55:52,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:52,209 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, 1] [2019-09-08 12:55:52,209 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:52,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:52,210 INFO L82 PathProgramCache]: Analyzing trace with hash 720900890, now seen corresponding path program 1 times [2019-09-08 12:55:52,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:52,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:52,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:52,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:52,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:52,392 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 12:55:52,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:52,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:55:52,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:55:52,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:55:52,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:55:52,394 INFO L87 Difference]: Start difference. First operand 234105 states and 367877 transitions. Second operand 4 states. [2019-09-08 12:56:12,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:12,571 INFO L93 Difference]: Finished difference Result 498688 states and 787325 transitions. [2019-09-08 12:56:12,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:56:12,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-08 12:56:12,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:13,179 INFO L225 Difference]: With dead ends: 498688 [2019-09-08 12:56:13,179 INFO L226 Difference]: Without dead ends: 389368 [2019-09-08 12:56:13,292 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:56:13,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389368 states. [2019-09-08 12:56:39,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389368 to 344413. [2019-09-08 12:56:39,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344413 states. [2019-09-08 12:56:39,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344413 states to 344413 states and 541687 transitions. [2019-09-08 12:56:39,692 INFO L78 Accepts]: Start accepts. Automaton has 344413 states and 541687 transitions. Word has length 107 [2019-09-08 12:56:39,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:39,693 INFO L475 AbstractCegarLoop]: Abstraction has 344413 states and 541687 transitions. [2019-09-08 12:56:39,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:56:39,693 INFO L276 IsEmpty]: Start isEmpty. Operand 344413 states and 541687 transitions. [2019-09-08 12:56:39,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:56:39,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:39,697 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, 1] [2019-09-08 12:56:39,697 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:39,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:39,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1871521224, now seen corresponding path program 1 times [2019-09-08 12:56:39,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:39,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:39,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:39,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:39,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:39,774 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:56:39,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:39,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:56:39,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:56:39,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:56:39,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:56:39,775 INFO L87 Difference]: Start difference. First operand 344413 states and 541687 transitions. Second operand 3 states. [2019-09-08 12:56:58,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:58,532 INFO L93 Difference]: Finished difference Result 639783 states and 1006619 transitions. [2019-09-08 12:56:58,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:56:58,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-08 12:56:58,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:59,030 INFO L225 Difference]: With dead ends: 639783 [2019-09-08 12:56:59,030 INFO L226 Difference]: Without dead ends: 295543 [2019-09-08 12:56:59,262 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:56:59,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295543 states. [2019-09-08 12:57:21,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295543 to 295541. [2019-09-08 12:57:21,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295541 states. [2019-09-08 12:57:21,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295541 states to 295541 states and 462209 transitions. [2019-09-08 12:57:21,557 INFO L78 Accepts]: Start accepts. Automaton has 295541 states and 462209 transitions. Word has length 107 [2019-09-08 12:57:21,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:21,557 INFO L475 AbstractCegarLoop]: Abstraction has 295541 states and 462209 transitions. [2019-09-08 12:57:21,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:57:21,557 INFO L276 IsEmpty]: Start isEmpty. Operand 295541 states and 462209 transitions. [2019-09-08 12:57:21,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:57:21,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:21,559 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:21,559 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:21,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:21,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1819747193, now seen corresponding path program 1 times [2019-09-08 12:57:21,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:21,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:21,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:21,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:21,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:21,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 12:57:21,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:21,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:57:21,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:57:21,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:57:21,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:57:21,801 INFO L87 Difference]: Start difference. First operand 295541 states and 462209 transitions. Second operand 4 states. [2019-09-08 12:57:54,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:54,530 INFO L93 Difference]: Finished difference Result 713501 states and 1120164 transitions. [2019-09-08 12:57:54,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:57:54,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-08 12:57:54,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:56,131 INFO L225 Difference]: With dead ends: 713501 [2019-09-08 12:57:56,131 INFO L226 Difference]: Without dead ends: 541094 [2019-09-08 12:57:56,311 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:57:56,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541094 states. [2019-09-08 12:58:31,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541094 to 467666. [2019-09-08 12:58:31,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467666 states. [2019-09-08 12:58:32,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467666 states to 467666 states and 731478 transitions. [2019-09-08 12:58:32,822 INFO L78 Accepts]: Start accepts. Automaton has 467666 states and 731478 transitions. Word has length 108 [2019-09-08 12:58:32,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:32,822 INFO L475 AbstractCegarLoop]: Abstraction has 467666 states and 731478 transitions. [2019-09-08 12:58:32,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:58:32,823 INFO L276 IsEmpty]: Start isEmpty. Operand 467666 states and 731478 transitions. [2019-09-08 12:58:32,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:58:32,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:32,825 INFO L399 BasicCegarLoop]: trace histogram [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 12:58:32,825 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:32,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:32,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1697967367, now seen corresponding path program 1 times [2019-09-08 12:58:32,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:32,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:32,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:32,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:32,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:32,898 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:32,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:32,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:58:32,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:58:32,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:58:32,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:32,900 INFO L87 Difference]: Start difference. First operand 467666 states and 731478 transitions. Second operand 3 states. [2019-09-08 12:59:37,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:37,434 INFO L93 Difference]: Finished difference Result 1375482 states and 2148726 transitions. [2019-09-08 12:59:37,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:59:37,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-08 12:59:37,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:39,183 INFO L225 Difference]: With dead ends: 1375482 [2019-09-08 12:59:39,183 INFO L226 Difference]: Without dead ends: 907961 [2019-09-08 12:59:39,582 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:40,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907961 states. [2019-09-08 13:00:56,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907961 to 907959. [2019-09-08 13:00:56,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907959 states. [2019-09-08 13:00:58,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907959 states to 907959 states and 1408523 transitions. [2019-09-08 13:00:58,244 INFO L78 Accepts]: Start accepts. Automaton has 907959 states and 1408523 transitions. Word has length 108 [2019-09-08 13:00:58,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:00:58,244 INFO L475 AbstractCegarLoop]: Abstraction has 907959 states and 1408523 transitions. [2019-09-08 13:00:58,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:00:58,245 INFO L276 IsEmpty]: Start isEmpty. Operand 907959 states and 1408523 transitions. [2019-09-08 13:00:58,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 13:00:58,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:00:58,247 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:00:58,247 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:00:58,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:00:58,248 INFO L82 PathProgramCache]: Analyzing trace with hash -2063874521, now seen corresponding path program 1 times [2019-09-08 13:00:58,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:00:58,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:00:58,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:58,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:00:58,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:00:59,748 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 13:00:59,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:00:59,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:00:59,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:00:59,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:00:59,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:00:59,752 INFO L87 Difference]: Start difference. First operand 907959 states and 1408523 transitions. Second operand 3 states. [2019-09-08 13:02:42,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:02:42,335 INFO L93 Difference]: Finished difference Result 2248925 states and 3491719 transitions. [2019-09-08 13:02:42,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:02:42,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-08 13:02:42,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:02:44,924 INFO L225 Difference]: With dead ends: 2248925 [2019-09-08 13:02:44,925 INFO L226 Difference]: Without dead ends: 1341245 [2019-09-08 13:02:45,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:02:46,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341245 states. [2019-09-08 13:04:20,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341245 to 917155. [2019-09-08 13:04:20,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 917155 states. [2019-09-08 13:04:22,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917155 states to 917155 states and 1422311 transitions. [2019-09-08 13:04:22,552 INFO L78 Accepts]: Start accepts. Automaton has 917155 states and 1422311 transitions. Word has length 109 [2019-09-08 13:04:22,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:22,552 INFO L475 AbstractCegarLoop]: Abstraction has 917155 states and 1422311 transitions. [2019-09-08 13:04:22,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:04:22,552 INFO L276 IsEmpty]: Start isEmpty. Operand 917155 states and 1422311 transitions. [2019-09-08 13:04:22,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 13:04:22,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:22,555 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, 1, 1, 1] [2019-09-08 13:04:22,555 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:22,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:22,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1299926249, now seen corresponding path program 1 times [2019-09-08 13:04:22,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:22,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:22,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:22,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:22,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:22,619 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 13:04:22,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:22,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:04:22,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:04:22,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:04:22,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:22,621 INFO L87 Difference]: Start difference. First operand 917155 states and 1422311 transitions. Second operand 3 states.