/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:35:10,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:35:10,536 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:35:10,554 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:35:10,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:35:10,556 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:35:10,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:35:10,569 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:35:10,571 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:35:10,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:35:10,573 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:35:10,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:35:10,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:35:10,574 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:35:10,575 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:35:10,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:35:10,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:35:10,582 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:35:10,584 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:35:10,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:35:10,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:35:10,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:35:10,594 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:35:10,595 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:35:10,598 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:35:10,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:35:10,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:35:10,601 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:35:10,601 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:35:10,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:35:10,603 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:35:10,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:35:10,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:35:10,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:35:10,610 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:35:10,610 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:35:10,611 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:35:10,611 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:35:10,611 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:35:10,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:35:10,615 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:35:10,616 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-11-23 22:35:10,629 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:35:10,630 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:35:10,632 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:35:10,632 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:35:10,632 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:35:10,633 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:35:10,633 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:35:10,634 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:35:10,634 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:35:10,634 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:35:10,634 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:35:10,635 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:35:10,635 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:35:10,635 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:35:10,635 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:35:10,635 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:35:10,636 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:35:10,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:35:10,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:35:10,637 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:35:10,638 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:35:10,638 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:35:10,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:35:10,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:35:10,638 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:35:10,639 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:35:10,639 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:35:10,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:35:10,639 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:35:10,639 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:35:10,933 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:35:10,946 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:35:10,950 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:35:10,951 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:35:10,952 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:35:10,952 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-23 22:35:11,024 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4f2afd11/df672d59013942ae9f4f53e20c4aae78/FLAG2ef99b280 [2019-11-23 22:35:11,530 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:35:11,530 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-23 22:35:11,543 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4f2afd11/df672d59013942ae9f4f53e20c4aae78/FLAG2ef99b280 [2019-11-23 22:35:11,840 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4f2afd11/df672d59013942ae9f4f53e20c4aae78 [2019-11-23 22:35:11,851 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:35:11,853 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:35:11,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:35:11,854 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:35:11,857 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:35:11,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:35:11" (1/1) ... [2019-11-23 22:35:11,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e53a924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:11, skipping insertion in model container [2019-11-23 22:35:11,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:35:11" (1/1) ... [2019-11-23 22:35:11,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:35:11,944 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:35:12,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:35:12,483 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:35:12,810 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:35:12,831 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:35:12,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:12 WrapperNode [2019-11-23 22:35:12,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:35:12,833 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:35:12,833 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:35:12,833 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:35:12,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:12" (1/1) ... [2019-11-23 22:35:12,863 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:12" (1/1) ... [2019-11-23 22:35:12,959 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:35:12,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:35:12,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:35:12,960 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:35:12,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:12" (1/1) ... [2019-11-23 22:35:12,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:12" (1/1) ... [2019-11-23 22:35:12,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:12" (1/1) ... [2019-11-23 22:35:12,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:12" (1/1) ... [2019-11-23 22:35:12,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:12" (1/1) ... [2019-11-23 22:35:13,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:12" (1/1) ... [2019-11-23 22:35:13,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:12" (1/1) ... [2019-11-23 22:35:13,036 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:35:13,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:35:13,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:35:13,037 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:35:13,038 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:12" (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-11-23 22:35:13,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:35:13,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:35:14,456 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:35:14,456 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-23 22:35:14,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:35:14 BoogieIcfgContainer [2019-11-23 22:35:14,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:35:14,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:35:14,460 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:35:14,464 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:35:14,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:35:11" (1/3) ... [2019-11-23 22:35:14,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21088e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:35:14, skipping insertion in model container [2019-11-23 22:35:14,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:12" (2/3) ... [2019-11-23 22:35:14,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21088e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:35:14, skipping insertion in model container [2019-11-23 22:35:14,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:35:14" (3/3) ... [2019-11-23 22:35:14,469 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-23 22:35:14,478 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:35:14,488 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:35:14,500 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:35:14,546 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:35:14,546 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:35:14,546 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:35:14,546 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:35:14,547 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:35:14,547 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:35:14,548 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:35:14,548 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:35:14,587 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states. [2019-11-23 22:35:14,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-23 22:35:14,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:14,603 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:35:14,603 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:14,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:14,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1686891750, now seen corresponding path program 1 times [2019-11-23 22:35:14,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:14,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786585643] [2019-11-23 22:35:14,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:15,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:15,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786585643] [2019-11-23 22:35:15,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:15,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:15,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641914828] [2019-11-23 22:35:15,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:15,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:15,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:15,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:15,307 INFO L87 Difference]: Start difference. First operand 337 states. Second operand 3 states. [2019-11-23 22:35:15,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:15,497 INFO L93 Difference]: Finished difference Result 664 states and 1156 transitions. [2019-11-23 22:35:15,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:15,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-23 22:35:15,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:15,519 INFO L225 Difference]: With dead ends: 664 [2019-11-23 22:35:15,519 INFO L226 Difference]: Without dead ends: 543 [2019-11-23 22:35:15,523 INFO L630 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-11-23 22:35:15,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-11-23 22:35:15,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 541. [2019-11-23 22:35:15,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-11-23 22:35:15,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 810 transitions. [2019-11-23 22:35:15,619 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 810 transitions. Word has length 153 [2019-11-23 22:35:15,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:15,620 INFO L462 AbstractCegarLoop]: Abstraction has 541 states and 810 transitions. [2019-11-23 22:35:15,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:15,620 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 810 transitions. [2019-11-23 22:35:15,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-23 22:35:15,625 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:15,625 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:35:15,626 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:15,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:15,626 INFO L82 PathProgramCache]: Analyzing trace with hash -2064713451, now seen corresponding path program 1 times [2019-11-23 22:35:15,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:15,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512681589] [2019-11-23 22:35:15,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:16,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:16,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512681589] [2019-11-23 22:35:16,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:16,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:16,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492550578] [2019-11-23 22:35:16,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:16,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:16,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:16,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:16,096 INFO L87 Difference]: Start difference. First operand 541 states and 810 transitions. Second operand 4 states. [2019-11-23 22:35:16,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:16,256 INFO L93 Difference]: Finished difference Result 1576 states and 2351 transitions. [2019-11-23 22:35:16,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:16,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-11-23 22:35:16,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:16,263 INFO L225 Difference]: With dead ends: 1576 [2019-11-23 22:35:16,263 INFO L226 Difference]: Without dead ends: 1044 [2019-11-23 22:35:16,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:35:16,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2019-11-23 22:35:16,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 1042. [2019-11-23 22:35:16,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1042 states. [2019-11-23 22:35:16,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1543 transitions. [2019-11-23 22:35:16,344 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1543 transitions. Word has length 153 [2019-11-23 22:35:16,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:16,345 INFO L462 AbstractCegarLoop]: Abstraction has 1042 states and 1543 transitions. [2019-11-23 22:35:16,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:16,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1543 transitions. [2019-11-23 22:35:16,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-23 22:35:16,356 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:16,356 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:35:16,357 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:16,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:16,358 INFO L82 PathProgramCache]: Analyzing trace with hash -2039605151, now seen corresponding path program 1 times [2019-11-23 22:35:16,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:16,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782282240] [2019-11-23 22:35:16,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:16,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:16,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782282240] [2019-11-23 22:35:16,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:16,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:16,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148974418] [2019-11-23 22:35:16,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:16,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:16,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:16,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:16,440 INFO L87 Difference]: Start difference. First operand 1042 states and 1543 transitions. Second operand 3 states. [2019-11-23 22:35:16,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:16,530 INFO L93 Difference]: Finished difference Result 3088 states and 4567 transitions. [2019-11-23 22:35:16,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:16,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-23 22:35:16,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:16,542 INFO L225 Difference]: With dead ends: 3088 [2019-11-23 22:35:16,542 INFO L226 Difference]: Without dead ends: 2074 [2019-11-23 22:35:16,545 INFO L630 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-11-23 22:35:16,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2019-11-23 22:35:16,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 1044. [2019-11-23 22:35:16,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1044 states. [2019-11-23 22:35:16,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1545 transitions. [2019-11-23 22:35:16,613 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1545 transitions. Word has length 154 [2019-11-23 22:35:16,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:16,613 INFO L462 AbstractCegarLoop]: Abstraction has 1044 states and 1545 transitions. [2019-11-23 22:35:16,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:16,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1545 transitions. [2019-11-23 22:35:16,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-23 22:35:16,624 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:16,625 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:35:16,625 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:16,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:16,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1427333698, now seen corresponding path program 1 times [2019-11-23 22:35:16,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:16,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175601543] [2019-11-23 22:35:16,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:16,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175601543] [2019-11-23 22:35:16,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:16,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:16,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987923710] [2019-11-23 22:35:16,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:16,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:16,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:16,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:16,761 INFO L87 Difference]: Start difference. First operand 1044 states and 1545 transitions. Second operand 3 states. [2019-11-23 22:35:16,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:16,894 INFO L93 Difference]: Finished difference Result 2685 states and 3975 transitions. [2019-11-23 22:35:16,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:16,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-23 22:35:16,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:16,906 INFO L225 Difference]: With dead ends: 2685 [2019-11-23 22:35:16,906 INFO L226 Difference]: Without dead ends: 1836 [2019-11-23 22:35:16,908 INFO L630 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-11-23 22:35:16,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2019-11-23 22:35:16,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1834. [2019-11-23 22:35:16,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1834 states. [2019-11-23 22:35:17,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 2677 transitions. [2019-11-23 22:35:17,006 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 2677 transitions. Word has length 155 [2019-11-23 22:35:17,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:17,007 INFO L462 AbstractCegarLoop]: Abstraction has 1834 states and 2677 transitions. [2019-11-23 22:35:17,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:17,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 2677 transitions. [2019-11-23 22:35:17,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-23 22:35:17,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:17,012 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:35:17,012 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:17,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:17,012 INFO L82 PathProgramCache]: Analyzing trace with hash -697762299, now seen corresponding path program 1 times [2019-11-23 22:35:17,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:17,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807836743] [2019-11-23 22:35:17,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:17,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:17,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807836743] [2019-11-23 22:35:17,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:17,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:17,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836969941] [2019-11-23 22:35:17,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:17,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:17,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:17,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:17,239 INFO L87 Difference]: Start difference. First operand 1834 states and 2677 transitions. Second operand 4 states. [2019-11-23 22:35:17,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:17,327 INFO L93 Difference]: Finished difference Result 3193 states and 4683 transitions. [2019-11-23 22:35:17,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:17,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-11-23 22:35:17,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:17,335 INFO L225 Difference]: With dead ends: 3193 [2019-11-23 22:35:17,336 INFO L226 Difference]: Without dead ends: 1542 [2019-11-23 22:35:17,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:35:17,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-11-23 22:35:17,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1542. [2019-11-23 22:35:17,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1542 states. [2019-11-23 22:35:17,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2253 transitions. [2019-11-23 22:35:17,430 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2253 transitions. Word has length 155 [2019-11-23 22:35:17,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:17,431 INFO L462 AbstractCegarLoop]: Abstraction has 1542 states and 2253 transitions. [2019-11-23 22:35:17,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:17,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2253 transitions. [2019-11-23 22:35:17,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-23 22:35:17,435 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:17,435 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:35:17,436 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:17,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:17,436 INFO L82 PathProgramCache]: Analyzing trace with hash -134790601, now seen corresponding path program 1 times [2019-11-23 22:35:17,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:17,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248985332] [2019-11-23 22:35:17,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:17,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:17,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248985332] [2019-11-23 22:35:17,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:17,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:17,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819280536] [2019-11-23 22:35:17,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:17,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:17,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:17,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:17,546 INFO L87 Difference]: Start difference. First operand 1542 states and 2253 transitions. Second operand 3 states. [2019-11-23 22:35:17,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:17,681 INFO L93 Difference]: Finished difference Result 3639 states and 5426 transitions. [2019-11-23 22:35:17,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:17,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-11-23 22:35:17,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:17,692 INFO L225 Difference]: With dead ends: 3639 [2019-11-23 22:35:17,692 INFO L226 Difference]: Without dead ends: 2282 [2019-11-23 22:35:17,695 INFO L630 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-11-23 22:35:17,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2019-11-23 22:35:17,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 1966. [2019-11-23 22:35:17,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1966 states. [2019-11-23 22:35:17,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 2941 transitions. [2019-11-23 22:35:17,812 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 2941 transitions. Word has length 157 [2019-11-23 22:35:17,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:17,813 INFO L462 AbstractCegarLoop]: Abstraction has 1966 states and 2941 transitions. [2019-11-23 22:35:17,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:17,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 2941 transitions. [2019-11-23 22:35:17,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-23 22:35:17,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:17,819 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:35:17,820 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:17,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:17,820 INFO L82 PathProgramCache]: Analyzing trace with hash -998712723, now seen corresponding path program 1 times [2019-11-23 22:35:17,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:17,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108092763] [2019-11-23 22:35:17,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:17,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:17,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108092763] [2019-11-23 22:35:17,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:17,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:17,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854344640] [2019-11-23 22:35:17,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:17,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:17,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:17,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:17,942 INFO L87 Difference]: Start difference. First operand 1966 states and 2941 transitions. Second operand 3 states. [2019-11-23 22:35:18,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:18,227 INFO L93 Difference]: Finished difference Result 4697 states and 7163 transitions. [2019-11-23 22:35:18,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:18,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-11-23 22:35:18,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:18,248 INFO L225 Difference]: With dead ends: 4697 [2019-11-23 22:35:18,248 INFO L226 Difference]: Without dead ends: 3000 [2019-11-23 22:35:18,254 INFO L630 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-11-23 22:35:18,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2019-11-23 22:35:18,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 2720. [2019-11-23 22:35:18,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2720 states. [2019-11-23 22:35:18,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2720 states and 4156 transitions. [2019-11-23 22:35:18,432 INFO L78 Accepts]: Start accepts. Automaton has 2720 states and 4156 transitions. Word has length 159 [2019-11-23 22:35:18,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:18,432 INFO L462 AbstractCegarLoop]: Abstraction has 2720 states and 4156 transitions. [2019-11-23 22:35:18,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:18,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2720 states and 4156 transitions. [2019-11-23 22:35:18,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-23 22:35:18,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:18,436 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:35:18,437 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:18,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:18,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1717485432, now seen corresponding path program 1 times [2019-11-23 22:35:18,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:18,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296148495] [2019-11-23 22:35:18,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:18,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:18,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296148495] [2019-11-23 22:35:18,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:18,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:35:18,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270077356] [2019-11-23 22:35:18,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:35:18,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:18,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:35:18,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:35:18,680 INFO L87 Difference]: Start difference. First operand 2720 states and 4156 transitions. Second operand 5 states. [2019-11-23 22:35:19,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:19,309 INFO L93 Difference]: Finished difference Result 7944 states and 12667 transitions. [2019-11-23 22:35:19,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:35:19,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2019-11-23 22:35:19,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:19,342 INFO L225 Difference]: With dead ends: 7944 [2019-11-23 22:35:19,343 INFO L226 Difference]: Without dead ends: 6275 [2019-11-23 22:35:19,347 INFO L630 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-11-23 22:35:19,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6275 states. [2019-11-23 22:35:19,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6275 to 4530. [2019-11-23 22:35:19,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4530 states. [2019-11-23 22:35:19,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4530 states to 4530 states and 7089 transitions. [2019-11-23 22:35:19,686 INFO L78 Accepts]: Start accepts. Automaton has 4530 states and 7089 transitions. Word has length 160 [2019-11-23 22:35:19,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:19,687 INFO L462 AbstractCegarLoop]: Abstraction has 4530 states and 7089 transitions. [2019-11-23 22:35:19,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:35:19,687 INFO L276 IsEmpty]: Start isEmpty. Operand 4530 states and 7089 transitions. [2019-11-23 22:35:19,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-23 22:35:19,693 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:19,694 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:35:19,694 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:19,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:19,695 INFO L82 PathProgramCache]: Analyzing trace with hash 2094526459, now seen corresponding path program 1 times [2019-11-23 22:35:19,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:19,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759135709] [2019-11-23 22:35:19,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:19,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:19,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759135709] [2019-11-23 22:35:19,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:19,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:19,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961553844] [2019-11-23 22:35:19,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:19,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:19,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:19,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:19,887 INFO L87 Difference]: Start difference. First operand 4530 states and 7089 transitions. Second operand 3 states. [2019-11-23 22:35:20,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:20,487 INFO L93 Difference]: Finished difference Result 11209 states and 17807 transitions. [2019-11-23 22:35:20,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:20,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-11-23 22:35:20,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:20,542 INFO L225 Difference]: With dead ends: 11209 [2019-11-23 22:35:20,542 INFO L226 Difference]: Without dead ends: 7762 [2019-11-23 22:35:20,549 INFO L630 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-11-23 22:35:20,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7762 states. [2019-11-23 22:35:21,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7762 to 7760. [2019-11-23 22:35:21,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7760 states. [2019-11-23 22:35:21,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7760 states to 7760 states and 12159 transitions. [2019-11-23 22:35:21,114 INFO L78 Accepts]: Start accepts. Automaton has 7760 states and 12159 transitions. Word has length 160 [2019-11-23 22:35:21,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:21,115 INFO L462 AbstractCegarLoop]: Abstraction has 7760 states and 12159 transitions. [2019-11-23 22:35:21,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:21,115 INFO L276 IsEmpty]: Start isEmpty. Operand 7760 states and 12159 transitions. [2019-11-23 22:35:21,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-23 22:35:21,120 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:21,120 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:35:21,120 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:21,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:21,121 INFO L82 PathProgramCache]: Analyzing trace with hash -2095307133, now seen corresponding path program 1 times [2019-11-23 22:35:21,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:21,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146185952] [2019-11-23 22:35:21,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:21,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:21,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146185952] [2019-11-23 22:35:21,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:21,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:35:21,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434769202] [2019-11-23 22:35:21,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:35:21,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:21,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:35:21,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:35:21,332 INFO L87 Difference]: Start difference. First operand 7760 states and 12159 transitions. Second operand 8 states. [2019-11-23 22:35:24,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:24,825 INFO L93 Difference]: Finished difference Result 49598 states and 78594 transitions. [2019-11-23 22:35:24,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 22:35:24,825 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 160 [2019-11-23 22:35:24,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:24,947 INFO L225 Difference]: With dead ends: 49598 [2019-11-23 22:35:24,948 INFO L226 Difference]: Without dead ends: 46086 [2019-11-23 22:35:24,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2019-11-23 22:35:25,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46086 states. [2019-11-23 22:35:27,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46086 to 21309. [2019-11-23 22:35:27,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21309 states. [2019-11-23 22:35:27,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21309 states to 21309 states and 33288 transitions. [2019-11-23 22:35:27,259 INFO L78 Accepts]: Start accepts. Automaton has 21309 states and 33288 transitions. Word has length 160 [2019-11-23 22:35:27,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:27,259 INFO L462 AbstractCegarLoop]: Abstraction has 21309 states and 33288 transitions. [2019-11-23 22:35:27,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:35:27,260 INFO L276 IsEmpty]: Start isEmpty. Operand 21309 states and 33288 transitions. [2019-11-23 22:35:27,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-23 22:35:27,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:27,270 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:35:27,270 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:27,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:27,271 INFO L82 PathProgramCache]: Analyzing trace with hash -421132591, now seen corresponding path program 1 times [2019-11-23 22:35:27,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:27,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358140798] [2019-11-23 22:35:27,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:27,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358140798] [2019-11-23 22:35:27,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:27,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:27,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742881552] [2019-11-23 22:35:27,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:27,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:27,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:27,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:27,472 INFO L87 Difference]: Start difference. First operand 21309 states and 33288 transitions. Second operand 4 states. [2019-11-23 22:35:29,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:29,038 INFO L93 Difference]: Finished difference Result 57711 states and 90159 transitions. [2019-11-23 22:35:29,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:29,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-11-23 22:35:29,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:29,097 INFO L225 Difference]: With dead ends: 57711 [2019-11-23 22:35:29,097 INFO L226 Difference]: Without dead ends: 36421 [2019-11-23 22:35:29,121 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:35:29,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36421 states. [2019-11-23 22:35:31,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36421 to 36419. [2019-11-23 22:35:31,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36419 states. [2019-11-23 22:35:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36419 states to 36419 states and 56483 transitions. [2019-11-23 22:35:31,795 INFO L78 Accepts]: Start accepts. Automaton has 36419 states and 56483 transitions. Word has length 160 [2019-11-23 22:35:31,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:31,796 INFO L462 AbstractCegarLoop]: Abstraction has 36419 states and 56483 transitions. [2019-11-23 22:35:31,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:31,796 INFO L276 IsEmpty]: Start isEmpty. Operand 36419 states and 56483 transitions. [2019-11-23 22:35:31,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-23 22:35:31,808 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:31,809 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:35:31,809 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:31,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:31,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1030182154, now seen corresponding path program 1 times [2019-11-23 22:35:31,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:31,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411236005] [2019-11-23 22:35:31,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:31,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411236005] [2019-11-23 22:35:31,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:31,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:31,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710328474] [2019-11-23 22:35:31,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:31,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:31,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:31,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:31,893 INFO L87 Difference]: Start difference. First operand 36419 states and 56483 transitions. Second operand 3 states. [2019-11-23 22:35:34,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:34,863 INFO L93 Difference]: Finished difference Result 98308 states and 152234 transitions. [2019-11-23 22:35:34,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:34,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-11-23 22:35:34,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:34,960 INFO L225 Difference]: With dead ends: 98308 [2019-11-23 22:35:34,960 INFO L226 Difference]: Without dead ends: 62356 [2019-11-23 22:35:35,011 INFO L630 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-11-23 22:35:35,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62356 states. [2019-11-23 22:35:38,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62356 to 62354. [2019-11-23 22:35:38,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62354 states. [2019-11-23 22:35:39,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62354 states to 62354 states and 95625 transitions. [2019-11-23 22:35:39,067 INFO L78 Accepts]: Start accepts. Automaton has 62354 states and 95625 transitions. Word has length 162 [2019-11-23 22:35:39,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:39,068 INFO L462 AbstractCegarLoop]: Abstraction has 62354 states and 95625 transitions. [2019-11-23 22:35:39,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:39,068 INFO L276 IsEmpty]: Start isEmpty. Operand 62354 states and 95625 transitions. [2019-11-23 22:35:39,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-23 22:35:39,085 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:39,085 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:35:39,085 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:39,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:39,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1706233581, now seen corresponding path program 1 times [2019-11-23 22:35:39,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:39,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627889862] [2019-11-23 22:35:39,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:39,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:39,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627889862] [2019-11-23 22:35:39,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:39,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:39,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605365940] [2019-11-23 22:35:39,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:39,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:39,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:39,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:39,226 INFO L87 Difference]: Start difference. First operand 62354 states and 95625 transitions. Second operand 4 states. [2019-11-23 22:35:41,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:41,992 INFO L93 Difference]: Finished difference Result 108633 states and 166596 transitions. [2019-11-23 22:35:41,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:41,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-11-23 22:35:41,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:42,062 INFO L225 Difference]: With dead ends: 108633 [2019-11-23 22:35:42,062 INFO L226 Difference]: Without dead ends: 56046 [2019-11-23 22:35:42,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:35:42,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56046 states. [2019-11-23 22:35:46,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56046 to 56046. [2019-11-23 22:35:46,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56046 states. [2019-11-23 22:35:46,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56046 states to 56046 states and 85910 transitions. [2019-11-23 22:35:46,118 INFO L78 Accepts]: Start accepts. Automaton has 56046 states and 85910 transitions. Word has length 162 [2019-11-23 22:35:46,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:46,119 INFO L462 AbstractCegarLoop]: Abstraction has 56046 states and 85910 transitions. [2019-11-23 22:35:46,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:46,119 INFO L276 IsEmpty]: Start isEmpty. Operand 56046 states and 85910 transitions. [2019-11-23 22:35:46,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-23 22:35:46,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:46,131 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:35:46,132 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:46,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:46,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1551814217, now seen corresponding path program 1 times [2019-11-23 22:35:46,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:46,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585590423] [2019-11-23 22:35:46,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:46,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:46,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:46,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585590423] [2019-11-23 22:35:46,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:46,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:46,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869319919] [2019-11-23 22:35:46,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:46,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:46,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:46,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:46,205 INFO L87 Difference]: Start difference. First operand 56046 states and 85910 transitions. Second operand 3 states. [2019-11-23 22:35:50,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:50,631 INFO L93 Difference]: Finished difference Result 154965 states and 239388 transitions. [2019-11-23 22:35:50,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:50,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-11-23 22:35:50,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:50,760 INFO L225 Difference]: With dead ends: 154965 [2019-11-23 22:35:50,760 INFO L226 Difference]: Without dead ends: 99670 [2019-11-23 22:35:50,807 INFO L630 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-11-23 22:35:50,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99670 states. [2019-11-23 22:35:56,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99670 to 91700. [2019-11-23 22:35:56,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91700 states. [2019-11-23 22:35:56,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91700 states to 91700 states and 142305 transitions. [2019-11-23 22:35:56,576 INFO L78 Accepts]: Start accepts. Automaton has 91700 states and 142305 transitions. Word has length 166 [2019-11-23 22:35:56,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:56,576 INFO L462 AbstractCegarLoop]: Abstraction has 91700 states and 142305 transitions. [2019-11-23 22:35:56,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:56,577 INFO L276 IsEmpty]: Start isEmpty. Operand 91700 states and 142305 transitions. [2019-11-23 22:35:56,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-23 22:35:56,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:56,589 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:35:56,589 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:56,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:56,590 INFO L82 PathProgramCache]: Analyzing trace with hash -529946272, now seen corresponding path program 1 times [2019-11-23 22:35:56,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:56,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245312767] [2019-11-23 22:35:56,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:56,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:56,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245312767] [2019-11-23 22:35:56,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:56,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:56,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463065088] [2019-11-23 22:35:56,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:56,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:56,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:56,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:56,691 INFO L87 Difference]: Start difference. First operand 91700 states and 142305 transitions. Second operand 3 states. [2019-11-23 22:36:04,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:04,370 INFO L93 Difference]: Finished difference Result 210836 states and 327615 transitions. [2019-11-23 22:36:04,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:36:04,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-11-23 22:36:04,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:04,537 INFO L225 Difference]: With dead ends: 210836 [2019-11-23 22:36:04,537 INFO L226 Difference]: Without dead ends: 130294 [2019-11-23 22:36:04,592 INFO L630 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-11-23 22:36:04,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130294 states. [2019-11-23 22:36:10,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130294 to 118200. [2019-11-23 22:36:10,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118200 states. [2019-11-23 22:36:10,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118200 states to 118200 states and 180461 transitions. [2019-11-23 22:36:10,418 INFO L78 Accepts]: Start accepts. Automaton has 118200 states and 180461 transitions. Word has length 167 [2019-11-23 22:36:10,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:10,418 INFO L462 AbstractCegarLoop]: Abstraction has 118200 states and 180461 transitions. [2019-11-23 22:36:10,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:36:10,418 INFO L276 IsEmpty]: Start isEmpty. Operand 118200 states and 180461 transitions. [2019-11-23 22:36:10,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-23 22:36:10,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:10,431 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:36:10,431 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:10,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:10,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1179727346, now seen corresponding path program 1 times [2019-11-23 22:36:10,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:10,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780150206] [2019-11-23 22:36:10,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:10,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:36:10,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780150206] [2019-11-23 22:36:10,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:10,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:36:10,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495972843] [2019-11-23 22:36:10,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:36:10,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:10,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:36:10,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:36:10,995 INFO L87 Difference]: Start difference. First operand 118200 states and 180461 transitions. Second operand 4 states. [2019-11-23 22:36:23,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:23,159 INFO L93 Difference]: Finished difference Result 324557 states and 494710 transitions. [2019-11-23 22:36:23,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:36:23,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-11-23 22:36:23,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:23,414 INFO L225 Difference]: With dead ends: 324557 [2019-11-23 22:36:23,414 INFO L226 Difference]: Without dead ends: 206396 [2019-11-23 22:36:23,473 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:36:23,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206396 states.