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_lcr.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:39:25,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:39:25,485 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:39:25,502 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:39:25,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:39:25,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:39:25,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:39:25,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:39:25,519 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:39:25,522 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:39:25,524 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:39:25,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:39:25,526 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:39:25,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:39:25,530 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:39:25,532 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:39:25,533 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:39:25,535 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:39:25,536 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:39:25,541 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:39:25,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:39:25,546 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:39:25,549 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:39:25,550 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:39:25,552 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:39:25,552 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:39:25,552 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:39:25,554 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:39:25,555 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:39:25,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:39:25,557 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:39:25,558 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:39:25,559 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:39:25,560 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:39:25,562 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:39:25,562 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:39:25,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:39:25,563 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:39:25,563 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:39:25,564 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:39:25,564 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:39:25,566 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 11:39:25,601 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:39:25,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:39:25,602 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:39:25,602 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:39:25,603 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:39:25,603 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:39:25,603 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:39:25,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:39:25,607 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:39:25,607 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:39:25,609 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:39:25,609 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:39:25,610 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:39:25,610 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:39:25,610 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:39:25,610 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:39:25,610 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:39:25,611 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:39:25,611 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:39:25,611 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:39:25,611 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:39:25,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:39:25,611 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:39:25,612 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:39:25,612 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:39:25,614 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:39:25,614 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:39:25,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:39:25,615 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:39:25,659 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:39:25,672 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:39:25,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:39:25,677 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:39:25,677 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:39:25,678 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 11:39:25,741 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28cfd35d6/bab92c27cd0f4f7e85bff6e41a86a32d/FLAG20d47a0c1 [2019-09-08 11:39:26,228 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:39:26,228 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 11:39:26,249 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28cfd35d6/bab92c27cd0f4f7e85bff6e41a86a32d/FLAG20d47a0c1 [2019-09-08 11:39:26,540 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28cfd35d6/bab92c27cd0f4f7e85bff6e41a86a32d [2019-09-08 11:39:26,549 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:39:26,551 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:39:26,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:39:26,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:39:26,555 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:39:26,556 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:39:26" (1/1) ... [2019-09-08 11:39:26,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f4a006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:39:26, skipping insertion in model container [2019-09-08 11:39:26,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:39:26" (1/1) ... [2019-09-08 11:39:26,569 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:39:26,611 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:39:27,070 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:39:27,088 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:39:27,158 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:39:27,182 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:39:27,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:39:27 WrapperNode [2019-09-08 11:39:27,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:39:27,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:39:27,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:39:27,183 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:39:27,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:39:27" (1/1) ... [2019-09-08 11:39:27,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:39:27" (1/1) ... [2019-09-08 11:39:27,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:39:27" (1/1) ... [2019-09-08 11:39:27,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:39:27" (1/1) ... [2019-09-08 11:39:27,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:39:27" (1/1) ... [2019-09-08 11:39:27,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:39:27" (1/1) ... [2019-09-08 11:39:27,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:39:27" (1/1) ... [2019-09-08 11:39:27,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:39:27,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:39:27,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:39:27,233 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:39:27,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:39:27" (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 11:39:27,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:39:27,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:39:27,305 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:39:27,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:39:27,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:39:27,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:39:27,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 11:39:27,306 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:39:27,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:39:27,306 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:39:27,306 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:39:27,306 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:39:27,306 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:39:27,307 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:39:27,307 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:39:27,307 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:39:27,307 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:39:27,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:39:27,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:39:28,005 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:39:28,005 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:39:28,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:39:28 BoogieIcfgContainer [2019-09-08 11:39:28,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:39:28,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:39:28,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:39:28,012 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:39:28,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:39:26" (1/3) ... [2019-09-08 11:39:28,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@458c58ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:39:28, skipping insertion in model container [2019-09-08 11:39:28,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:39:27" (2/3) ... [2019-09-08 11:39:28,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@458c58ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:39:28, skipping insertion in model container [2019-09-08 11:39:28,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:39:28" (3/3) ... [2019-09-08 11:39:28,016 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 11:39:28,026 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:39:28,035 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-08 11:39:28,053 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-08 11:39:28,086 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:39:28,087 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:39:28,087 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:39:28,088 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:39:28,088 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:39:28,088 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:39:28,088 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:39:28,089 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:39:28,089 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:39:28,112 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2019-09-08 11:39:28,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-08 11:39:28,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:39:28,119 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] [2019-09-08 11:39:28,121 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:39:28,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:39:28,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1559662222, now seen corresponding path program 1 times [2019-09-08 11:39:28,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:39:28,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:39:28,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:28,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:39:28,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:39:28,504 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 11:39:28,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:39:28,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:39:28,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:39:28,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:39:28,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:39:28,524 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 3 states. [2019-09-08 11:39:28,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:39:28,653 INFO L93 Difference]: Finished difference Result 213 states and 340 transitions. [2019-09-08 11:39:28,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:39:28,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-09-08 11:39:28,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:39:28,669 INFO L225 Difference]: With dead ends: 213 [2019-09-08 11:39:28,669 INFO L226 Difference]: Without dead ends: 158 [2019-09-08 11:39:28,672 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 11:39:28,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-08 11:39:28,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2019-09-08 11:39:28,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-08 11:39:28,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 219 transitions. [2019-09-08 11:39:28,731 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 219 transitions. Word has length 51 [2019-09-08 11:39:28,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:39:28,732 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 219 transitions. [2019-09-08 11:39:28,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:39:28,733 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 219 transitions. [2019-09-08 11:39:28,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-08 11:39:28,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:39:28,736 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] [2019-09-08 11:39:28,736 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:39:28,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:39:28,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1275879745, now seen corresponding path program 1 times [2019-09-08 11:39:28,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:39:28,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:39:28,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:28,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:39:28,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:39:28,908 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 11:39:28,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:39:28,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:39:28,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:39:28,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:39:28,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:39:28,911 INFO L87 Difference]: Start difference. First operand 156 states and 219 transitions. Second operand 3 states. [2019-09-08 11:39:28,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:39:28,988 INFO L93 Difference]: Finished difference Result 284 states and 414 transitions. [2019-09-08 11:39:28,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:39:28,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-08 11:39:28,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:39:29,000 INFO L225 Difference]: With dead ends: 284 [2019-09-08 11:39:29,001 INFO L226 Difference]: Without dead ends: 201 [2019-09-08 11:39:29,005 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 11:39:29,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-08 11:39:29,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-09-08 11:39:29,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-08 11:39:29,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 284 transitions. [2019-09-08 11:39:29,031 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 284 transitions. Word has length 52 [2019-09-08 11:39:29,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:39:29,031 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 284 transitions. [2019-09-08 11:39:29,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:39:29,032 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 284 transitions. [2019-09-08 11:39:29,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-08 11:39:29,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:39:29,034 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] [2019-09-08 11:39:29,034 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:39:29,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:39:29,035 INFO L82 PathProgramCache]: Analyzing trace with hash 920769505, now seen corresponding path program 1 times [2019-09-08 11:39:29,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:39:29,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:39:29,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:29,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:39:29,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:39:29,144 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 11:39:29,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:39:29,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:39:29,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:39:29,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:39:29,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:39:29,146 INFO L87 Difference]: Start difference. First operand 199 states and 284 transitions. Second operand 5 states. [2019-09-08 11:39:29,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:39:29,343 INFO L93 Difference]: Finished difference Result 372 states and 541 transitions. [2019-09-08 11:39:29,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:39:29,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-09-08 11:39:29,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:39:29,349 INFO L225 Difference]: With dead ends: 372 [2019-09-08 11:39:29,350 INFO L226 Difference]: Without dead ends: 199 [2019-09-08 11:39:29,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:39:29,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-08 11:39:29,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-09-08 11:39:29,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-08 11:39:29,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 280 transitions. [2019-09-08 11:39:29,393 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 280 transitions. Word has length 53 [2019-09-08 11:39:29,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:39:29,394 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 280 transitions. [2019-09-08 11:39:29,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:39:29,399 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 280 transitions. [2019-09-08 11:39:29,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 11:39:29,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:39:29,401 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:39:29,402 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:39:29,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:39:29,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1424755381, now seen corresponding path program 1 times [2019-09-08 11:39:29,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:39:29,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:39:29,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:29,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:39:29,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:39:29,491 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 11:39:29,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:39:29,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:39:29,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:39:29,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:39:29,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:39:29,492 INFO L87 Difference]: Start difference. First operand 199 states and 280 transitions. Second operand 5 states. [2019-09-08 11:39:29,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:39:29,636 INFO L93 Difference]: Finished difference Result 364 states and 524 transitions. [2019-09-08 11:39:29,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:39:29,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-09-08 11:39:29,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:39:29,640 INFO L225 Difference]: With dead ends: 364 [2019-09-08 11:39:29,641 INFO L226 Difference]: Without dead ends: 199 [2019-09-08 11:39:29,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:39:29,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-08 11:39:29,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-09-08 11:39:29,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-08 11:39:29,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 276 transitions. [2019-09-08 11:39:29,681 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 276 transitions. Word has length 54 [2019-09-08 11:39:29,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:39:29,681 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 276 transitions. [2019-09-08 11:39:29,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:39:29,682 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 276 transitions. [2019-09-08 11:39:29,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 11:39:29,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:39:29,684 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] [2019-09-08 11:39:29,684 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:39:29,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:39:29,684 INFO L82 PathProgramCache]: Analyzing trace with hash 710908993, now seen corresponding path program 1 times [2019-09-08 11:39:29,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:39:29,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:39:29,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:29,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:39:29,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:39:29,791 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 11:39:29,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:39:29,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:39:29,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:39:29,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:39:29,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:39:29,794 INFO L87 Difference]: Start difference. First operand 199 states and 276 transitions. Second operand 5 states. [2019-09-08 11:39:29,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:39:29,951 INFO L93 Difference]: Finished difference Result 368 states and 521 transitions. [2019-09-08 11:39:29,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:39:29,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-08 11:39:29,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:39:29,953 INFO L225 Difference]: With dead ends: 368 [2019-09-08 11:39:29,953 INFO L226 Difference]: Without dead ends: 199 [2019-09-08 11:39:29,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:39:29,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-08 11:39:29,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-09-08 11:39:29,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-08 11:39:29,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 272 transitions. [2019-09-08 11:39:29,970 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 272 transitions. Word has length 55 [2019-09-08 11:39:29,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:39:29,971 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 272 transitions. [2019-09-08 11:39:29,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:39:29,971 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 272 transitions. [2019-09-08 11:39:29,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 11:39:29,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:39:29,972 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:39:29,973 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:39:29,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:39:29,973 INFO L82 PathProgramCache]: Analyzing trace with hash 885426054, now seen corresponding path program 1 times [2019-09-08 11:39:29,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:39:29,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:39:29,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:29,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:39:29,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:39:30,074 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 11:39:30,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:39:30,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:39:30,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:39:30,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:39:30,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:39:30,076 INFO L87 Difference]: Start difference. First operand 199 states and 272 transitions. Second operand 5 states. [2019-09-08 11:39:30,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:39:30,192 INFO L93 Difference]: Finished difference Result 616 states and 876 transitions. [2019-09-08 11:39:30,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:39:30,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-08 11:39:30,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:39:30,196 INFO L225 Difference]: With dead ends: 616 [2019-09-08 11:39:30,196 INFO L226 Difference]: Without dead ends: 495 [2019-09-08 11:39:30,197 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 11:39:30,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-09-08 11:39:30,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 292. [2019-09-08 11:39:30,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-09-08 11:39:30,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 409 transitions. [2019-09-08 11:39:30,226 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 409 transitions. Word has length 56 [2019-09-08 11:39:30,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:39:30,227 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 409 transitions. [2019-09-08 11:39:30,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:39:30,227 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 409 transitions. [2019-09-08 11:39:30,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 11:39:30,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:39:30,232 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:39:30,233 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:39:30,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:39:30,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1174705316, now seen corresponding path program 1 times [2019-09-08 11:39:30,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:39:30,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:39:30,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:30,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:39:30,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:39:30,365 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 11:39:30,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:39:30,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:39:30,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:39:30,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:39:30,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:39:30,367 INFO L87 Difference]: Start difference. First operand 292 states and 409 transitions. Second operand 5 states. [2019-09-08 11:39:30,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:39:30,504 INFO L93 Difference]: Finished difference Result 684 states and 975 transitions. [2019-09-08 11:39:30,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:39:30,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-08 11:39:30,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:39:30,510 INFO L225 Difference]: With dead ends: 684 [2019-09-08 11:39:30,511 INFO L226 Difference]: Without dead ends: 563 [2019-09-08 11:39:30,513 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 11:39:30,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-09-08 11:39:30,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 423. [2019-09-08 11:39:30,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-09-08 11:39:30,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 600 transitions. [2019-09-08 11:39:30,553 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 600 transitions. Word has length 56 [2019-09-08 11:39:30,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:39:30,554 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 600 transitions. [2019-09-08 11:39:30,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:39:30,555 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 600 transitions. [2019-09-08 11:39:30,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 11:39:30,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:39:30,557 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:39:30,558 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:39:30,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:39:30,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1012396963, now seen corresponding path program 1 times [2019-09-08 11:39:30,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:39:30,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:39:30,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:30,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:39:30,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:39:30,666 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 11:39:30,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:39:30,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:39:30,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:39:30,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:39:30,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:39:30,668 INFO L87 Difference]: Start difference. First operand 423 states and 600 transitions. Second operand 5 states. [2019-09-08 11:39:30,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:39:30,865 INFO L93 Difference]: Finished difference Result 787 states and 1127 transitions. [2019-09-08 11:39:30,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:39:30,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-08 11:39:30,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:39:30,870 INFO L225 Difference]: With dead ends: 787 [2019-09-08 11:39:30,870 INFO L226 Difference]: Without dead ends: 666 [2019-09-08 11:39:30,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:39:30,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-09-08 11:39:30,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 516. [2019-09-08 11:39:30,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-09-08 11:39:30,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 737 transitions. [2019-09-08 11:39:30,915 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 737 transitions. Word has length 56 [2019-09-08 11:39:30,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:39:30,916 INFO L475 AbstractCegarLoop]: Abstraction has 516 states and 737 transitions. [2019-09-08 11:39:30,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:39:30,916 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 737 transitions. [2019-09-08 11:39:30,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 11:39:30,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:39:30,917 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] [2019-09-08 11:39:30,917 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:39:30,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:39:30,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1507412779, now seen corresponding path program 1 times [2019-09-08 11:39:30,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:39:30,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:39:30,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:30,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:39:30,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:39:31,132 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 11:39:31,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:39:31,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:39:31,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:39:31,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:39:31,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:39:31,134 INFO L87 Difference]: Start difference. First operand 516 states and 737 transitions. Second operand 10 states. [2019-09-08 11:39:31,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:39:31,899 INFO L93 Difference]: Finished difference Result 1431 states and 2065 transitions. [2019-09-08 11:39:31,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:39:31,900 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-09-08 11:39:31,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:39:31,905 INFO L225 Difference]: With dead ends: 1431 [2019-09-08 11:39:31,906 INFO L226 Difference]: Without dead ends: 986 [2019-09-08 11:39:31,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 11:39:31,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2019-09-08 11:39:31,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 516. [2019-09-08 11:39:31,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-09-08 11:39:31,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 735 transitions. [2019-09-08 11:39:31,970 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 735 transitions. Word has length 57 [2019-09-08 11:39:31,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:39:31,971 INFO L475 AbstractCegarLoop]: Abstraction has 516 states and 735 transitions. [2019-09-08 11:39:31,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:39:31,971 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 735 transitions. [2019-09-08 11:39:31,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 11:39:31,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:39:31,972 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] [2019-09-08 11:39:31,972 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:39:31,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:39:31,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1490525900, now seen corresponding path program 1 times [2019-09-08 11:39:31,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:39:31,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:39:31,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:31,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:39:31,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:39:32,152 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 11:39:32,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:39:32,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:39:32,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:39:32,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:39:32,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:39:32,154 INFO L87 Difference]: Start difference. First operand 516 states and 735 transitions. Second operand 9 states. [2019-09-08 11:39:32,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:39:32,755 INFO L93 Difference]: Finished difference Result 1401 states and 2026 transitions. [2019-09-08 11:39:32,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 11:39:32,756 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-09-08 11:39:32,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:39:32,762 INFO L225 Difference]: With dead ends: 1401 [2019-09-08 11:39:32,762 INFO L226 Difference]: Without dead ends: 951 [2019-09-08 11:39:32,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-09-08 11:39:32,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-09-08 11:39:32,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 516. [2019-09-08 11:39:32,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-09-08 11:39:32,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 734 transitions. [2019-09-08 11:39:32,829 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 734 transitions. Word has length 57 [2019-09-08 11:39:32,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:39:32,830 INFO L475 AbstractCegarLoop]: Abstraction has 516 states and 734 transitions. [2019-09-08 11:39:32,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:39:32,830 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 734 transitions. [2019-09-08 11:39:32,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 11:39:32,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:39:32,831 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:39:32,831 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:39:32,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:39:32,832 INFO L82 PathProgramCache]: Analyzing trace with hash 640170611, now seen corresponding path program 1 times [2019-09-08 11:39:32,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:39:32,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:39:32,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:32,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:39:32,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:39:33,053 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 11:39:33,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:39:33,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:39:33,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:39:33,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:39:33,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:39:33,056 INFO L87 Difference]: Start difference. First operand 516 states and 734 transitions. Second operand 10 states. [2019-09-08 11:39:33,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:39:33,930 INFO L93 Difference]: Finished difference Result 1416 states and 2038 transitions. [2019-09-08 11:39:33,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:39:33,931 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-09-08 11:39:33,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:39:33,936 INFO L225 Difference]: With dead ends: 1416 [2019-09-08 11:39:33,937 INFO L226 Difference]: Without dead ends: 981 [2019-09-08 11:39:33,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-08 11:39:33,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2019-09-08 11:39:33,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 516. [2019-09-08 11:39:33,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-09-08 11:39:33,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 730 transitions. [2019-09-08 11:39:33,999 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 730 transitions. Word has length 58 [2019-09-08 11:39:33,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:39:33,999 INFO L475 AbstractCegarLoop]: Abstraction has 516 states and 730 transitions. [2019-09-08 11:39:34,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:39:34,000 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 730 transitions. [2019-09-08 11:39:34,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 11:39:34,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:39:34,001 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] [2019-09-08 11:39:34,001 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:39:34,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:39:34,001 INFO L82 PathProgramCache]: Analyzing trace with hash 783431871, now seen corresponding path program 1 times [2019-09-08 11:39:34,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:39:34,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:39:34,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:34,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:39:34,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:39:34,695 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 11:39:34,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:39:34,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 11:39:34,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 11:39:34,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 11:39:34,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:39:34,697 INFO L87 Difference]: Start difference. First operand 516 states and 730 transitions. Second operand 21 states. [2019-09-08 11:39:34,848 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-08 11:39:35,584 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-08 11:39:35,758 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-08 11:39:36,010 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-09-08 11:39:38,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:39:38,972 INFO L93 Difference]: Finished difference Result 3520 states and 5124 transitions. [2019-09-08 11:39:38,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 11:39:38,973 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 59 [2019-09-08 11:39:38,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:39:38,997 INFO L225 Difference]: With dead ends: 3520 [2019-09-08 11:39:38,997 INFO L226 Difference]: Without dead ends: 3302 [2019-09-08 11:39:39,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=306, Invalid=1416, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 11:39:39,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3302 states. [2019-09-08 11:39:39,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3302 to 531. [2019-09-08 11:39:39,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-09-08 11:39:39,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 749 transitions. [2019-09-08 11:39:39,165 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 749 transitions. Word has length 59 [2019-09-08 11:39:39,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:39:39,165 INFO L475 AbstractCegarLoop]: Abstraction has 531 states and 749 transitions. [2019-09-08 11:39:39,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 11:39:39,166 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 749 transitions. [2019-09-08 11:39:39,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 11:39:39,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:39:39,167 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] [2019-09-08 11:39:39,168 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:39:39,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:39:39,168 INFO L82 PathProgramCache]: Analyzing trace with hash 125988192, now seen corresponding path program 1 times [2019-09-08 11:39:39,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:39:39,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:39:39,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:39,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:39:39,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:39:39,784 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 11:39:39,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:39:39,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 11:39:39,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 11:39:39,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 11:39:39,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:39:39,786 INFO L87 Difference]: Start difference. First operand 531 states and 749 transitions. Second operand 21 states. [2019-09-08 11:39:39,939 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-08 11:39:40,599 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-08 11:39:40,776 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-08 11:39:41,010 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-09-08 11:39:43,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:39:43,146 INFO L93 Difference]: Finished difference Result 3083 states and 4485 transitions. [2019-09-08 11:39:43,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 11:39:43,147 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 59 [2019-09-08 11:39:43,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:39:43,161 INFO L225 Difference]: With dead ends: 3083 [2019-09-08 11:39:43,161 INFO L226 Difference]: Without dead ends: 2871 [2019-09-08 11:39:43,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=333, Invalid=1389, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 11:39:43,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2019-09-08 11:39:43,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 531. [2019-09-08 11:39:43,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-09-08 11:39:43,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 748 transitions. [2019-09-08 11:39:43,272 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 748 transitions. Word has length 59 [2019-09-08 11:39:43,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:39:43,273 INFO L475 AbstractCegarLoop]: Abstraction has 531 states and 748 transitions. [2019-09-08 11:39:43,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 11:39:43,273 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 748 transitions. [2019-09-08 11:39:43,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 11:39:43,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:39:43,274 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] [2019-09-08 11:39:43,274 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:39:43,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:39:43,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1854553764, now seen corresponding path program 1 times [2019-09-08 11:39:43,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:39:43,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:39:43,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:43,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:39:43,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:39:44,097 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 11:39:44,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:39:44,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 11:39:44,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 11:39:44,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 11:39:44,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-08 11:39:44,099 INFO L87 Difference]: Start difference. First operand 531 states and 748 transitions. Second operand 17 states. [2019-09-08 11:39:44,619 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-08 11:39:44,792 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-08 11:39:45,033 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2019-09-08 11:39:45,201 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-08 11:39:45,378 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-08 11:39:45,607 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-08 11:39:45,748 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-08 11:39:45,913 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-08 11:39:47,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:39:47,080 INFO L93 Difference]: Finished difference Result 2238 states and 3243 transitions. [2019-09-08 11:39:47,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 11:39:47,081 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2019-09-08 11:39:47,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:39:47,090 INFO L225 Difference]: With dead ends: 2238 [2019-09-08 11:39:47,090 INFO L226 Difference]: Without dead ends: 2010 [2019-09-08 11:39:47,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=240, Invalid=752, Unknown=0, NotChecked=0, Total=992 [2019-09-08 11:39:47,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2010 states. [2019-09-08 11:39:47,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2010 to 526. [2019-09-08 11:39:47,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2019-09-08 11:39:47,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 739 transitions. [2019-09-08 11:39:47,211 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 739 transitions. Word has length 59 [2019-09-08 11:39:47,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:39:47,211 INFO L475 AbstractCegarLoop]: Abstraction has 526 states and 739 transitions. [2019-09-08 11:39:47,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 11:39:47,211 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 739 transitions. [2019-09-08 11:39:47,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 11:39:47,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:39:47,212 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:39:47,212 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:39:47,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:39:47,213 INFO L82 PathProgramCache]: Analyzing trace with hash -573041072, now seen corresponding path program 1 times [2019-09-08 11:39:47,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:39:47,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:39:47,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:47,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:39:47,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:39:47,732 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 11:39:47,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:39:47,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 11:39:47,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 11:39:47,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 11:39:47,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-09-08 11:39:47,734 INFO L87 Difference]: Start difference. First operand 526 states and 739 transitions. Second operand 14 states. [2019-09-08 11:39:48,260 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-09-08 11:39:48,470 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-08 11:39:48,675 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-08 11:39:48,840 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-08 11:39:48,985 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-08 11:39:49,175 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-09-08 11:39:49,540 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2019-09-08 11:39:49,692 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-08 11:39:50,232 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-08 11:39:50,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:39:50,731 INFO L93 Difference]: Finished difference Result 2824 states and 4119 transitions. [2019-09-08 11:39:50,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 11:39:50,731 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-09-08 11:39:50,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:39:50,742 INFO L225 Difference]: With dead ends: 2824 [2019-09-08 11:39:50,742 INFO L226 Difference]: Without dead ends: 2596 [2019-09-08 11:39:50,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=213, Invalid=717, Unknown=0, NotChecked=0, Total=930 [2019-09-08 11:39:50,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2596 states. [2019-09-08 11:39:50,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2596 to 509. [2019-09-08 11:39:50,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-09-08 11:39:50,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 717 transitions. [2019-09-08 11:39:50,881 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 717 transitions. Word has length 60 [2019-09-08 11:39:50,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:39:50,881 INFO L475 AbstractCegarLoop]: Abstraction has 509 states and 717 transitions. [2019-09-08 11:39:50,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 11:39:50,882 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 717 transitions. [2019-09-08 11:39:50,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 11:39:50,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:39:50,883 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:39:50,883 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:39:50,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:39:50,883 INFO L82 PathProgramCache]: Analyzing trace with hash -2089882996, now seen corresponding path program 1 times [2019-09-08 11:39:50,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:39:50,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:39:50,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:50,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:39:50,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:39:51,731 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 11:39:51,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:39:51,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 11:39:51,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 11:39:51,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 11:39:51,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2019-09-08 11:39:51,733 INFO L87 Difference]: Start difference. First operand 509 states and 717 transitions. Second operand 19 states. [2019-09-08 11:39:52,509 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 11:39:52,723 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-08 11:39:53,340 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-08 11:39:55,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:39:55,451 INFO L93 Difference]: Finished difference Result 3419 states and 5000 transitions. [2019-09-08 11:39:55,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 11:39:55,451 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2019-09-08 11:39:55,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:39:55,461 INFO L225 Difference]: With dead ends: 3419 [2019-09-08 11:39:55,461 INFO L226 Difference]: Without dead ends: 3201 [2019-09-08 11:39:55,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=299, Invalid=1261, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 11:39:55,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3201 states. [2019-09-08 11:39:55,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3201 to 503. [2019-09-08 11:39:55,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-09-08 11:39:55,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 708 transitions. [2019-09-08 11:39:55,648 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 708 transitions. Word has length 60 [2019-09-08 11:39:55,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:39:55,648 INFO L475 AbstractCegarLoop]: Abstraction has 503 states and 708 transitions. [2019-09-08 11:39:55,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 11:39:55,648 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 708 transitions. [2019-09-08 11:39:55,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 11:39:55,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:39:55,649 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:39:55,649 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:39:55,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:39:55,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1529221616, now seen corresponding path program 1 times [2019-09-08 11:39:55,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:39:55,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:39:55,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:55,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:39:55,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:39:56,758 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 11:39:56,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:39:56,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 11:39:56,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 11:39:56,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 11:39:56,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:39:56,760 INFO L87 Difference]: Start difference. First operand 503 states and 708 transitions. Second operand 20 states. [2019-09-08 11:39:57,410 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-08 11:39:57,574 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 11:39:57,748 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-08 11:39:58,024 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-09-08 11:39:58,213 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-08 11:39:58,395 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-08 11:39:58,682 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-08 11:39:58,879 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-08 11:39:59,057 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-08 11:39:59,251 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-08 11:39:59,569 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-08 11:40:00,782 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-09-08 11:40:02,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:40:02,357 INFO L93 Difference]: Finished difference Result 4012 states and 5876 transitions. [2019-09-08 11:40:02,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 11:40:02,357 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2019-09-08 11:40:02,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:40:02,370 INFO L225 Difference]: With dead ends: 4012 [2019-09-08 11:40:02,370 INFO L226 Difference]: Without dead ends: 3800 [2019-09-08 11:40:02,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=366, Invalid=1356, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 11:40:02,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3800 states. [2019-09-08 11:40:02,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3800 to 503. [2019-09-08 11:40:02,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-09-08 11:40:02,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 707 transitions. [2019-09-08 11:40:02,530 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 707 transitions. Word has length 60 [2019-09-08 11:40:02,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:40:02,530 INFO L475 AbstractCegarLoop]: Abstraction has 503 states and 707 transitions. [2019-09-08 11:40:02,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 11:40:02,530 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 707 transitions. [2019-09-08 11:40:02,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 11:40:02,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:40:02,531 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:40:02,531 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:40:02,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:40:02,532 INFO L82 PathProgramCache]: Analyzing trace with hash 464532363, now seen corresponding path program 1 times [2019-09-08 11:40:02,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:40:02,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:40:02,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:40:02,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:40:02,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:40:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:40:02,976 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 11:40:02,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:40:02,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 11:40:02,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 11:40:02,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 11:40:02,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 11:40:02,978 INFO L87 Difference]: Start difference. First operand 503 states and 707 transitions. Second operand 13 states. [2019-09-08 11:40:03,390 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2019-09-08 11:40:03,555 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-08 11:40:03,719 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-08 11:40:04,026 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-09-08 11:40:04,262 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-09-08 11:40:05,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:40:05,032 INFO L93 Difference]: Finished difference Result 1956 states and 2845 transitions. [2019-09-08 11:40:05,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:40:05,033 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-09-08 11:40:05,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:40:05,039 INFO L225 Difference]: With dead ends: 1956 [2019-09-08 11:40:05,039 INFO L226 Difference]: Without dead ends: 1744 [2019-09-08 11:40:05,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:40:05,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2019-09-08 11:40:05,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 488. [2019-09-08 11:40:05,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-08 11:40:05,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 688 transitions. [2019-09-08 11:40:05,184 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 688 transitions. Word has length 60 [2019-09-08 11:40:05,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:40:05,184 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 688 transitions. [2019-09-08 11:40:05,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 11:40:05,184 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 688 transitions. [2019-09-08 11:40:05,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 11:40:05,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:40:05,185 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:40:05,185 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:40:05,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:40:05,186 INFO L82 PathProgramCache]: Analyzing trace with hash -22477888, now seen corresponding path program 1 times [2019-09-08 11:40:05,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:40:05,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:40:05,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:40:05,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:40:05,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:40:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:40:06,054 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 11:40:06,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:40:06,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 11:40:06,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 11:40:06,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 11:40:06,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-09-08 11:40:06,056 INFO L87 Difference]: Start difference. First operand 488 states and 688 transitions. Second operand 17 states. [2019-09-08 11:40:06,834 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-09-08 11:40:07,041 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-08 11:40:07,191 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-08 11:40:07,345 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-08 11:40:07,479 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-09-08 11:40:07,620 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-08 11:40:07,794 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-08 11:40:09,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:40:09,860 INFO L93 Difference]: Finished difference Result 2367 states and 3452 transitions. [2019-09-08 11:40:09,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 11:40:09,861 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2019-09-08 11:40:09,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:40:09,867 INFO L225 Difference]: With dead ends: 2367 [2019-09-08 11:40:09,868 INFO L226 Difference]: Without dead ends: 2145 [2019-09-08 11:40:09,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=323, Invalid=937, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 11:40:09,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2019-09-08 11:40:10,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 469. [2019-09-08 11:40:10,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-09-08 11:40:10,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 668 transitions. [2019-09-08 11:40:10,034 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 668 transitions. Word has length 61 [2019-09-08 11:40:10,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:40:10,034 INFO L475 AbstractCegarLoop]: Abstraction has 469 states and 668 transitions. [2019-09-08 11:40:10,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 11:40:10,034 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 668 transitions. [2019-09-08 11:40:10,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 11:40:10,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:40:10,035 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] [2019-09-08 11:40:10,035 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:40:10,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:40:10,036 INFO L82 PathProgramCache]: Analyzing trace with hash 161317224, now seen corresponding path program 1 times [2019-09-08 11:40:10,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:40:10,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:40:10,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:40:10,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:40:10,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:40:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:40:10,079 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 11:40:10,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:40:10,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:40:10,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:40:10,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:40:10,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:40:10,081 INFO L87 Difference]: Start difference. First operand 469 states and 668 transitions. Second operand 3 states. [2019-09-08 11:40:10,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:40:10,494 INFO L93 Difference]: Finished difference Result 1223 states and 1772 transitions. [2019-09-08 11:40:10,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:40:10,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-08 11:40:10,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:40:10,497 INFO L225 Difference]: With dead ends: 1223 [2019-09-08 11:40:10,497 INFO L226 Difference]: Without dead ends: 815 [2019-09-08 11:40:10,499 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 11:40:10,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2019-09-08 11:40:10,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 803. [2019-09-08 11:40:10,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2019-09-08 11:40:10,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1133 transitions. [2019-09-08 11:40:10,790 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1133 transitions. Word has length 79 [2019-09-08 11:40:10,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:40:10,791 INFO L475 AbstractCegarLoop]: Abstraction has 803 states and 1133 transitions. [2019-09-08 11:40:10,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:40:10,791 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1133 transitions. [2019-09-08 11:40:10,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 11:40:10,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:40:10,792 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 11:40:10,793 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:40:10,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:40:10,793 INFO L82 PathProgramCache]: Analyzing trace with hash 954765304, now seen corresponding path program 1 times [2019-09-08 11:40:10,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:40:10,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:40:10,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:40:10,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:40:10,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:40:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:40:10,830 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 11:40:10,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:40:10,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:40:10,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:40:10,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:40:10,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:40:10,832 INFO L87 Difference]: Start difference. First operand 803 states and 1133 transitions. Second operand 3 states. [2019-09-08 11:40:11,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:40:11,284 INFO L93 Difference]: Finished difference Result 1796 states and 2566 transitions. [2019-09-08 11:40:11,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:40:11,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-08 11:40:11,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:40:11,287 INFO L225 Difference]: With dead ends: 1796 [2019-09-08 11:40:11,287 INFO L226 Difference]: Without dead ends: 1054 [2019-09-08 11:40:11,288 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 11:40:11,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2019-09-08 11:40:11,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1041. [2019-09-08 11:40:11,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2019-09-08 11:40:11,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1466 transitions. [2019-09-08 11:40:11,643 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1466 transitions. Word has length 80 [2019-09-08 11:40:11,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:40:11,643 INFO L475 AbstractCegarLoop]: Abstraction has 1041 states and 1466 transitions. [2019-09-08 11:40:11,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:40:11,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1466 transitions. [2019-09-08 11:40:11,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 11:40:11,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:40:11,644 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 11:40:11,645 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:40:11,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:40:11,645 INFO L82 PathProgramCache]: Analyzing trace with hash 271546837, now seen corresponding path program 1 times [2019-09-08 11:40:11,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:40:11,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:40:11,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:40:11,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:40:11,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:40:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:40:11,714 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 11:40:11,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:40:11,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:40:11,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:40:11,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:40:11,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:40:11,716 INFO L87 Difference]: Start difference. First operand 1041 states and 1466 transitions. Second operand 6 states. [2019-09-08 11:40:12,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:40:12,421 INFO L93 Difference]: Finished difference Result 1753 states and 2460 transitions. [2019-09-08 11:40:12,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:40:12,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-09-08 11:40:12,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:40:12,426 INFO L225 Difference]: With dead ends: 1753 [2019-09-08 11:40:12,427 INFO L226 Difference]: Without dead ends: 1751 [2019-09-08 11:40:12,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:40:12,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1751 states. [2019-09-08 11:40:12,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1751 to 1053. [2019-09-08 11:40:12,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2019-09-08 11:40:12,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1473 transitions. [2019-09-08 11:40:12,792 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1473 transitions. Word has length 80 [2019-09-08 11:40:12,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:40:12,792 INFO L475 AbstractCegarLoop]: Abstraction has 1053 states and 1473 transitions. [2019-09-08 11:40:12,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:40:12,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1473 transitions. [2019-09-08 11:40:12,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 11:40:12,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:40:12,794 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 11:40:12,794 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:40:12,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:40:12,794 INFO L82 PathProgramCache]: Analyzing trace with hash -109706295, now seen corresponding path program 1 times [2019-09-08 11:40:12,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:40:12,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:40:12,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:40:12,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:40:12,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:40:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:40:12,838 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 11:40:12,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:40:12,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:40:12,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:40:12,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:40:12,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:40:12,841 INFO L87 Difference]: Start difference. First operand 1053 states and 1473 transitions. Second operand 3 states. [2019-09-08 11:40:13,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:40:13,491 INFO L93 Difference]: Finished difference Result 2917 states and 4081 transitions. [2019-09-08 11:40:13,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:40:13,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-08 11:40:13,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:40:13,495 INFO L225 Difference]: With dead ends: 2917 [2019-09-08 11:40:13,495 INFO L226 Difference]: Without dead ends: 1925 [2019-09-08 11:40:13,497 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 11:40:13,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2019-09-08 11:40:14,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1803. [2019-09-08 11:40:14,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2019-09-08 11:40:14,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2491 transitions. [2019-09-08 11:40:14,143 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2491 transitions. Word has length 81 [2019-09-08 11:40:14,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:40:14,143 INFO L475 AbstractCegarLoop]: Abstraction has 1803 states and 2491 transitions. [2019-09-08 11:40:14,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:40:14,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2491 transitions. [2019-09-08 11:40:14,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 11:40:14,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:40:14,144 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, 1] [2019-09-08 11:40:14,145 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:40:14,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:40:14,145 INFO L82 PathProgramCache]: Analyzing trace with hash -291437512, now seen corresponding path program 1 times [2019-09-08 11:40:14,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:40:14,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:40:14,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:40:14,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:40:14,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:40:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:40:14,194 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 11:40:14,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:40:14,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:40:14,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:40:14,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:40:14,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:40:14,195 INFO L87 Difference]: Start difference. First operand 1803 states and 2491 transitions. Second operand 3 states. [2019-09-08 11:40:16,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:40:16,008 INFO L93 Difference]: Finished difference Result 5047 states and 6925 transitions. [2019-09-08 11:40:16,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:40:16,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-08 11:40:16,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:40:16,015 INFO L225 Difference]: With dead ends: 5047 [2019-09-08 11:40:16,015 INFO L226 Difference]: Without dead ends: 3305 [2019-09-08 11:40:16,019 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 11:40:16,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3305 states. [2019-09-08 11:40:17,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3305 to 3063. [2019-09-08 11:40:17,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3063 states. [2019-09-08 11:40:17,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 3063 states and 4137 transitions. [2019-09-08 11:40:17,167 INFO L78 Accepts]: Start accepts. Automaton has 3063 states and 4137 transitions. Word has length 82 [2019-09-08 11:40:17,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:40:17,167 INFO L475 AbstractCegarLoop]: Abstraction has 3063 states and 4137 transitions. [2019-09-08 11:40:17,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:40:17,167 INFO L276 IsEmpty]: Start isEmpty. Operand 3063 states and 4137 transitions. [2019-09-08 11:40:17,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:40:17,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:40:17,168 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:40:17,168 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:40:17,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:40:17,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1434685438, now seen corresponding path program 1 times [2019-09-08 11:40:17,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:40:17,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:40:17,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:40:17,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:40:17,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:40:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:40:17,221 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 11:40:17,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:40:17,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:40:17,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:40:17,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:40:17,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:40:17,222 INFO L87 Difference]: Start difference. First operand 3063 states and 4137 transitions. Second operand 3 states. [2019-09-08 11:40:18,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:40:18,673 INFO L93 Difference]: Finished difference Result 6987 states and 9399 transitions. [2019-09-08 11:40:18,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:40:18,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-08 11:40:18,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:40:18,683 INFO L225 Difference]: With dead ends: 6987 [2019-09-08 11:40:18,684 INFO L226 Difference]: Without dead ends: 3985 [2019-09-08 11:40:18,690 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 11:40:18,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states. [2019-09-08 11:40:20,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 3679. [2019-09-08 11:40:20,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3679 states. [2019-09-08 11:40:20,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3679 states to 3679 states and 4869 transitions. [2019-09-08 11:40:20,107 INFO L78 Accepts]: Start accepts. Automaton has 3679 states and 4869 transitions. Word has length 83 [2019-09-08 11:40:20,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:40:20,107 INFO L475 AbstractCegarLoop]: Abstraction has 3679 states and 4869 transitions. [2019-09-08 11:40:20,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:40:20,107 INFO L276 IsEmpty]: Start isEmpty. Operand 3679 states and 4869 transitions. [2019-09-08 11:40:20,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 11:40:20,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:40:20,109 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:40:20,109 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:40:20,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:40:20,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1887526267, now seen corresponding path program 1 times [2019-09-08 11:40:20,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:40:20,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:40:20,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:40:20,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:40:20,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:40:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:40:20,354 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:40:20,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:40:20,354 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 11:40:20,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:40:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:40:20,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 11:40:20,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:40:20,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:40:21,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:40:21,287 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-08 11:40:21,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:40:21,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2019-09-08 11:40:21,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 11:40:21,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 11:40:21,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:40:21,296 INFO L87 Difference]: Start difference. First operand 3679 states and 4869 transitions. Second operand 20 states. [2019-09-08 11:40:21,823 WARN L188 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-08 11:40:22,346 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 11:40:22,836 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-08 11:40:23,472 WARN L188 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-08 11:40:23,955 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-09-08 11:40:24,265 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-08 11:40:24,569 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-09-08 11:40:24,839 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-08 11:40:25,266 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-08 11:40:25,668 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-08 11:40:25,895 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-08 11:40:26,176 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-08 11:40:26,486 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-09-08 11:40:26,734 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-08 11:40:27,238 WARN L188 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-08 11:40:27,539 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-08 11:40:27,843 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-08 11:40:28,099 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-08 11:40:28,517 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-08 11:40:28,746 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-08 11:40:29,698 WARN L188 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-08 11:40:30,190 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2019-09-08 11:40:30,568 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-08 11:40:30,869 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-08 11:40:31,321 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-08 11:40:31,600 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-09-08 11:40:31,867 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-08 11:40:32,126 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-08 11:40:32,506 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-08 11:40:32,821 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-08 11:40:33,110 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-08 11:40:33,515 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-08 11:40:33,743 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-08 11:40:33,999 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-08 11:40:34,373 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-08 11:40:34,696 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-08 11:40:35,083 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-08 11:40:35,317 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-08 11:40:35,697 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 87 [2019-09-08 11:40:36,109 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-08 11:40:36,377 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-09-08 11:40:36,709 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2019-09-08 11:40:37,227 WARN L188 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2019-09-08 11:40:37,516 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-08 11:40:37,922 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-08 11:40:38,208 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-08 11:40:38,491 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-08 11:40:38,976 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-09-08 11:40:39,355 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-08 11:40:39,836 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-09-08 11:40:40,250 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 87 [2019-09-08 11:40:40,646 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2019-09-08 11:40:41,002 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-08 11:40:41,362 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-08 11:40:41,672 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-09-08 11:40:42,032 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-08 11:40:42,265 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-08 11:40:42,736 WARN L188 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-08 11:40:43,284 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-08 11:40:43,547 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-08 11:40:43,866 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-08 11:40:44,093 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-09-08 11:40:44,739 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2019-09-08 11:40:45,028 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-08 11:40:45,493 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-08 11:40:45,826 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-09-08 11:40:46,392 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-09-08 11:40:46,684 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-09-08 11:40:47,010 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-08 11:40:47,316 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-08 11:40:47,990 WARN L188 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 82 [2019-09-08 11:40:48,342 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 82 [2019-09-08 11:40:48,904 WARN L188 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-09-08 11:40:49,255 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-08 11:40:49,546 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-08 11:40:50,015 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-08 11:40:50,302 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-08 11:40:50,712 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-08 11:40:51,108 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-08 11:40:51,563 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-08 11:40:51,915 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-08 11:40:52,274 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 82 [2019-09-08 11:40:52,765 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 82 [2019-09-08 11:40:53,178 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-09-08 11:40:53,523 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-09-08 11:40:53,925 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-08 11:40:54,617 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-08 11:40:55,036 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 91 [2019-09-08 11:40:55,407 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-09-08 11:40:55,821 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 91 [2019-09-08 11:40:56,120 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-08 11:40:56,416 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-08 11:40:56,944 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-09-08 11:40:57,284 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-09-08 11:40:57,614 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-09-08 11:40:58,035 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-09-08 11:40:58,328 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-08 11:40:58,754 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-08 11:40:59,195 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-08 11:40:59,577 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-08 11:41:00,062 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-08 11:41:00,564 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-08 11:41:01,045 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-08 11:41:01,384 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-08 11:41:01,797 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-09-08 11:41:02,149 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 87 [2019-09-08 11:41:02,620 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-09-08 11:41:02,906 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-08 11:41:03,237 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-09-08 11:41:03,617 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-08 11:41:03,970 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-08 11:41:04,498 WARN L188 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2019-09-08 11:41:04,888 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-09-08 11:41:05,317 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2019-09-08 11:41:05,596 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-08 11:41:05,907 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-09-08 11:41:06,306 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-08 11:41:06,710 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-09-08 11:41:07,139 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-08 11:41:07,396 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-08 11:41:07,912 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-08 11:41:08,242 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-08 11:41:08,544 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-08 11:41:08,878 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-08 11:41:09,292 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-09-08 11:41:09,812 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2019-09-08 11:41:10,185 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2019-09-08 11:41:10,709 WARN L188 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2019-09-08 11:41:11,044 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-08 11:41:11,323 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-08 11:41:11,879 WARN L188 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2019-09-08 11:41:12,233 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2019-09-08 11:41:12,630 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-08 11:41:12,923 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-08 11:41:13,511 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-08 11:41:13,840 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-09-08 11:41:14,155 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-09-08 11:41:14,458 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-09-08 11:41:14,802 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-09-08 11:41:15,118 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-09-08 11:41:15,508 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2019-09-08 11:41:15,843 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-09-08 11:41:16,161 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-08 11:41:16,504 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-08 11:41:16,946 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-08 11:41:17,265 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-08 11:41:17,562 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-08 11:41:17,994 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-08 11:41:18,334 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-08 11:41:18,773 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-08 11:41:19,132 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 85 [2019-09-08 11:41:19,467 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-08 11:41:19,858 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-09-08 11:41:20,229 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-09-08 11:41:20,686 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 84 [2019-09-08 11:41:21,083 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-09-08 11:41:21,487 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 84 [2019-09-08 11:41:21,863 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-08 11:41:22,251 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-08 11:41:22,585 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-08 11:41:22,890 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-09-08 11:41:23,277 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2019-09-08 11:41:23,768 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-09-08 11:41:24,065 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-08 11:41:24,408 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-09-08 11:41:24,721 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-08 11:41:25,212 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-08 11:41:25,625 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-08 11:41:26,064 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-08 11:41:26,399 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2019-09-08 11:41:26,731 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 79 [2019-09-08 11:41:27,159 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-08 11:41:27,553 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-08 11:41:27,921 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-09-08 11:41:28,243 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-08 11:41:29,011 WARN L188 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-08 11:41:29,312 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-08 11:41:29,687 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-09-08 11:41:30,194 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-08 11:41:30,527 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-08 11:41:30,810 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-08 11:41:31,138 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-08 11:41:31,821 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-08 11:41:33,778 WARN L188 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-08 11:41:34,199 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-09-08 11:41:35,072 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-08 11:41:35,473 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-08 11:41:35,901 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-08 11:41:36,282 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-08 11:41:36,548 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-09-08 11:41:36,878 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-08 11:41:37,258 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-09-08 11:41:38,161 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-09-08 11:41:38,503 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-09-08 11:41:38,904 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 87 [2019-09-08 11:41:40,915 WARN L188 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-09-08 11:41:41,502 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-08 11:41:41,882 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2019-09-08 11:41:42,189 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-08 11:41:42,642 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-09-08 11:41:43,089 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-08 11:41:43,353 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-09-08 11:41:43,854 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2019-09-08 11:41:44,139 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-08 11:41:44,641 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 85 [2019-09-08 11:41:45,042 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 92 [2019-09-08 11:41:45,511 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-08 11:41:45,810 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-08 11:41:46,299 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2019-09-08 11:41:46,576 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-08 11:41:47,042 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-08 11:41:47,310 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-08 11:41:47,734 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-08 11:41:48,021 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-08 11:41:48,330 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-09-08 11:41:48,679 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-09-08 11:41:49,032 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-08 11:41:49,371 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-09-08 11:41:49,801 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2019-09-08 11:41:50,279 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 82 [2019-09-08 11:41:50,711 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 90 [2019-09-08 11:41:51,070 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-09-08 11:41:51,509 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-08 11:41:51,937 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-09-08 11:41:52,246 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-09-08 11:41:52,625 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2019-09-08 11:41:52,958 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-08 11:41:53,345 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-08 11:41:53,621 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-09-08 11:41:53,947 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-08 11:41:54,243 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-09-08 11:41:54,855 WARN L188 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 72 [2019-09-08 11:41:55,295 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-09-08 11:41:55,848 WARN L188 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2019-09-08 11:41:56,310 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2019-09-08 11:41:56,751 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-08 11:41:57,270 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2019-09-08 11:41:58,936 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-08 11:41:59,907 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2019-09-08 11:42:24,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:42:24,995 INFO L93 Difference]: Finished difference Result 68597 states and 88579 transitions. [2019-09-08 11:42:24,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2019-09-08 11:42:24,996 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 104 [2019-09-08 11:42:24,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:42:25,146 INFO L225 Difference]: With dead ends: 68597 [2019-09-08 11:42:25,146 INFO L226 Difference]: Without dead ends: 64979 [2019-09-08 11:42:25,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28486 ImplicationChecksByTransitivity, 85.2s TimeCoverageRelationStatistics Valid=9268, Invalid=59114, Unknown=0, NotChecked=0, Total=68382 [2019-09-08 11:42:25,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64979 states. [2019-09-08 11:42:34,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64979 to 19544. [2019-09-08 11:42:34,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19544 states. [2019-09-08 11:42:34,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19544 states to 19544 states and 25711 transitions. [2019-09-08 11:42:34,862 INFO L78 Accepts]: Start accepts. Automaton has 19544 states and 25711 transitions. Word has length 104 [2019-09-08 11:42:34,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:42:34,863 INFO L475 AbstractCegarLoop]: Abstraction has 19544 states and 25711 transitions. [2019-09-08 11:42:34,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 11:42:34,863 INFO L276 IsEmpty]: Start isEmpty. Operand 19544 states and 25711 transitions. [2019-09-08 11:42:34,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 11:42:34,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:42:34,868 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] [2019-09-08 11:42:34,869 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:42:34,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:42:34,869 INFO L82 PathProgramCache]: Analyzing trace with hash -2056347745, now seen corresponding path program 1 times [2019-09-08 11:42:34,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:42:34,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:42:34,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:34,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:42:34,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:42:34,940 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 11:42:34,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:42:34,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:42:34,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:42:34,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:42:34,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:42:34,942 INFO L87 Difference]: Start difference. First operand 19544 states and 25711 transitions. Second operand 3 states. [2019-09-08 11:42:43,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:42:43,782 INFO L93 Difference]: Finished difference Result 37504 states and 49338 transitions. [2019-09-08 11:42:43,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:42:43,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-08 11:42:43,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:42:43,820 INFO L225 Difference]: With dead ends: 37504 [2019-09-08 11:42:43,820 INFO L226 Difference]: Without dead ends: 18049 [2019-09-08 11:42:43,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:42:43,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18049 states. [2019-09-08 11:42:52,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18049 to 17967. [2019-09-08 11:42:52,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17967 states. [2019-09-08 11:42:52,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17967 states to 17967 states and 23117 transitions. [2019-09-08 11:42:52,970 INFO L78 Accepts]: Start accepts. Automaton has 17967 states and 23117 transitions. Word has length 104 [2019-09-08 11:42:52,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:42:52,970 INFO L475 AbstractCegarLoop]: Abstraction has 17967 states and 23117 transitions. [2019-09-08 11:42:52,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:42:52,970 INFO L276 IsEmpty]: Start isEmpty. Operand 17967 states and 23117 transitions. [2019-09-08 11:42:52,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 11:42:52,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:42:52,974 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:42:52,974 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:42:52,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:42:52,975 INFO L82 PathProgramCache]: Analyzing trace with hash -2017194729, now seen corresponding path program 1 times [2019-09-08 11:42:52,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:42:52,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:42:52,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:52,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:42:52,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:42:53,342 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:42:53,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:42:53,342 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:42:53,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:42:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:42:53,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 11:42:53,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:42:53,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:42:53,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:42:53,994 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:42:53,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:42:53,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-09-08 11:42:53,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 11:42:54,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 11:42:54,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:42:54,000 INFO L87 Difference]: Start difference. First operand 17967 states and 23117 transitions. Second operand 20 states. [2019-09-08 11:42:54,516 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-08 11:42:54,773 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 11:42:55,078 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 11:42:55,473 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 11:42:55,655 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 11:42:55,873 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 11:42:56,033 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 11:42:56,406 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 11:42:56,925 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 11:42:57,227 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:42:57,512 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 11:42:57,790 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 11:42:58,250 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 11:42:58,529 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 11:42:58,854 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 11:42:59,105 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 11:42:59,427 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-08 11:42:59,601 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 11:43:00,028 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 11:43:00,517 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 11:43:00,832 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 11:43:01,328 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-08 11:43:07,337 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 11:43:07,643 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 11:43:08,964 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:43:09,937 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:43:10,273 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 11:43:10,486 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 11:43:10,836 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 11:43:11,697 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:43:11,896 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-08 11:43:12,201 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-08 11:43:12,551 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 11:43:12,744 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:43:13,039 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-08 11:43:14,168 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-08 11:43:59,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:43:59,546 INFO L93 Difference]: Finished difference Result 114567 states and 145839 transitions. [2019-09-08 11:43:59,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 11:43:59,546 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 105 [2019-09-08 11:43:59,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:43:59,696 INFO L225 Difference]: With dead ends: 114567 [2019-09-08 11:43:59,696 INFO L226 Difference]: Without dead ends: 96689 [2019-09-08 11:43:59,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=929, Invalid=2493, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 11:43:59,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96689 states. [2019-09-08 11:44:23,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96689 to 44109. [2019-09-08 11:44:23,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44109 states. [2019-09-08 11:44:23,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44109 states to 44109 states and 56679 transitions. [2019-09-08 11:44:23,817 INFO L78 Accepts]: Start accepts. Automaton has 44109 states and 56679 transitions. Word has length 105 [2019-09-08 11:44:23,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:44:23,817 INFO L475 AbstractCegarLoop]: Abstraction has 44109 states and 56679 transitions. [2019-09-08 11:44:23,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 11:44:23,817 INFO L276 IsEmpty]: Start isEmpty. Operand 44109 states and 56679 transitions. [2019-09-08 11:44:23,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 11:44:23,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:44:23,826 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:44:23,826 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:44:23,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:44:23,827 INFO L82 PathProgramCache]: Analyzing trace with hash -530573863, now seen corresponding path program 1 times [2019-09-08 11:44:23,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:44:23,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:44:23,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:23,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:44:23,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:44:24,022 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:44:24,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:44:24,023 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 11:44:24,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:44:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:44:24,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 11:44:24,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:44:24,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:44:24,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:44:24,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:44:24,495 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:44:24,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:44:24,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2019-09-08 11:44:24,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 11:44:24,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 11:44:24,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:44:24,505 INFO L87 Difference]: Start difference. First operand 44109 states and 56679 transitions. Second operand 20 states. [2019-09-08 11:44:32,267 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-09-08 11:46:03,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:46:03,414 INFO L93 Difference]: Finished difference Result 179831 states and 230426 transitions. [2019-09-08 11:46:03,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-08 11:46:03,415 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 106 [2019-09-08 11:46:03,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:46:03,589 INFO L225 Difference]: With dead ends: 179831 [2019-09-08 11:46:03,589 INFO L226 Difference]: Without dead ends: 159577 [2019-09-08 11:46:03,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2722 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1685, Invalid=7057, Unknown=0, NotChecked=0, Total=8742 [2019-09-08 11:46:03,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159577 states. [2019-09-08 11:46:40,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159577 to 67711. [2019-09-08 11:46:40,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67711 states. [2019-09-08 11:46:40,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67711 states to 67711 states and 86725 transitions. [2019-09-08 11:46:40,756 INFO L78 Accepts]: Start accepts. Automaton has 67711 states and 86725 transitions. Word has length 106 [2019-09-08 11:46:40,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:46:40,756 INFO L475 AbstractCegarLoop]: Abstraction has 67711 states and 86725 transitions. [2019-09-08 11:46:40,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 11:46:40,756 INFO L276 IsEmpty]: Start isEmpty. Operand 67711 states and 86725 transitions. [2019-09-08 11:46:40,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 11:46:40,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:46:40,764 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:46:40,765 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:46:40,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:46:40,765 INFO L82 PathProgramCache]: Analyzing trace with hash 795611084, now seen corresponding path program 1 times [2019-09-08 11:46:40,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:46:40,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:46:40,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:46:40,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:46:40,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:46:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:46:40,818 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 11:46:40,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:46:40,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:46:40,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:46:40,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:46:40,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:46:40,820 INFO L87 Difference]: Start difference. First operand 67711 states and 86725 transitions. Second operand 3 states. [2019-09-08 11:47:02,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:02,537 INFO L93 Difference]: Finished difference Result 105230 states and 134058 transitions. [2019-09-08 11:47:02,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:47:02,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-08 11:47:02,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:02,573 INFO L225 Difference]: With dead ends: 105230 [2019-09-08 11:47:02,573 INFO L226 Difference]: Without dead ends: 37642 [2019-09-08 11:47:02,618 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 11:47:02,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37642 states. [2019-09-08 11:47:22,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37642 to 37640. [2019-09-08 11:47:22,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37640 states. [2019-09-08 11:47:22,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37640 states to 37640 states and 46862 transitions. [2019-09-08 11:47:22,653 INFO L78 Accepts]: Start accepts. Automaton has 37640 states and 46862 transitions. Word has length 106 [2019-09-08 11:47:22,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:22,654 INFO L475 AbstractCegarLoop]: Abstraction has 37640 states and 46862 transitions. [2019-09-08 11:47:22,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:47:22,654 INFO L276 IsEmpty]: Start isEmpty. Operand 37640 states and 46862 transitions. [2019-09-08 11:47:22,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 11:47:22,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:22,658 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:47:22,658 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:22,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:22,658 INFO L82 PathProgramCache]: Analyzing trace with hash -839839732, now seen corresponding path program 1 times [2019-09-08 11:47:22,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:22,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:22,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:22,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:22,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:23,085 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:23,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:47:23,085 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:47:23,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:23,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-08 11:47:23,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:47:23,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:47:23,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:47:23,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:47:24,029 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-09-08 11:47:24,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-09-08 11:47:25,113 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-09-08 11:47:25,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-09-08 11:47:25,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:47:25,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:47:25,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:47:26,096 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 11:47:26,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 11:47:26,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [19] total 35 [2019-09-08 11:47:26,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 11:47:26,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 11:47:26,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1078, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 11:47:26,101 INFO L87 Difference]: Start difference. First operand 37640 states and 46862 transitions. Second operand 35 states. [2019-09-08 11:47:26,533 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2019-09-08 11:47:27,951 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-08 11:47:28,401 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 48 [2019-09-08 11:47:30,318 WARN L188 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 135 DAG size of output: 75 [2019-09-08 11:47:31,133 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 76 [2019-09-08 11:47:31,982 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-08 11:47:36,759 WARN L188 SmtUtils]: Spent 4.32 s on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-08 11:47:39,555 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 69 [2019-09-08 11:47:45,001 WARN L188 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 75 [2019-09-08 11:47:45,324 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-09-08 11:47:46,147 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-09-08 11:47:48,495 WARN L188 SmtUtils]: Spent 713.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-09-08 11:47:50,854 WARN L188 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 65 [2019-09-08 11:47:53,741 WARN L188 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 74 [2019-09-08 11:47:55,946 WARN L188 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 78 [2019-09-08 11:47:59,397 WARN L188 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-09-08 11:48:01,510 WARN L188 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2019-09-08 11:48:02,306 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-09-08 11:48:08,475 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-09-08 11:48:11,626 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-08 11:48:16,221 WARN L188 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 81 [2019-09-08 11:48:18,514 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-08 11:48:28,501 WARN L188 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-08 11:48:46,216 WARN L188 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 70 DAG size of output: 70 [2019-09-08 11:48:50,687 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 70 [2019-09-08 11:48:53,415 WARN L188 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-08 11:48:55,215 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2019-09-08 11:49:04,612 WARN L188 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-09-08 11:49:07,034 WARN L188 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-08 11:49:19,169 WARN L188 SmtUtils]: Spent 3.01 s on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-09-08 11:49:39,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:39,705 INFO L93 Difference]: Finished difference Result 144497 states and 180616 transitions. [2019-09-08 11:49:39,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-08 11:49:39,706 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 106 [2019-09-08 11:49:39,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:39,828 INFO L225 Difference]: With dead ends: 144497 [2019-09-08 11:49:39,828 INFO L226 Difference]: Without dead ends: 113862 [2019-09-08 11:49:39,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 83 SyntacticMatches, 8 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1516 ImplicationChecksByTransitivity, 61.4s TimeCoverageRelationStatistics Valid=870, Invalid=5602, Unknown=8, NotChecked=0, Total=6480 [2019-09-08 11:49:39,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113862 states. [2019-09-08 11:50:06,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113862 to 46936. [2019-09-08 11:50:06,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46936 states. [2019-09-08 11:50:06,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46936 states to 46936 states and 58475 transitions. [2019-09-08 11:50:06,763 INFO L78 Accepts]: Start accepts. Automaton has 46936 states and 58475 transitions. Word has length 106 [2019-09-08 11:50:06,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:06,764 INFO L475 AbstractCegarLoop]: Abstraction has 46936 states and 58475 transitions. [2019-09-08 11:50:06,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 11:50:06,764 INFO L276 IsEmpty]: Start isEmpty. Operand 46936 states and 58475 transitions. [2019-09-08 11:50:06,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 11:50:06,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:06,768 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:06,769 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:06,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:06,769 INFO L82 PathProgramCache]: Analyzing trace with hash 2059640868, now seen corresponding path program 1 times [2019-09-08 11:50:06,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:06,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:06,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:06,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:06,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:07,057 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:50:07,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:50:07,057 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:50:07,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:07,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 11:50:07,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:50:07,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:50:07,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:50:07,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:50:07,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:50:07,561 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:50:07,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:50:07,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2019-09-08 11:50:07,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 11:50:07,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 11:50:07,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 11:50:07,566 INFO L87 Difference]: Start difference. First operand 46936 states and 58475 transitions. Second operand 22 states. [2019-09-08 11:50:09,515 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 31 [2019-09-08 11:50:10,003 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2019-09-08 11:50:10,704 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2019-09-08 11:50:12,450 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 35 [2019-09-08 11:50:12,879 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2019-09-08 11:50:13,734 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 39 [2019-09-08 11:50:13,889 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 29 [2019-09-08 11:50:25,146 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 37 [2019-09-08 11:50:25,357 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 34 [2019-09-08 11:50:26,803 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 36 [2019-09-08 11:50:32,550 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 37 [2019-09-08 11:50:35,393 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 36 [2019-09-08 11:51:55,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:55,078 INFO L93 Difference]: Finished difference Result 173217 states and 213656 transitions. [2019-09-08 11:51:55,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-08 11:51:55,078 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 106 [2019-09-08 11:51:55,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:55,249 INFO L225 Difference]: With dead ends: 173217 [2019-09-08 11:51:55,249 INFO L226 Difference]: Without dead ends: 157777 [2019-09-08 11:51:55,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2401 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1626, Invalid=6746, Unknown=0, NotChecked=0, Total=8372 [2019-09-08 11:51:55,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157777 states. [2019-09-08 11:52:29,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157777 to 51947. [2019-09-08 11:52:29,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51947 states. [2019-09-08 11:52:29,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51947 states to 51947 states and 64615 transitions. [2019-09-08 11:52:29,486 INFO L78 Accepts]: Start accepts. Automaton has 51947 states and 64615 transitions. Word has length 106 [2019-09-08 11:52:29,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:52:29,486 INFO L475 AbstractCegarLoop]: Abstraction has 51947 states and 64615 transitions. [2019-09-08 11:52:29,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 11:52:29,486 INFO L276 IsEmpty]: Start isEmpty. Operand 51947 states and 64615 transitions. [2019-09-08 11:52:29,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 11:52:29,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:52:29,490 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:52:29,491 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:52:29,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:52:29,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1416503901, now seen corresponding path program 1 times [2019-09-08 11:52:29,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:52:29,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:52:29,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:29,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:52:29,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:29,702 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:52:29,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:52:29,702 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:52:29,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:52:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:29,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 11:52:29,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:52:29,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:52:29,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:52:29,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:52:29,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:52:30,159 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:52:30,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:52:30,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 20 [2019-09-08 11:52:30,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 11:52:30,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 11:52:30,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:52:30,164 INFO L87 Difference]: Start difference. First operand 51947 states and 64615 transitions. Second operand 20 states.