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.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:28:28,574 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:28:28,576 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:28:28,588 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:28:28,588 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:28:28,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:28:28,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:28:28,592 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:28:28,594 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:28:28,595 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:28:28,596 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:28:28,597 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:28:28,597 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:28:28,598 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:28:28,599 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:28:28,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:28:28,601 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:28:28,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:28:28,603 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:28:28,605 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:28:28,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:28:28,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:28:28,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:28:28,609 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:28:28,611 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:28:28,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:28:28,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:28:28,612 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:28:28,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:28:28,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:28:28,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:28:28,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:28:28,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:28:28,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:28:28,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:28:28,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:28:28,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:28:28,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:28:28,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:28:28,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:28:28,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:28:28,620 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:28:28,634 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:28:28,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:28:28,636 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:28:28,636 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:28:28,636 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:28:28,636 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:28:28,637 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:28:28,637 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:28:28,637 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:28:28,637 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:28:28,637 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:28:28,638 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:28:28,638 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:28:28,638 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:28:28,638 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:28:28,638 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:28:28,639 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:28:28,639 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:28:28,639 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:28:28,639 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:28:28,639 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:28:28,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:28:28,640 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:28:28,640 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:28:28,640 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:28:28,640 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:28:28,641 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:28:28,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:28:28,641 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:28:28,669 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:28:28,682 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:28:28,685 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:28:28,686 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:28:28,687 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:28:28,687 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.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-08 11:28:28,746 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a5cc735e/f900d5237e8b484e883d1fa1e7167272/FLAG314d1efc2 [2019-09-08 11:28:29,193 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:28:29,194 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-08 11:28:29,208 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a5cc735e/f900d5237e8b484e883d1fa1e7167272/FLAG314d1efc2 [2019-09-08 11:28:29,515 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a5cc735e/f900d5237e8b484e883d1fa1e7167272 [2019-09-08 11:28:29,525 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:28:29,528 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:28:29,530 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:28:29,530 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:28:29,533 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:28:29,534 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:28:29" (1/1) ... [2019-09-08 11:28:29,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65a662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:28:29, skipping insertion in model container [2019-09-08 11:28:29,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:28:29" (1/1) ... [2019-09-08 11:28:29,545 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:28:29,589 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:28:29,988 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:28:30,000 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:28:30,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:28:30,101 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:28:30,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:28:30 WrapperNode [2019-09-08 11:28:30,101 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:28:30,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:28:30,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:28:30,102 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:28:30,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:28:30" (1/1) ... [2019-09-08 11:28:30,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:28:30" (1/1) ... [2019-09-08 11:28:30,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:28:30" (1/1) ... [2019-09-08 11:28:30,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:28:30" (1/1) ... [2019-09-08 11:28:30,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:28:30" (1/1) ... [2019-09-08 11:28:30,161 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:28:30" (1/1) ... [2019-09-08 11:28:30,164 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:28:30" (1/1) ... [2019-09-08 11:28:30,168 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:28:30,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:28:30,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:28:30,173 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:28:30,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:28:30" (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:28:30,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:28:30,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:28:30,229 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:28:30,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:28:30,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:28:30,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:28:30,230 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:28:30,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:28:30,230 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:28:30,231 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:28:30,231 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:28:30,231 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:28:30,231 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:28:30,231 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:28:30,231 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:28:30,232 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:28:30,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:28:30,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:28:30,899 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:28:30,899 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:28:30,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:28:30 BoogieIcfgContainer [2019-09-08 11:28:30,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:28:30,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:28:30,902 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:28:30,906 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:28:30,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:28:29" (1/3) ... [2019-09-08 11:28:30,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3551f642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:28:30, skipping insertion in model container [2019-09-08 11:28:30,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:28:30" (2/3) ... [2019-09-08 11:28:30,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3551f642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:28:30, skipping insertion in model container [2019-09-08 11:28:30,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:28:30" (3/3) ... [2019-09-08 11:28:30,914 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-08 11:28:30,925 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:28:30,944 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-08 11:28:30,961 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-08 11:28:30,991 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:28:30,991 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:28:30,991 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:28:30,992 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:28:30,992 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:28:30,992 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:28:30,992 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:28:30,992 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:28:30,993 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:28:31,013 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2019-09-08 11:28:31,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-08 11:28:31,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:28:31,024 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:28:31,026 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:28:31,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:28:31,031 INFO L82 PathProgramCache]: Analyzing trace with hash -304932933, now seen corresponding path program 1 times [2019-09-08 11:28:31,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:28:31,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:28:31,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:31,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:28:31,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:28:31,421 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:28:31,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:28:31,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:28:31,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:28:31,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:28:31,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:28:31,447 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 3 states. [2019-09-08 11:28:31,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:28:31,583 INFO L93 Difference]: Finished difference Result 211 states and 339 transitions. [2019-09-08 11:28:31,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:28:31,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-08 11:28:31,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:28:31,600 INFO L225 Difference]: With dead ends: 211 [2019-09-08 11:28:31,600 INFO L226 Difference]: Without dead ends: 157 [2019-09-08 11:28:31,604 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:28:31,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-08 11:28:31,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2019-09-08 11:28:31,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-08 11:28:31,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 216 transitions. [2019-09-08 11:28:31,665 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 216 transitions. Word has length 52 [2019-09-08 11:28:31,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:28:31,666 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 216 transitions. [2019-09-08 11:28:31,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:28:31,666 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 216 transitions. [2019-09-08 11:28:31,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-08 11:28:31,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:28:31,669 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:28:31,669 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:28:31,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:28:31,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1031148298, now seen corresponding path program 1 times [2019-09-08 11:28:31,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:28:31,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:28:31,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:31,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:28:31,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:28:31,868 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:28:31,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:28:31,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:28:31,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:28:31,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:28:31,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:28:31,871 INFO L87 Difference]: Start difference. First operand 155 states and 216 transitions. Second operand 3 states. [2019-09-08 11:28:31,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:28:31,942 INFO L93 Difference]: Finished difference Result 280 states and 405 transitions. [2019-09-08 11:28:31,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:28:31,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-09-08 11:28:31,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:28:31,945 INFO L225 Difference]: With dead ends: 280 [2019-09-08 11:28:31,945 INFO L226 Difference]: Without dead ends: 199 [2019-09-08 11:28:31,947 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:28:31,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-08 11:28:31,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2019-09-08 11:28:31,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-08 11:28:31,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 279 transitions. [2019-09-08 11:28:31,970 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 279 transitions. Word has length 53 [2019-09-08 11:28:31,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:28:31,971 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 279 transitions. [2019-09-08 11:28:31,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:28:31,971 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 279 transitions. [2019-09-08 11:28:31,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 11:28:31,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:28:31,973 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:28:31,973 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:28:31,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:28:31,974 INFO L82 PathProgramCache]: Analyzing trace with hash 337411901, now seen corresponding path program 1 times [2019-09-08 11:28:31,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:28:31,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:28:31,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:31,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:28:31,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:28:32,089 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:28:32,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:28:32,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:28:32,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:28:32,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:28:32,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:28:32,093 INFO L87 Difference]: Start difference. First operand 197 states and 279 transitions. Second operand 5 states. [2019-09-08 11:28:32,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:28:32,312 INFO L93 Difference]: Finished difference Result 513 states and 749 transitions. [2019-09-08 11:28:32,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:28:32,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-09-08 11:28:32,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:28:32,318 INFO L225 Difference]: With dead ends: 513 [2019-09-08 11:28:32,318 INFO L226 Difference]: Without dead ends: 343 [2019-09-08 11:28:32,320 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:28:32,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-09-08 11:28:32,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 338. [2019-09-08 11:28:32,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-09-08 11:28:32,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 491 transitions. [2019-09-08 11:28:32,387 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 491 transitions. Word has length 54 [2019-09-08 11:28:32,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:28:32,389 INFO L475 AbstractCegarLoop]: Abstraction has 338 states and 491 transitions. [2019-09-08 11:28:32,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:28:32,390 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 491 transitions. [2019-09-08 11:28:32,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 11:28:32,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:28:32,394 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:28:32,394 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:28:32,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:28:32,398 INFO L82 PathProgramCache]: Analyzing trace with hash 357669605, now seen corresponding path program 1 times [2019-09-08 11:28:32,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:28:32,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:28:32,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:32,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:28:32,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:28:32,538 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:28:32,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:28:32,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:28:32,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:28:32,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:28:32,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:28:32,540 INFO L87 Difference]: Start difference. First operand 338 states and 491 transitions. Second operand 5 states. [2019-09-08 11:28:32,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:28:32,693 INFO L93 Difference]: Finished difference Result 641 states and 945 transitions. [2019-09-08 11:28:32,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:28:32,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-08 11:28:32,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:28:32,697 INFO L225 Difference]: With dead ends: 641 [2019-09-08 11:28:32,697 INFO L226 Difference]: Without dead ends: 338 [2019-09-08 11:28:32,699 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:28:32,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-09-08 11:28:32,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2019-09-08 11:28:32,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-09-08 11:28:32,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 484 transitions. [2019-09-08 11:28:32,728 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 484 transitions. Word has length 55 [2019-09-08 11:28:32,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:28:32,728 INFO L475 AbstractCegarLoop]: Abstraction has 338 states and 484 transitions. [2019-09-08 11:28:32,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:28:32,729 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 484 transitions. [2019-09-08 11:28:32,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 11:28:32,730 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:28:32,731 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:28:32,731 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:28:32,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:28:32,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1558285795, now seen corresponding path program 1 times [2019-09-08 11:28:32,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:28:32,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:28:32,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:32,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:28:32,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:28:32,840 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:28:32,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:28:32,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:28:32,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:28:32,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:28:32,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:28:32,842 INFO L87 Difference]: Start difference. First operand 338 states and 484 transitions. Second operand 5 states. [2019-09-08 11:28:33,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:28:33,016 INFO L93 Difference]: Finished difference Result 645 states and 936 transitions. [2019-09-08 11:28:33,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:28:33,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-08 11:28:33,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:28:33,023 INFO L225 Difference]: With dead ends: 645 [2019-09-08 11:28:33,023 INFO L226 Difference]: Without dead ends: 338 [2019-09-08 11:28:33,025 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:28:33,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-09-08 11:28:33,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2019-09-08 11:28:33,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-09-08 11:28:33,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 477 transitions. [2019-09-08 11:28:33,056 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 477 transitions. Word has length 56 [2019-09-08 11:28:33,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:28:33,056 INFO L475 AbstractCegarLoop]: Abstraction has 338 states and 477 transitions. [2019-09-08 11:28:33,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:28:33,057 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 477 transitions. [2019-09-08 11:28:33,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 11:28:33,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:28:33,062 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:28:33,062 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:28:33,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:28:33,063 INFO L82 PathProgramCache]: Analyzing trace with hash -557631818, now seen corresponding path program 1 times [2019-09-08 11:28:33,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:28:33,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:28:33,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:33,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:28:33,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:28:33,223 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:28:33,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:28:33,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:28:33,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:28:33,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:28:33,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:28:33,225 INFO L87 Difference]: Start difference. First operand 338 states and 477 transitions. Second operand 5 states. [2019-09-08 11:28:33,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:28:33,382 INFO L93 Difference]: Finished difference Result 1089 states and 1574 transitions. [2019-09-08 11:28:33,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:28:33,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-09-08 11:28:33,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:28:33,388 INFO L225 Difference]: With dead ends: 1089 [2019-09-08 11:28:33,388 INFO L226 Difference]: Without dead ends: 855 [2019-09-08 11:28:33,389 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:28:33,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-09-08 11:28:33,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 510. [2019-09-08 11:28:33,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-09-08 11:28:33,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 729 transitions. [2019-09-08 11:28:33,435 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 729 transitions. Word has length 57 [2019-09-08 11:28:33,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:28:33,436 INFO L475 AbstractCegarLoop]: Abstraction has 510 states and 729 transitions. [2019-09-08 11:28:33,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:28:33,436 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 729 transitions. [2019-09-08 11:28:33,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 11:28:33,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:28:33,438 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:28:33,438 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:28:33,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:28:33,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1406729891, now seen corresponding path program 1 times [2019-09-08 11:28:33,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:28:33,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:28:33,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:33,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:28:33,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:28:33,524 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:28:33,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:28:33,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:28:33,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:28:33,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:28:33,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:28:33,526 INFO L87 Difference]: Start difference. First operand 510 states and 729 transitions. Second operand 5 states. [2019-09-08 11:28:33,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:28:33,766 INFO L93 Difference]: Finished difference Result 1281 states and 1856 transitions. [2019-09-08 11:28:33,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:28:33,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-09-08 11:28:33,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:28:33,773 INFO L225 Difference]: With dead ends: 1281 [2019-09-08 11:28:33,773 INFO L226 Difference]: Without dead ends: 1047 [2019-09-08 11:28:33,775 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:28:33,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2019-09-08 11:28:33,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 771. [2019-09-08 11:28:33,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2019-09-08 11:28:33,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1110 transitions. [2019-09-08 11:28:33,843 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1110 transitions. Word has length 57 [2019-09-08 11:28:33,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:28:33,844 INFO L475 AbstractCegarLoop]: Abstraction has 771 states and 1110 transitions. [2019-09-08 11:28:33,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:28:33,844 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1110 transitions. [2019-09-08 11:28:33,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 11:28:33,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:28:33,845 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:28:33,846 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:28:33,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:28:33,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1122162400, now seen corresponding path program 1 times [2019-09-08 11:28:33,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:28:33,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:28:33,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:33,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:28:33,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:28:33,945 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:28:33,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:28:33,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:28:33,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:28:33,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:28:33,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:28:33,947 INFO L87 Difference]: Start difference. First operand 771 states and 1110 transitions. Second operand 5 states. [2019-09-08 11:28:34,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:28:34,147 INFO L93 Difference]: Finished difference Result 1229 states and 1782 transitions. [2019-09-08 11:28:34,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:28:34,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-09-08 11:28:34,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:28:34,157 INFO L225 Difference]: With dead ends: 1229 [2019-09-08 11:28:34,157 INFO L226 Difference]: Without dead ends: 995 [2019-09-08 11:28:34,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:28:34,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2019-09-08 11:28:34,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 858. [2019-09-08 11:28:34,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2019-09-08 11:28:34,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1241 transitions. [2019-09-08 11:28:34,261 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1241 transitions. Word has length 57 [2019-09-08 11:28:34,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:28:34,261 INFO L475 AbstractCegarLoop]: Abstraction has 858 states and 1241 transitions. [2019-09-08 11:28:34,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:28:34,262 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1241 transitions. [2019-09-08 11:28:34,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 11:28:34,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:28:34,263 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:28:34,263 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:28:34,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:28:34,264 INFO L82 PathProgramCache]: Analyzing trace with hash -274879141, now seen corresponding path program 1 times [2019-09-08 11:28:34,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:28:34,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:28:34,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:34,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:28:34,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:28:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:28:34,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:28:34,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:28:34,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:28:34,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:28:34,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:28:34,556 INFO L87 Difference]: Start difference. First operand 858 states and 1241 transitions. Second operand 9 states. [2019-09-08 11:28:35,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:28:35,277 INFO L93 Difference]: Finished difference Result 2363 states and 3453 transitions. [2019-09-08 11:28:35,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 11:28:35,278 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-09-08 11:28:35,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:28:35,289 INFO L225 Difference]: With dead ends: 2363 [2019-09-08 11:28:35,289 INFO L226 Difference]: Without dead ends: 1607 [2019-09-08 11:28:35,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-09-08 11:28:35,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2019-09-08 11:28:35,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 858. [2019-09-08 11:28:35,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2019-09-08 11:28:35,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1240 transitions. [2019-09-08 11:28:35,427 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1240 transitions. Word has length 58 [2019-09-08 11:28:35,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:28:35,427 INFO L475 AbstractCegarLoop]: Abstraction has 858 states and 1240 transitions. [2019-09-08 11:28:35,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:28:35,428 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1240 transitions. [2019-09-08 11:28:35,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 11:28:35,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:28:35,429 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:28:35,429 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:28:35,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:28:35,429 INFO L82 PathProgramCache]: Analyzing trace with hash -595457999, now seen corresponding path program 1 times [2019-09-08 11:28:35,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:28:35,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:28:35,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:35,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:28:35,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:28:35,690 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:28:35,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:28:35,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:28:35,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:28:35,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:28:35,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:28:35,692 INFO L87 Difference]: Start difference. First operand 858 states and 1240 transitions. Second operand 10 states. [2019-09-08 11:28:36,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:28:36,952 INFO L93 Difference]: Finished difference Result 2187 states and 3179 transitions. [2019-09-08 11:28:36,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 11:28:36,952 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-09-08 11:28:36,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:28:36,961 INFO L225 Difference]: With dead ends: 2187 [2019-09-08 11:28:36,961 INFO L226 Difference]: Without dead ends: 1423 [2019-09-08 11:28:36,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2019-09-08 11:28:36,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2019-09-08 11:28:37,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 858. [2019-09-08 11:28:37,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2019-09-08 11:28:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1237 transitions. [2019-09-08 11:28:37,162 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1237 transitions. Word has length 58 [2019-09-08 11:28:37,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:28:37,165 INFO L475 AbstractCegarLoop]: Abstraction has 858 states and 1237 transitions. [2019-09-08 11:28:37,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:28:37,166 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1237 transitions. [2019-09-08 11:28:37,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 11:28:37,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:28:37,173 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:28:37,173 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:28:37,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:28:37,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1742248038, now seen corresponding path program 1 times [2019-09-08 11:28:37,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:28:37,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:28:37,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:37,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:28:37,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:28:37,393 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:28:37,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:28:37,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:28:37,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:28:37,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:28:37,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:28:37,395 INFO L87 Difference]: Start difference. First operand 858 states and 1237 transitions. Second operand 10 states. [2019-09-08 11:28:38,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:28:38,296 INFO L93 Difference]: Finished difference Result 2407 states and 3493 transitions. [2019-09-08 11:28:38,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:28:38,296 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-09-08 11:28:38,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:28:38,305 INFO L225 Difference]: With dead ends: 2407 [2019-09-08 11:28:38,306 INFO L226 Difference]: Without dead ends: 1658 [2019-09-08 11:28:38,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-08 11:28:38,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2019-09-08 11:28:38,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 858. [2019-09-08 11:28:38,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2019-09-08 11:28:38,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1231 transitions. [2019-09-08 11:28:38,450 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1231 transitions. Word has length 59 [2019-09-08 11:28:38,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:28:38,451 INFO L475 AbstractCegarLoop]: Abstraction has 858 states and 1231 transitions. [2019-09-08 11:28:38,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:28:38,451 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1231 transitions. [2019-09-08 11:28:38,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 11:28:38,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:28:38,452 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:28:38,452 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:28:38,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:28:38,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1512000741, now seen corresponding path program 1 times [2019-09-08 11:28:38,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:28:38,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:28:38,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:38,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:28:38,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:28:39,119 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:28:39,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:28:39,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 11:28:39,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 11:28:39,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 11:28:39,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:28:39,121 INFO L87 Difference]: Start difference. First operand 858 states and 1231 transitions. Second operand 21 states. [2019-09-08 11:28:39,254 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-08 11:28:39,893 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-08 11:28:40,069 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-08 11:28:40,336 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-09-08 11:28:43,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:28:43,306 INFO L93 Difference]: Finished difference Result 4528 states and 6632 transitions. [2019-09-08 11:28:43,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 11:28:43,306 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2019-09-08 11:28:43,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:28:43,327 INFO L225 Difference]: With dead ends: 4528 [2019-09-08 11:28:43,327 INFO L226 Difference]: Without dead ends: 4039 [2019-09-08 11:28:43,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=316, Invalid=1490, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 11:28:43,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4039 states. [2019-09-08 11:28:43,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4039 to 863. [2019-09-08 11:28:43,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-09-08 11:28:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1236 transitions. [2019-09-08 11:28:43,504 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1236 transitions. Word has length 60 [2019-09-08 11:28:43,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:28:43,505 INFO L475 AbstractCegarLoop]: Abstraction has 863 states and 1236 transitions. [2019-09-08 11:28:43,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 11:28:43,505 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1236 transitions. [2019-09-08 11:28:43,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 11:28:43,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:28:43,506 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:28:43,507 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:28:43,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:28:43,507 INFO L82 PathProgramCache]: Analyzing trace with hash 864203142, now seen corresponding path program 1 times [2019-09-08 11:28:43,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:28:43,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:28:43,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:43,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:28:43,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:28:44,106 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:28:44,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:28:44,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 11:28:44,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 11:28:44,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 11:28:44,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:28:44,108 INFO L87 Difference]: Start difference. First operand 863 states and 1236 transitions. Second operand 21 states. [2019-09-08 11:28:44,252 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-09-08 11:28:44,776 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 11:28:44,955 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-08 11:28:45,158 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-08 11:28:45,398 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-08 11:28:45,691 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-08 11:28:48,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:28:48,325 INFO L93 Difference]: Finished difference Result 4589 states and 6731 transitions. [2019-09-08 11:28:48,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 11:28:48,325 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2019-09-08 11:28:48,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:28:48,345 INFO L225 Difference]: With dead ends: 4589 [2019-09-08 11:28:48,345 INFO L226 Difference]: Without dead ends: 4106 [2019-09-08 11:28:48,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=344, Invalid=1462, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 11:28:48,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2019-09-08 11:28:48,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 863. [2019-09-08 11:28:48,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-09-08 11:28:48,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1235 transitions. [2019-09-08 11:28:48,569 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1235 transitions. Word has length 60 [2019-09-08 11:28:48,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:28:48,569 INFO L475 AbstractCegarLoop]: Abstraction has 863 states and 1235 transitions. [2019-09-08 11:28:48,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 11:28:48,570 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1235 transitions. [2019-09-08 11:28:48,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 11:28:48,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:28:48,571 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:28:48,572 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:28:48,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:28:48,572 INFO L82 PathProgramCache]: Analyzing trace with hash 439557614, now seen corresponding path program 1 times [2019-09-08 11:28:48,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:28:48,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:28:48,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:48,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:28:48,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:28:49,527 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:28:49,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:28:49,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 11:28:49,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 11:28:49,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 11:28:49,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-08 11:28:49,530 INFO L87 Difference]: Start difference. First operand 863 states and 1235 transitions. Second operand 17 states. [2019-09-08 11:28:50,164 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-09-08 11:28:50,380 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-09-08 11:28:50,534 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-08 11:28:50,690 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-08 11:28:50,899 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-08 11:28:51,099 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-08 11:28:52,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:28:52,299 INFO L93 Difference]: Finished difference Result 2726 states and 3979 transitions. [2019-09-08 11:28:52,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 11:28:52,299 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 60 [2019-09-08 11:28:52,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:28:52,311 INFO L225 Difference]: With dead ends: 2726 [2019-09-08 11:28:52,311 INFO L226 Difference]: Without dead ends: 2391 [2019-09-08 11:28:52,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=248, Invalid=808, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 11:28:52,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2019-09-08 11:28:52,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 858. [2019-09-08 11:28:52,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2019-09-08 11:28:52,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1226 transitions. [2019-09-08 11:28:52,487 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1226 transitions. Word has length 60 [2019-09-08 11:28:52,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:28:52,488 INFO L475 AbstractCegarLoop]: Abstraction has 858 states and 1226 transitions. [2019-09-08 11:28:52,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 11:28:52,488 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1226 transitions. [2019-09-08 11:28:52,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 11:28:52,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:28:52,489 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:28:52,489 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:28:52,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:28:52,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1535867814, now seen corresponding path program 1 times [2019-09-08 11:28:52,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:28:52,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:28:52,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:52,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:28:52,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:28:53,036 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:28:53,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:28:53,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 11:28:53,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 11:28:53,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 11:28:53,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-09-08 11:28:53,039 INFO L87 Difference]: Start difference. First operand 858 states and 1226 transitions. Second operand 14 states. [2019-09-08 11:28:53,516 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-09-08 11:28:53,699 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-08 11:28:53,910 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-08 11:28:54,076 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-08 11:28:54,218 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-08 11:28:54,416 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-09-08 11:28:54,776 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2019-09-08 11:28:55,266 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-08 11:28:55,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:28:55,705 INFO L93 Difference]: Finished difference Result 3108 states and 4547 transitions. [2019-09-08 11:28:55,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:28:55,706 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2019-09-08 11:28:55,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:28:55,717 INFO L225 Difference]: With dead ends: 3108 [2019-09-08 11:28:55,717 INFO L226 Difference]: Without dead ends: 2603 [2019-09-08 11:28:55,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2019-09-08 11:28:55,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2019-09-08 11:28:55,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 830. [2019-09-08 11:28:55,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-09-08 11:28:55,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1190 transitions. [2019-09-08 11:28:55,914 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1190 transitions. Word has length 61 [2019-09-08 11:28:55,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:28:55,914 INFO L475 AbstractCegarLoop]: Abstraction has 830 states and 1190 transitions. [2019-09-08 11:28:55,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 11:28:55,914 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1190 transitions. [2019-09-08 11:28:55,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 11:28:55,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:28:55,916 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:28:55,916 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:28:55,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:28:55,916 INFO L82 PathProgramCache]: Analyzing trace with hash 19025890, now seen corresponding path program 1 times [2019-09-08 11:28:55,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:28:55,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:28:55,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:55,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:28:55,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:28:56,353 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-08 11:28:56,680 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:28:56,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:28:56,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 11:28:56,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 11:28:56,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 11:28:56,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:28:56,685 INFO L87 Difference]: Start difference. First operand 830 states and 1190 transitions. Second operand 15 states. [2019-09-08 11:28:57,176 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-09-08 11:28:57,374 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-08 11:28:57,756 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-09-08 11:28:59,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:28:59,481 INFO L93 Difference]: Finished difference Result 4730 states and 6952 transitions. [2019-09-08 11:28:59,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:28:59,482 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2019-09-08 11:28:59,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:28:59,498 INFO L225 Difference]: With dead ends: 4730 [2019-09-08 11:28:59,498 INFO L226 Difference]: Without dead ends: 4235 [2019-09-08 11:28:59,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=153, Invalid=549, Unknown=0, NotChecked=0, Total=702 [2019-09-08 11:28:59,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4235 states. [2019-09-08 11:28:59,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4235 to 822. [2019-09-08 11:28:59,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-09-08 11:28:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1178 transitions. [2019-09-08 11:28:59,679 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1178 transitions. Word has length 61 [2019-09-08 11:28:59,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:28:59,680 INFO L475 AbstractCegarLoop]: Abstraction has 822 states and 1178 transitions. [2019-09-08 11:28:59,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 11:28:59,680 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1178 transitions. [2019-09-08 11:28:59,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 11:28:59,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:28:59,681 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:28:59,681 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:28:59,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:28:59,681 INFO L82 PathProgramCache]: Analyzing trace with hash -447846175, now seen corresponding path program 1 times [2019-09-08 11:28:59,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:28:59,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:28:59,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:59,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:28:59,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:29:00,149 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:29:00,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:29:00,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:29:00,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:29:00,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:29:00,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:29:00,151 INFO L87 Difference]: Start difference. First operand 822 states and 1178 transitions. Second operand 12 states. [2019-09-08 11:29:00,553 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-09-08 11:29:00,707 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-08 11:29:00,872 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-08 11:29:01,205 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-08 11:29:01,438 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-09-08 11:29:01,587 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-08 11:29:02,116 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 11:29:02,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:29:02,772 INFO L93 Difference]: Finished difference Result 4205 states and 6176 transitions. [2019-09-08 11:29:02,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 11:29:02,773 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2019-09-08 11:29:02,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:29:02,782 INFO L225 Difference]: With dead ends: 4205 [2019-09-08 11:29:02,782 INFO L226 Difference]: Without dead ends: 3722 [2019-09-08 11:29:02,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:29:02,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2019-09-08 11:29:02,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 811. [2019-09-08 11:29:02,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-09-08 11:29:02,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1164 transitions. [2019-09-08 11:29:02,992 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1164 transitions. Word has length 61 [2019-09-08 11:29:02,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:29:02,992 INFO L475 AbstractCegarLoop]: Abstraction has 811 states and 1164 transitions. [2019-09-08 11:29:02,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:29:02,992 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1164 transitions. [2019-09-08 11:29:02,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 11:29:02,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:29:02,993 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:29:02,993 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:29:02,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:29:02,993 INFO L82 PathProgramCache]: Analyzing trace with hash 626489158, now seen corresponding path program 1 times [2019-09-08 11:29:02,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:29:02,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:29:02,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:02,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:29:02,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:29:03,839 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-08 11:29:04,206 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:29:04,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:29:04,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 11:29:04,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 11:29:04,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 11:29:04,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:29:04,207 INFO L87 Difference]: Start difference. First operand 811 states and 1164 transitions. Second operand 20 states. [2019-09-08 11:29:04,343 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-09-08 11:29:04,902 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-08 11:29:05,052 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-08 11:29:05,242 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-08 11:29:05,547 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-08 11:29:05,731 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-08 11:29:05,926 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-08 11:29:06,239 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-08 11:29:06,600 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-08 11:29:06,788 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-08 11:29:06,979 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-08 11:29:07,170 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-08 11:29:09,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:29:09,109 INFO L93 Difference]: Finished difference Result 3120 states and 4574 transitions. [2019-09-08 11:29:09,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 11:29:09,110 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2019-09-08 11:29:09,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:29:09,117 INFO L225 Difference]: With dead ends: 3120 [2019-09-08 11:29:09,117 INFO L226 Difference]: Without dead ends: 2797 [2019-09-08 11:29:09,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=322, Invalid=1318, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 11:29:09,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2797 states. [2019-09-08 11:29:09,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2797 to 811. [2019-09-08 11:29:09,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-09-08 11:29:09,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1163 transitions. [2019-09-08 11:29:09,327 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1163 transitions. Word has length 61 [2019-09-08 11:29:09,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:29:09,328 INFO L475 AbstractCegarLoop]: Abstraction has 811 states and 1163 transitions. [2019-09-08 11:29:09,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 11:29:09,328 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1163 transitions. [2019-09-08 11:29:09,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 11:29:09,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:29:09,329 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:29:09,329 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:29:09,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:29:09,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1538298394, now seen corresponding path program 1 times [2019-09-08 11:29:09,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:29:09,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:29:09,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:09,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:29:09,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:29:09,903 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:29:09,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:29:09,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 11:29:09,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 11:29:09,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 11:29:09,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-08 11:29:09,905 INFO L87 Difference]: Start difference. First operand 811 states and 1163 transitions. Second operand 16 states. [2019-09-08 11:29:10,566 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-08 11:29:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:29:12,565 INFO L93 Difference]: Finished difference Result 3313 states and 4858 transitions. [2019-09-08 11:29:12,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:29:12,565 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 62 [2019-09-08 11:29:12,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:29:12,572 INFO L225 Difference]: With dead ends: 3313 [2019-09-08 11:29:12,572 INFO L226 Difference]: Without dead ends: 2980 [2019-09-08 11:29:12,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=227, Invalid=703, Unknown=0, NotChecked=0, Total=930 [2019-09-08 11:29:12,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2019-09-08 11:29:12,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 792. [2019-09-08 11:29:12,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-09-08 11:29:12,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1143 transitions. [2019-09-08 11:29:12,878 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1143 transitions. Word has length 62 [2019-09-08 11:29:12,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:29:12,879 INFO L475 AbstractCegarLoop]: Abstraction has 792 states and 1143 transitions. [2019-09-08 11:29:12,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 11:29:12,879 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1143 transitions. [2019-09-08 11:29:12,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 11:29:12,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:29:12,880 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:29:12,881 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:29:12,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:29:12,881 INFO L82 PathProgramCache]: Analyzing trace with hash 845611540, now seen corresponding path program 1 times [2019-09-08 11:29:12,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:29:12,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:29:12,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:12,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:29:12,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:29:12,929 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:29:12,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:29:12,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:29:12,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:29:12,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:29:12,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:29:12,931 INFO L87 Difference]: Start difference. First operand 792 states and 1143 transitions. Second operand 3 states. [2019-09-08 11:29:13,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:29:13,328 INFO L93 Difference]: Finished difference Result 2108 states and 3073 transitions. [2019-09-08 11:29:13,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:29:13,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-08 11:29:13,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:29:13,333 INFO L225 Difference]: With dead ends: 2108 [2019-09-08 11:29:13,334 INFO L226 Difference]: Without dead ends: 1394 [2019-09-08 11:29:13,336 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:29:13,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2019-09-08 11:29:13,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1392. [2019-09-08 11:29:13,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1392 states. [2019-09-08 11:29:13,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1980 transitions. [2019-09-08 11:29:13,786 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1980 transitions. Word has length 80 [2019-09-08 11:29:13,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:29:13,787 INFO L475 AbstractCegarLoop]: Abstraction has 1392 states and 1980 transitions. [2019-09-08 11:29:13,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:29:13,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1980 transitions. [2019-09-08 11:29:13,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 11:29:13,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:29:13,789 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:29:13,789 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:29:13,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:29:13,789 INFO L82 PathProgramCache]: Analyzing trace with hash 801494317, now seen corresponding path program 1 times [2019-09-08 11:29:13,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:29:13,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:29:13,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:13,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:29:13,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:29:13,846 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:29:13,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:29:13,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:29:13,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:29:13,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:29:13,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:29:13,847 INFO L87 Difference]: Start difference. First operand 1392 states and 1980 transitions. Second operand 3 states. [2019-09-08 11:29:14,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:29:14,548 INFO L93 Difference]: Finished difference Result 3876 states and 5522 transitions. [2019-09-08 11:29:14,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:29:14,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-08 11:29:14,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:29:14,554 INFO L225 Difference]: With dead ends: 3876 [2019-09-08 11:29:14,554 INFO L226 Difference]: Without dead ends: 2562 [2019-09-08 11:29:14,557 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:29:14,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2019-09-08 11:29:15,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2416. [2019-09-08 11:29:15,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2416 states. [2019-09-08 11:29:15,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 3408 transitions. [2019-09-08 11:29:15,204 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 3408 transitions. Word has length 81 [2019-09-08 11:29:15,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:29:15,204 INFO L475 AbstractCegarLoop]: Abstraction has 2416 states and 3408 transitions. [2019-09-08 11:29:15,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:29:15,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3408 transitions. [2019-09-08 11:29:15,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 11:29:15,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:29:15,206 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:29:15,206 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:29:15,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:29:15,206 INFO L82 PathProgramCache]: Analyzing trace with hash 955833769, now seen corresponding path program 1 times [2019-09-08 11:29:15,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:29:15,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:29:15,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:15,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:29:15,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:29:15,261 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:29:15,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:29:15,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:29:15,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:29:15,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:29:15,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:29:15,262 INFO L87 Difference]: Start difference. First operand 2416 states and 3408 transitions. Second operand 3 states. [2019-09-08 11:29:16,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:29:16,851 INFO L93 Difference]: Finished difference Result 6228 states and 8798 transitions. [2019-09-08 11:29:16,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:29:16,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-08 11:29:16,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:29:16,856 INFO L225 Difference]: With dead ends: 6228 [2019-09-08 11:29:16,856 INFO L226 Difference]: Without dead ends: 3890 [2019-09-08 11:29:16,859 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:29:16,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2019-09-08 11:29:17,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 3616. [2019-09-08 11:29:17,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3616 states. [2019-09-08 11:29:17,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3616 states to 3616 states and 5030 transitions. [2019-09-08 11:29:17,907 INFO L78 Accepts]: Start accepts. Automaton has 3616 states and 5030 transitions. Word has length 82 [2019-09-08 11:29:17,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:29:17,907 INFO L475 AbstractCegarLoop]: Abstraction has 3616 states and 5030 transitions. [2019-09-08 11:29:17,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:29:17,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3616 states and 5030 transitions. [2019-09-08 11:29:17,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:29:17,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:29:17,909 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:29:17,909 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:29:17,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:29:17,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1715394677, now seen corresponding path program 1 times [2019-09-08 11:29:17,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:29:17,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:29:17,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:17,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:29:17,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:29:17,954 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:29:17,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:29:17,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:29:17,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:29:17,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:29:17,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:29:17,956 INFO L87 Difference]: Start difference. First operand 3616 states and 5030 transitions. Second operand 3 states. [2019-09-08 11:29:19,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:29:19,483 INFO L93 Difference]: Finished difference Result 7272 states and 10146 transitions. [2019-09-08 11:29:19,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:29:19,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-08 11:29:19,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:29:19,487 INFO L225 Difference]: With dead ends: 7272 [2019-09-08 11:29:19,487 INFO L226 Difference]: Without dead ends: 3734 [2019-09-08 11:29:19,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:29:19,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3734 states. [2019-09-08 11:29:20,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3734 to 3732. [2019-09-08 11:29:20,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3732 states. [2019-09-08 11:29:20,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3732 states to 3732 states and 5134 transitions. [2019-09-08 11:29:20,560 INFO L78 Accepts]: Start accepts. Automaton has 3732 states and 5134 transitions. Word has length 83 [2019-09-08 11:29:20,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:29:20,561 INFO L475 AbstractCegarLoop]: Abstraction has 3732 states and 5134 transitions. [2019-09-08 11:29:20,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:29:20,561 INFO L276 IsEmpty]: Start isEmpty. Operand 3732 states and 5134 transitions. [2019-09-08 11:29:20,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:29:20,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:29:20,563 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:29:20,563 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:29:20,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:29:20,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1787912455, now seen corresponding path program 1 times [2019-09-08 11:29:20,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:29:20,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:29:20,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:20,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:29:20,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:29:20,649 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:29:20,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:29:20,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:29:20,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:29:20,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:29:20,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:29:20,653 INFO L87 Difference]: Start difference. First operand 3732 states and 5134 transitions. Second operand 6 states. [2019-09-08 11:29:22,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:29:22,498 INFO L93 Difference]: Finished difference Result 5776 states and 7886 transitions. [2019-09-08 11:29:22,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:29:22,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-08 11:29:22,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:29:22,503 INFO L225 Difference]: With dead ends: 5776 [2019-09-08 11:29:22,503 INFO L226 Difference]: Without dead ends: 5774 [2019-09-08 11:29:22,504 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:29:22,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5774 states. [2019-09-08 11:29:23,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5774 to 3828. [2019-09-08 11:29:23,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3828 states. [2019-09-08 11:29:23,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3828 states to 3828 states and 5198 transitions. [2019-09-08 11:29:23,623 INFO L78 Accepts]: Start accepts. Automaton has 3828 states and 5198 transitions. Word has length 83 [2019-09-08 11:29:23,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:29:23,623 INFO L475 AbstractCegarLoop]: Abstraction has 3828 states and 5198 transitions. [2019-09-08 11:29:23,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:29:23,624 INFO L276 IsEmpty]: Start isEmpty. Operand 3828 states and 5198 transitions. [2019-09-08 11:29:23,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 11:29:23,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:29:23,624 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, 1] [2019-09-08 11:29:23,624 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:29:23,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:29:23,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1801937696, now seen corresponding path program 1 times [2019-09-08 11:29:23,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:29:23,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:29:23,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:23,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:29:23,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:29:23,709 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:29:23,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:29:23,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:29:23,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:29:23,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:29:23,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:29:23,711 INFO L87 Difference]: Start difference. First operand 3828 states and 5198 transitions. Second operand 7 states. [2019-09-08 11:29:26,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:29:26,584 INFO L93 Difference]: Finished difference Result 12444 states and 16806 transitions. [2019-09-08 11:29:26,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:29:26,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-09-08 11:29:26,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:29:26,593 INFO L225 Difference]: With dead ends: 12444 [2019-09-08 11:29:26,593 INFO L226 Difference]: Without dead ends: 8694 [2019-09-08 11:29:26,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:29:26,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8694 states. [2019-09-08 11:29:27,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8694 to 4440. [2019-09-08 11:29:27,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4440 states. [2019-09-08 11:29:27,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4440 states to 4440 states and 6048 transitions. [2019-09-08 11:29:27,847 INFO L78 Accepts]: Start accepts. Automaton has 4440 states and 6048 transitions. Word has length 84 [2019-09-08 11:29:27,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:29:27,848 INFO L475 AbstractCegarLoop]: Abstraction has 4440 states and 6048 transitions. [2019-09-08 11:29:27,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:29:27,848 INFO L276 IsEmpty]: Start isEmpty. Operand 4440 states and 6048 transitions. [2019-09-08 11:29:27,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 11:29:27,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:29:27,850 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:29:27,851 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:29:27,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:29:27,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1416144859, now seen corresponding path program 1 times [2019-09-08 11:29:27,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:29:27,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:29:27,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:27,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:29:27,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:29:28,065 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:29:28,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:29:28,065 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:29:28,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:29:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:29:28,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 11:29:28,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:29:28,306 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 11:29:28,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 11:29:28,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-09-08 11:29:28,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 11:29:28,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 11:29:28,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-09-08 11:29:28,325 INFO L87 Difference]: Start difference. First operand 4440 states and 6048 transitions. Second operand 14 states. [2019-09-08 11:29:29,353 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-09-08 11:29:29,587 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2019-09-08 11:29:34,132 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-08 11:29:43,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:29:43,904 INFO L93 Difference]: Finished difference Result 31198 states and 41030 transitions. [2019-09-08 11:29:43,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-08 11:29:43,904 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 104 [2019-09-08 11:29:43,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:29:43,996 INFO L225 Difference]: With dead ends: 31198 [2019-09-08 11:29:43,996 INFO L226 Difference]: Without dead ends: 26836 [2019-09-08 11:29:44,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3346 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1619, Invalid=7887, Unknown=0, NotChecked=0, Total=9506 [2019-09-08 11:29:44,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26836 states. [2019-09-08 11:29:48,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26836 to 12676. [2019-09-08 11:29:48,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12676 states. [2019-09-08 11:29:48,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12676 states to 12676 states and 16759 transitions. [2019-09-08 11:29:48,388 INFO L78 Accepts]: Start accepts. Automaton has 12676 states and 16759 transitions. Word has length 104 [2019-09-08 11:29:48,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:29:48,388 INFO L475 AbstractCegarLoop]: Abstraction has 12676 states and 16759 transitions. [2019-09-08 11:29:48,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 11:29:48,388 INFO L276 IsEmpty]: Start isEmpty. Operand 12676 states and 16759 transitions. [2019-09-08 11:29:48,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 11:29:48,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:29:48,394 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, 1, 1] [2019-09-08 11:29:48,394 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:29:48,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:29:48,395 INFO L82 PathProgramCache]: Analyzing trace with hash -56998622, now seen corresponding path program 1 times [2019-09-08 11:29:48,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:29:48,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:29:48,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:48,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:29:48,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:29:48,789 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:29:48,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:29:48,790 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:29:48,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:29:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:29:48,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 11:29:48,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:29:49,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:29:49,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:29:49,895 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:29:49,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:29:49,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-09-08 11:29:49,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 11:29:49,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 11:29:49,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:29:49,910 INFO L87 Difference]: Start difference. First operand 12676 states and 16759 transitions. Second operand 20 states. [2019-09-08 11:29:50,254 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-08 11:29:50,697 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-08 11:29:51,009 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 11:29:51,228 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 11:29:51,802 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 11:29:52,238 WARN L188 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 11:29:52,454 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 11:29:52,720 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 11:29:53,078 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 11:29:53,518 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 11:29:53,835 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:29:54,125 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 11:29:54,602 WARN L188 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 11:29:55,029 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 11:29:55,244 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 11:29:55,618 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 11:29:55,969 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 11:29:56,361 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-08 11:29:56,551 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 11:29:56,805 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 11:29:57,468 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 11:29:57,671 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 11:29:58,132 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-08 11:30:02,203 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 11:30:02,446 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 11:30:03,395 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:30:03,647 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:30:04,221 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 11:30:04,444 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 11:30:04,719 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 11:30:05,025 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:30:05,230 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-08 11:30:05,544 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-08 11:30:06,095 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-08 11:30:06,576 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 11:30:06,888 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:30:07,725 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-08 11:30:29,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:30:29,520 INFO L93 Difference]: Finished difference Result 82631 states and 107969 transitions. [2019-09-08 11:30:29,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 11:30:29,520 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 106 [2019-09-08 11:30:29,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:30:29,716 INFO L225 Difference]: With dead ends: 82631 [2019-09-08 11:30:29,716 INFO L226 Difference]: Without dead ends: 70033 [2019-09-08 11:30:29,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=929, Invalid=2493, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 11:30:29,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70033 states. [2019-09-08 11:30:43,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70033 to 31014. [2019-09-08 11:30:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31014 states. [2019-09-08 11:30:43,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31014 states to 31014 states and 40945 transitions. [2019-09-08 11:30:43,459 INFO L78 Accepts]: Start accepts. Automaton has 31014 states and 40945 transitions. Word has length 106 [2019-09-08 11:30:43,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:30:43,460 INFO L475 AbstractCegarLoop]: Abstraction has 31014 states and 40945 transitions. [2019-09-08 11:30:43,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 11:30:43,460 INFO L276 IsEmpty]: Start isEmpty. Operand 31014 states and 40945 transitions. [2019-09-08 11:30:43,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 11:30:43,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:30:43,465 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, 1, 1] [2019-09-08 11:30:43,466 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:30:43,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:30:43,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1985676566, now seen corresponding path program 1 times [2019-09-08 11:30:43,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:30:43,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:30:43,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:30:43,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:30:43,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:30:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:30:43,772 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:30:43,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:30:43,772 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:30:43,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:30:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:30:43,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 11:30:43,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:30:44,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:30:44,479 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:30:44,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:30:44,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-09-08 11:30:44,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 11:30:44,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 11:30:44,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:30:44,485 INFO L87 Difference]: Start difference. First operand 31014 states and 40945 transitions. Second operand 20 states. [2019-09-08 11:31:43,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:31:43,616 INFO L93 Difference]: Finished difference Result 154399 states and 201453 transitions. [2019-09-08 11:31:43,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 11:31:43,616 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 106 [2019-09-08 11:31:43,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:31:43,779 INFO L225 Difference]: With dead ends: 154399 [2019-09-08 11:31:43,779 INFO L226 Difference]: Without dead ends: 123485 [2019-09-08 11:31:43,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=643, Invalid=1807, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 11:31:43,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123485 states. [2019-09-08 11:32:12,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123485 to 66216. [2019-09-08 11:32:12,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66216 states. [2019-09-08 11:32:12,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66216 states to 66216 states and 86900 transitions. [2019-09-08 11:32:12,161 INFO L78 Accepts]: Start accepts. Automaton has 66216 states and 86900 transitions. Word has length 106 [2019-09-08 11:32:12,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:32:12,162 INFO L475 AbstractCegarLoop]: Abstraction has 66216 states and 86900 transitions. [2019-09-08 11:32:12,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 11:32:12,162 INFO L276 IsEmpty]: Start isEmpty. Operand 66216 states and 86900 transitions. [2019-09-08 11:32:12,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 11:32:12,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:32:12,174 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, 1, 1, 1] [2019-09-08 11:32:12,174 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:32:12,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:32:12,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1486306068, now seen corresponding path program 1 times [2019-09-08 11:32:12,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:32:12,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:32:12,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:12,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:32:12,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:32:12,450 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:32:12,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:32:12,451 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:32:12,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:32:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:32:12,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 11:32:12,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:32:12,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:32:12,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:32:12,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:32:13,050 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:32:13,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:32:13,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-09-08 11:32:13,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 11:32:13,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 11:32:13,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2019-09-08 11:32:13,057 INFO L87 Difference]: Start difference. First operand 66216 states and 86900 transitions. Second operand 22 states. [2019-09-08 11:32:13,988 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-09-08 11:32:18,043 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 36 [2019-09-08 11:32:18,663 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 30 [2019-09-08 11:32:22,087 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2019-09-08 11:32:24,977 WARN L188 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2019-09-08 11:32:27,126 WARN L188 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2019-09-08 11:32:27,885 WARN L188 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 32 [2019-09-08 11:32:30,779 WARN L188 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 73 DAG size of output: 40 [2019-09-08 11:32:30,925 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2019-09-08 11:32:31,163 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 36 [2019-09-08 11:32:34,013 WARN L188 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 68 DAG size of output: 35 [2019-09-08 11:32:34,485 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 33 [2019-09-08 11:32:38,024 WARN L188 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2019-09-08 11:32:38,337 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2019-09-08 11:32:40,254 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2019-09-08 11:34:05,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:34:05,581 INFO L93 Difference]: Finished difference Result 220873 states and 288225 transitions. [2019-09-08 11:34:05,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-08 11:34:05,582 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 107 [2019-09-08 11:34:05,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:34:05,854 INFO L225 Difference]: With dead ends: 220873 [2019-09-08 11:34:05,854 INFO L226 Difference]: Without dead ends: 189959 [2019-09-08 11:34:05,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1593 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=1272, Invalid=4890, Unknown=0, NotChecked=0, Total=6162 [2019-09-08 11:34:06,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189959 states. [2019-09-08 11:34:38,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189959 to 66204. [2019-09-08 11:34:38,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66204 states. [2019-09-08 11:34:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66204 states to 66204 states and 86888 transitions. [2019-09-08 11:34:38,409 INFO L78 Accepts]: Start accepts. Automaton has 66204 states and 86888 transitions. Word has length 107 [2019-09-08 11:34:38,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:34:38,409 INFO L475 AbstractCegarLoop]: Abstraction has 66204 states and 86888 transitions. [2019-09-08 11:34:38,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 11:34:38,409 INFO L276 IsEmpty]: Start isEmpty. Operand 66204 states and 86888 transitions. [2019-09-08 11:34:38,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 11:34:38,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:34:38,418 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:34:38,418 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:34:38,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:34:38,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1432148257, now seen corresponding path program 1 times [2019-09-08 11:34:38,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:34:38,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:34:38,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:34:38,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:34:38,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:34:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:34:38,471 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:34:38,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:34:38,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:34:38,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:34:38,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:34:38,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:34:38,473 INFO L87 Difference]: Start difference. First operand 66204 states and 86888 transitions. Second operand 3 states. [2019-09-08 11:35:09,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:35:09,823 INFO L93 Difference]: Finished difference Result 130238 states and 170980 transitions. [2019-09-08 11:35:09,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:35:09,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-08 11:35:09,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:35:09,905 INFO L225 Difference]: With dead ends: 130238 [2019-09-08 11:35:09,905 INFO L226 Difference]: Without dead ends: 64146 [2019-09-08 11:35:09,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:35:10,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64146 states. [2019-09-08 11:35:37,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64146 to 62494. [2019-09-08 11:35:37,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62494 states. [2019-09-08 11:35:37,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62494 states to 62494 states and 80200 transitions. [2019-09-08 11:35:37,914 INFO L78 Accepts]: Start accepts. Automaton has 62494 states and 80200 transitions. Word has length 107 [2019-09-08 11:35:37,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:35:37,915 INFO L475 AbstractCegarLoop]: Abstraction has 62494 states and 80200 transitions. [2019-09-08 11:35:37,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:35:37,915 INFO L276 IsEmpty]: Start isEmpty. Operand 62494 states and 80200 transitions. [2019-09-08 11:35:37,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 11:35:37,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:35:37,921 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, 1, 1, 1] [2019-09-08 11:35:37,922 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:35:37,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:35:37,922 INFO L82 PathProgramCache]: Analyzing trace with hash -203302559, now seen corresponding path program 1 times [2019-09-08 11:35:37,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:35:37,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:35:37,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:35:37,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:35:37,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:35:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:35:38,540 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:35:38,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:35:38,540 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:35:38,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:35:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:35:38,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-08 11:35:38,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:35:39,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:35:39,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:35:39,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:35:40,390 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:35:40,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:35:40,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2019-09-08 11:35:40,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 11:35:40,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 11:35:40,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1148, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 11:35:40,396 INFO L87 Difference]: Start difference. First operand 62494 states and 80200 transitions. Second operand 36 states. [2019-09-08 11:35:42,006 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-08 11:35:42,298 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-08 11:35:42,750 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-09-08 11:35:48,376 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-08 11:35:49,006 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-08 11:35:53,312 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-08 11:35:56,146 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-08 11:35:59,884 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:36:00,468 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-09-08 11:36:03,191 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-08 11:36:03,680 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-08 11:36:05,133 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-09-08 11:36:05,882 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-09-08 11:36:13,264 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-08 11:36:16,156 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-09-08 11:36:28,060 WARN L188 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-08 11:36:32,082 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-08 11:36:36,325 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-08 11:36:36,878 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-09-08 11:36:46,585 WARN L188 SmtUtils]: Spent 958.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-08 11:36:47,339 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-08 11:36:51,682 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-08 11:36:52,390 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-08 11:36:52,730 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-08 11:36:56,700 WARN L188 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-08 11:36:58,074 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-08 11:37:01,638 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-08 11:37:02,687 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-08 11:37:03,041 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-08 11:37:03,581 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-08 11:37:04,175 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-08 11:37:17,630 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-08 11:37:20,527 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-08 11:37:23,539 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-08 11:37:25,654 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-08 11:37:27,372 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-08 11:37:34,901 WARN L188 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-08 11:37:36,494 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-08 11:37:42,916 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-08 11:37:45,384 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-08 11:37:48,606 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-08 11:37:50,324 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-08 11:37:54,467 WARN L188 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-08 11:37:59,406 WARN L188 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-08 11:38:01,003 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-08 11:38:10,306 WARN L188 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-08 11:38:14,282 WARN L188 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-08 11:38:24,702 WARN L188 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-08 11:38:30,666 WARN L188 SmtUtils]: Spent 807.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-08 11:38:35,596 WARN L188 SmtUtils]: Spent 730.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-08 11:38:40,944 WARN L188 SmtUtils]: Spent 2.19 s on a formula simplification that was a NOOP. DAG size: 52 [2019-09-08 11:38:44,605 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-09-08 11:38:49,595 WARN L188 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-08 11:38:50,820 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-08 11:38:56,960 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-08 11:39:00,171 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-09-08 11:39:04,315 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-09-08 11:39:07,287 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-08 11:39:09,049 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-08 11:39:11,644 WARN L188 SmtUtils]: Spent 463.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-09-08 11:39:14,845 WARN L188 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-08 11:39:17,261 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-08 11:39:19,797 WARN L188 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 58 [2019-09-08 11:39:42,342 WARN L188 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-08 11:39:44,022 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-08 11:40:22,355 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-08 11:40:27,972 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-08 11:40:31,231 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-08 11:40:36,910 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-08 11:40:40,129 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-08 11:40:40,490 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-08 11:40:44,817 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-08 11:40:45,053 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-08 11:40:46,707 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-08 11:40:51,048 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-08 11:40:55,042 WARN L188 SmtUtils]: Spent 946.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-08 11:40:55,515 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-08 11:41:07,304 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-08 11:41:14,539 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-08 11:41:26,885 WARN L188 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-08 11:41:35,733 WARN L188 SmtUtils]: Spent 2.81 s on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-08 11:41:38,078 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-08 11:41:44,982 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-08 11:41:48,884 WARN L188 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 81 DAG size of output: 74