/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.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:35:40,811 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:35:40,813 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:35:40,824 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:35:40,825 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:35:40,826 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:35:40,827 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:35:40,829 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:35:40,831 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:35:40,832 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:35:40,833 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:35:40,835 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:35:40,836 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:35:40,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:35:40,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:35:40,840 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:35:40,842 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:35:40,843 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:35:40,847 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:35:40,851 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:35:40,852 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:35:40,855 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:35:40,856 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:35:40,857 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:35:40,860 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:35:40,861 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:35:40,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:35:40,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:35:40,862 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:35:40,865 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:35:40,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:35:40,866 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:35:40,867 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:35:40,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:35:40,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:35:40,871 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:35:40,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:35:40,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:35:40,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:35:40,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:35:40,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:35:40,874 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:40,888 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:35:40,888 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:35:40,889 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:35:40,890 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:35:40,890 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:35:40,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:35:40,890 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:35:40,890 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:35:40,891 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:35:40,891 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:35:40,891 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:35:40,891 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:35:40,891 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:35:40,891 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:35:40,892 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:35:40,892 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:35:40,892 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:35:40,892 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:35:40,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:35:40,893 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:35:40,893 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:35:40,893 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:35:40,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:35:40,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:35:40,894 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:35:40,894 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:35:40,894 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:35:40,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:35:40,894 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:35:40,894 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:35:41,164 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:35:41,182 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:35:41,185 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:35:41,187 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:35:41,187 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:35:41,188 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-23 22:35:41,269 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b43968fc3/a4ce4615c6ba4faaa749a8487e1a5408/FLAG09a12c23e [2019-11-23 22:35:41,828 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:35:41,829 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-23 22:35:41,841 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b43968fc3/a4ce4615c6ba4faaa749a8487e1a5408/FLAG09a12c23e [2019-11-23 22:35:42,072 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b43968fc3/a4ce4615c6ba4faaa749a8487e1a5408 [2019-11-23 22:35:42,081 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:35:42,082 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:35:42,083 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:35:42,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:35:42,088 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:35:42,089 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:35:42" (1/1) ... [2019-11-23 22:35:42,091 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f043480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:42, skipping insertion in model container [2019-11-23 22:35:42,092 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:35:42" (1/1) ... [2019-11-23 22:35:42,100 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:35:42,172 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:35:42,796 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:35:42,810 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:35:43,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:35:43,300 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:35:43,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:43 WrapperNode [2019-11-23 22:35:43,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:35:43,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:35:43,302 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:35:43,303 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:35:43,311 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:43" (1/1) ... [2019-11-23 22:35:43,331 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:43" (1/1) ... [2019-11-23 22:35:43,424 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:35:43,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:35:43,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:35:43,425 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:35:43,433 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:43" (1/1) ... [2019-11-23 22:35:43,434 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:43" (1/1) ... [2019-11-23 22:35:43,439 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:43" (1/1) ... [2019-11-23 22:35:43,440 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:43" (1/1) ... [2019-11-23 22:35:43,461 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:43" (1/1) ... [2019-11-23 22:35:43,477 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:43" (1/1) ... [2019-11-23 22:35:43,486 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:43" (1/1) ... [2019-11-23 22:35:43,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:35:43,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:35:43,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:35:43,506 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:35:43,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:43" (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:43,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:35:43,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:35:45,442 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:35:45,442 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-23 22:35:45,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:35:45 BoogieIcfgContainer [2019-11-23 22:35:45,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:35:45,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:35:45,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:35:45,450 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:35:45,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:35:42" (1/3) ... [2019-11-23 22:35:45,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2f4c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:35:45, skipping insertion in model container [2019-11-23 22:35:45,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:43" (2/3) ... [2019-11-23 22:35:45,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2f4c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:35:45, skipping insertion in model container [2019-11-23 22:35:45,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:35:45" (3/3) ... [2019-11-23 22:35:45,456 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-23 22:35:45,466 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:35:45,476 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-23 22:35:45,488 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-23 22:35:45,522 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:35:45,523 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:35:45,523 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:35:45,523 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:35:45,523 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:35:45,523 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:35:45,523 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:35:45,524 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:35:45,570 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states. [2019-11-23 22:35:45,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-23 22:35:45,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:45,587 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] [2019-11-23 22:35:45,587 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:45,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:45,594 INFO L82 PathProgramCache]: Analyzing trace with hash -430745720, now seen corresponding path program 1 times [2019-11-23 22:35:45,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:45,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269551262] [2019-11-23 22:35:45,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:46,164 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,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269551262] [2019-11-23 22:35:46,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:46,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:46,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232428993] [2019-11-23 22:35:46,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:46,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:46,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:46,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:46,192 INFO L87 Difference]: Start difference. First operand 411 states. Second operand 3 states. [2019-11-23 22:35:46,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:46,405 INFO L93 Difference]: Finished difference Result 753 states and 1326 transitions. [2019-11-23 22:35:46,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:46,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-11-23 22:35:46,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:46,441 INFO L225 Difference]: With dead ends: 753 [2019-11-23 22:35:46,442 INFO L226 Difference]: Without dead ends: 596 [2019-11-23 22:35:46,449 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:46,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-11-23 22:35:46,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 594. [2019-11-23 22:35:46,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-11-23 22:35:46,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 868 transitions. [2019-11-23 22:35:46,571 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 868 transitions. Word has length 147 [2019-11-23 22:35:46,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:46,575 INFO L462 AbstractCegarLoop]: Abstraction has 594 states and 868 transitions. [2019-11-23 22:35:46,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:46,575 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 868 transitions. [2019-11-23 22:35:46,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-23 22:35:46,579 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:46,579 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] [2019-11-23 22:35:46,579 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:46,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:46,580 INFO L82 PathProgramCache]: Analyzing trace with hash -734514301, now seen corresponding path program 1 times [2019-11-23 22:35:46,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:46,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526530008] [2019-11-23 22:35:46,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:46,786 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,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526530008] [2019-11-23 22:35:46,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:46,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:46,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470267663] [2019-11-23 22:35:46,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:46,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:46,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:46,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:46,791 INFO L87 Difference]: Start difference. First operand 594 states and 868 transitions. Second operand 3 states. [2019-11-23 22:35:46,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:46,948 INFO L93 Difference]: Finished difference Result 1211 states and 1828 transitions. [2019-11-23 22:35:46,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:46,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-11-23 22:35:46,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:46,954 INFO L225 Difference]: With dead ends: 1211 [2019-11-23 22:35:46,954 INFO L226 Difference]: Without dead ends: 988 [2019-11-23 22:35:46,957 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:46,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2019-11-23 22:35:46,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 986. [2019-11-23 22:35:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2019-11-23 22:35:46,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1465 transitions. [2019-11-23 22:35:46,987 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1465 transitions. Word has length 147 [2019-11-23 22:35:46,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:46,988 INFO L462 AbstractCegarLoop]: Abstraction has 986 states and 1465 transitions. [2019-11-23 22:35:46,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:46,989 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1465 transitions. [2019-11-23 22:35:46,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-23 22:35:46,991 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:46,991 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] [2019-11-23 22:35:46,991 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:46,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:46,992 INFO L82 PathProgramCache]: Analyzing trace with hash -734945277, now seen corresponding path program 1 times [2019-11-23 22:35:46,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:46,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594756746] [2019-11-23 22:35:46,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:47,312 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:47,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594756746] [2019-11-23 22:35:47,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:47,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:47,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780067072] [2019-11-23 22:35:47,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:47,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:47,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:47,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:47,315 INFO L87 Difference]: Start difference. First operand 986 states and 1465 transitions. Second operand 4 states. [2019-11-23 22:35:47,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:47,466 INFO L93 Difference]: Finished difference Result 2903 states and 4300 transitions. [2019-11-23 22:35:47,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:47,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-23 22:35:47,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:47,475 INFO L225 Difference]: With dead ends: 2903 [2019-11-23 22:35:47,476 INFO L226 Difference]: Without dead ends: 1926 [2019-11-23 22:35:47,478 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:47,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2019-11-23 22:35:47,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1878. [2019-11-23 22:35:47,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1878 states. [2019-11-23 22:35:47,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2778 transitions. [2019-11-23 22:35:47,547 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2778 transitions. Word has length 147 [2019-11-23 22:35:47,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:47,547 INFO L462 AbstractCegarLoop]: Abstraction has 1878 states and 2778 transitions. [2019-11-23 22:35:47,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:47,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2778 transitions. [2019-11-23 22:35:47,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 22:35:47,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:47,551 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] [2019-11-23 22:35:47,551 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:47,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:47,552 INFO L82 PathProgramCache]: Analyzing trace with hash -464497969, now seen corresponding path program 1 times [2019-11-23 22:35:47,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:47,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566073322] [2019-11-23 22:35:47,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:47,604 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:47,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566073322] [2019-11-23 22:35:47,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:47,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:47,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247212527] [2019-11-23 22:35:47,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:47,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:47,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:47,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:47,607 INFO L87 Difference]: Start difference. First operand 1878 states and 2778 transitions. Second operand 3 states. [2019-11-23 22:35:47,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:47,731 INFO L93 Difference]: Finished difference Result 5596 states and 8272 transitions. [2019-11-23 22:35:47,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:47,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-23 22:35:47,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:47,748 INFO L225 Difference]: With dead ends: 5596 [2019-11-23 22:35:47,749 INFO L226 Difference]: Without dead ends: 3746 [2019-11-23 22:35:47,753 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:47,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3746 states. [2019-11-23 22:35:47,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3746 to 1880. [2019-11-23 22:35:47,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1880 states. [2019-11-23 22:35:47,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2780 transitions. [2019-11-23 22:35:47,871 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2780 transitions. Word has length 148 [2019-11-23 22:35:47,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:47,872 INFO L462 AbstractCegarLoop]: Abstraction has 1880 states and 2780 transitions. [2019-11-23 22:35:47,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:47,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2780 transitions. [2019-11-23 22:35:47,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-23 22:35:47,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:47,875 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] [2019-11-23 22:35:47,876 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:47,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:47,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1286115900, now seen corresponding path program 1 times [2019-11-23 22:35:47,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:47,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469223984] [2019-11-23 22:35:47,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:48,023 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:48,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469223984] [2019-11-23 22:35:48,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:48,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:48,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074884167] [2019-11-23 22:35:48,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:48,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:48,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:48,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:48,025 INFO L87 Difference]: Start difference. First operand 1880 states and 2780 transitions. Second operand 3 states. [2019-11-23 22:35:48,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:48,195 INFO L93 Difference]: Finished difference Result 4936 states and 7286 transitions. [2019-11-23 22:35:48,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:48,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-23 22:35:48,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:48,211 INFO L225 Difference]: With dead ends: 4936 [2019-11-23 22:35:48,211 INFO L226 Difference]: Without dead ends: 3249 [2019-11-23 22:35:48,217 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:48,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2019-11-23 22:35:48,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 3201. [2019-11-23 22:35:48,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3201 states. [2019-11-23 22:35:48,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 4676 transitions. [2019-11-23 22:35:48,357 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 4676 transitions. Word has length 149 [2019-11-23 22:35:48,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:48,358 INFO L462 AbstractCegarLoop]: Abstraction has 3201 states and 4676 transitions. [2019-11-23 22:35:48,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:48,358 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 4676 transitions. [2019-11-23 22:35:48,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-23 22:35:48,363 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:48,363 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] [2019-11-23 22:35:48,363 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:48,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:48,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1559353287, now seen corresponding path program 1 times [2019-11-23 22:35:48,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:48,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268610509] [2019-11-23 22:35:48,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:48,700 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:48,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268610509] [2019-11-23 22:35:48,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:48,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:48,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393400041] [2019-11-23 22:35:48,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:48,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:48,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:48,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:48,704 INFO L87 Difference]: Start difference. First operand 3201 states and 4676 transitions. Second operand 4 states. [2019-11-23 22:35:48,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:48,866 INFO L93 Difference]: Finished difference Result 5769 states and 8443 transitions. [2019-11-23 22:35:48,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:48,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-23 22:35:48,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:48,885 INFO L225 Difference]: With dead ends: 5769 [2019-11-23 22:35:48,885 INFO L226 Difference]: Without dead ends: 2749 [2019-11-23 22:35:48,891 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:48,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2749 states. [2019-11-23 22:35:49,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2749 to 2749. [2019-11-23 22:35:49,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2749 states. [2019-11-23 22:35:49,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2749 states to 2749 states and 4012 transitions. [2019-11-23 22:35:49,030 INFO L78 Accepts]: Start accepts. Automaton has 2749 states and 4012 transitions. Word has length 149 [2019-11-23 22:35:49,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:49,030 INFO L462 AbstractCegarLoop]: Abstraction has 2749 states and 4012 transitions. [2019-11-23 22:35:49,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:49,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2749 states and 4012 transitions. [2019-11-23 22:35:49,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-23 22:35:49,035 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:49,035 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] [2019-11-23 22:35:49,035 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:49,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:49,036 INFO L82 PathProgramCache]: Analyzing trace with hash -828709836, now seen corresponding path program 1 times [2019-11-23 22:35:49,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:49,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923150930] [2019-11-23 22:35:49,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:49,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:49,093 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:49,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923150930] [2019-11-23 22:35:49,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:49,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:49,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162688807] [2019-11-23 22:35:49,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:49,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:49,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:49,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:49,096 INFO L87 Difference]: Start difference. First operand 2749 states and 4012 transitions. Second operand 3 states. [2019-11-23 22:35:49,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:49,259 INFO L93 Difference]: Finished difference Result 6270 states and 9372 transitions. [2019-11-23 22:35:49,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:49,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-11-23 22:35:49,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:49,277 INFO L225 Difference]: With dead ends: 6270 [2019-11-23 22:35:49,277 INFO L226 Difference]: Without dead ends: 3703 [2019-11-23 22:35:49,282 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:49,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3703 states. [2019-11-23 22:35:49,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3703 to 3617. [2019-11-23 22:35:49,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3617 states. [2019-11-23 22:35:49,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3617 states to 3617 states and 5423 transitions. [2019-11-23 22:35:49,503 INFO L78 Accepts]: Start accepts. Automaton has 3617 states and 5423 transitions. Word has length 150 [2019-11-23 22:35:49,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:49,504 INFO L462 AbstractCegarLoop]: Abstraction has 3617 states and 5423 transitions. [2019-11-23 22:35:49,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:49,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3617 states and 5423 transitions. [2019-11-23 22:35:49,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-23 22:35:49,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:49,509 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:49,509 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:49,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:49,510 INFO L82 PathProgramCache]: Analyzing trace with hash -2116909629, now seen corresponding path program 1 times [2019-11-23 22:35:49,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:49,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292716210] [2019-11-23 22:35:49,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:49,576 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:49,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292716210] [2019-11-23 22:35:49,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:49,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:49,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485865918] [2019-11-23 22:35:49,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:49,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:49,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:49,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:49,578 INFO L87 Difference]: Start difference. First operand 3617 states and 5423 transitions. Second operand 3 states. [2019-11-23 22:35:49,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:49,825 INFO L93 Difference]: Finished difference Result 9270 states and 14127 transitions. [2019-11-23 22:35:49,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:49,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-23 22:35:49,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:49,853 INFO L225 Difference]: With dead ends: 9270 [2019-11-23 22:35:49,853 INFO L226 Difference]: Without dead ends: 5919 [2019-11-23 22:35:49,859 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:49,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5919 states. [2019-11-23 22:35:50,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5919 to 5173. [2019-11-23 22:35:50,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5173 states. [2019-11-23 22:35:50,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5173 states to 5173 states and 7942 transitions. [2019-11-23 22:35:50,149 INFO L78 Accepts]: Start accepts. Automaton has 5173 states and 7942 transitions. Word has length 153 [2019-11-23 22:35:50,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:50,149 INFO L462 AbstractCegarLoop]: Abstraction has 5173 states and 7942 transitions. [2019-11-23 22:35:50,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:50,150 INFO L276 IsEmpty]: Start isEmpty. Operand 5173 states and 7942 transitions. [2019-11-23 22:35:50,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-23 22:35:50,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:50,154 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:50,154 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:50,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:50,155 INFO L82 PathProgramCache]: Analyzing trace with hash -520298944, now seen corresponding path program 1 times [2019-11-23 22:35:50,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:50,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831566955] [2019-11-23 22:35:50,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:50,272 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:50,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831566955] [2019-11-23 22:35:50,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:50,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:50,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804925207] [2019-11-23 22:35:50,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:35:50,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:50,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:35:50,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:35:50,280 INFO L87 Difference]: Start difference. First operand 5173 states and 7942 transitions. Second operand 5 states. [2019-11-23 22:35:50,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:50,710 INFO L93 Difference]: Finished difference Result 10170 states and 15660 transitions. [2019-11-23 22:35:50,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:35:50,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-11-23 22:35:50,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:50,747 INFO L225 Difference]: With dead ends: 10170 [2019-11-23 22:35:50,747 INFO L226 Difference]: Without dead ends: 5173 [2019-11-23 22:35:50,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:35:50,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5173 states. [2019-11-23 22:35:51,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5173 to 5173. [2019-11-23 22:35:51,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5173 states. [2019-11-23 22:35:51,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5173 states to 5173 states and 7897 transitions. [2019-11-23 22:35:51,103 INFO L78 Accepts]: Start accepts. Automaton has 5173 states and 7897 transitions. Word has length 153 [2019-11-23 22:35:51,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:51,104 INFO L462 AbstractCegarLoop]: Abstraction has 5173 states and 7897 transitions. [2019-11-23 22:35:51,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:35:51,104 INFO L276 IsEmpty]: Start isEmpty. Operand 5173 states and 7897 transitions. [2019-11-23 22:35:51,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-23 22:35:51,108 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:51,108 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:51,109 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:51,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:51,109 INFO L82 PathProgramCache]: Analyzing trace with hash 84319429, now seen corresponding path program 1 times [2019-11-23 22:35:51,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:51,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946801228] [2019-11-23 22:35:51,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:51,319 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:51,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946801228] [2019-11-23 22:35:51,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:51,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:51,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752976431] [2019-11-23 22:35:51,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:51,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:51,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:51,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:51,322 INFO L87 Difference]: Start difference. First operand 5173 states and 7897 transitions. Second operand 4 states. [2019-11-23 22:35:51,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:51,843 INFO L93 Difference]: Finished difference Result 13554 states and 20688 transitions. [2019-11-23 22:35:51,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:51,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-11-23 22:35:51,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:51,861 INFO L225 Difference]: With dead ends: 13554 [2019-11-23 22:35:51,861 INFO L226 Difference]: Without dead ends: 8400 [2019-11-23 22:35:51,870 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:51,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8400 states. [2019-11-23 22:35:52,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8400 to 8366. [2019-11-23 22:35:52,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8366 states. [2019-11-23 22:35:52,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8366 states to 8366 states and 12682 transitions. [2019-11-23 22:35:52,290 INFO L78 Accepts]: Start accepts. Automaton has 8366 states and 12682 transitions. Word has length 153 [2019-11-23 22:35:52,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:52,291 INFO L462 AbstractCegarLoop]: Abstraction has 8366 states and 12682 transitions. [2019-11-23 22:35:52,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:52,291 INFO L276 IsEmpty]: Start isEmpty. Operand 8366 states and 12682 transitions. [2019-11-23 22:35:52,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-23 22:35:52,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:52,299 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:52,299 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:52,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:52,299 INFO L82 PathProgramCache]: Analyzing trace with hash -486384364, now seen corresponding path program 1 times [2019-11-23 22:35:52,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:52,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333764097] [2019-11-23 22:35:52,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:52,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:52,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333764097] [2019-11-23 22:35:52,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:52,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:52,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357710927] [2019-11-23 22:35:52,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:52,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:52,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:52,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:52,502 INFO L87 Difference]: Start difference. First operand 8366 states and 12682 transitions. Second operand 3 states. [2019-11-23 22:35:53,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:53,022 INFO L93 Difference]: Finished difference Result 22553 states and 34204 transitions. [2019-11-23 22:35:53,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:53,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-23 22:35:53,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:53,066 INFO L225 Difference]: With dead ends: 22553 [2019-11-23 22:35:53,066 INFO L226 Difference]: Without dead ends: 14550 [2019-11-23 22:35:53,080 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:53,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14550 states. [2019-11-23 22:35:53,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14550 to 14520. [2019-11-23 22:35:53,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14520 states. [2019-11-23 22:35:53,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14520 states to 14520 states and 21768 transitions. [2019-11-23 22:35:53,736 INFO L78 Accepts]: Start accepts. Automaton has 14520 states and 21768 transitions. Word has length 155 [2019-11-23 22:35:53,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:53,736 INFO L462 AbstractCegarLoop]: Abstraction has 14520 states and 21768 transitions. [2019-11-23 22:35:53,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:53,736 INFO L276 IsEmpty]: Start isEmpty. Operand 14520 states and 21768 transitions. [2019-11-23 22:35:53,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-23 22:35:53,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:53,745 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:53,746 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:53,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:53,746 INFO L82 PathProgramCache]: Analyzing trace with hash 92409239, now seen corresponding path program 1 times [2019-11-23 22:35:53,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:53,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824729866] [2019-11-23 22:35:53,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:53,866 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:53,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824729866] [2019-11-23 22:35:53,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:53,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:53,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320137370] [2019-11-23 22:35:53,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:53,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:53,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:53,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:53,869 INFO L87 Difference]: Start difference. First operand 14520 states and 21768 transitions. Second operand 4 states. [2019-11-23 22:35:55,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:55,053 INFO L93 Difference]: Finished difference Result 24087 states and 36129 transitions. [2019-11-23 22:35:55,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:55,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-11-23 22:35:55,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:55,077 INFO L225 Difference]: With dead ends: 24087 [2019-11-23 22:35:55,077 INFO L226 Difference]: Without dead ends: 12978 [2019-11-23 22:35:55,091 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:55,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12978 states. [2019-11-23 22:35:55,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12978 to 12978. [2019-11-23 22:35:55,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12978 states. [2019-11-23 22:35:55,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12978 states to 12978 states and 19436 transitions. [2019-11-23 22:35:55,615 INFO L78 Accepts]: Start accepts. Automaton has 12978 states and 19436 transitions. Word has length 155 [2019-11-23 22:35:55,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:55,615 INFO L462 AbstractCegarLoop]: Abstraction has 12978 states and 19436 transitions. [2019-11-23 22:35:55,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:55,615 INFO L276 IsEmpty]: Start isEmpty. Operand 12978 states and 19436 transitions. [2019-11-23 22:35:55,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-23 22:35:55,624 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:55,624 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:55,625 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:55,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:55,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1657905896, now seen corresponding path program 1 times [2019-11-23 22:35:55,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:55,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279189095] [2019-11-23 22:35:55,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:55,685 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:55,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279189095] [2019-11-23 22:35:55,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:55,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:55,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237302163] [2019-11-23 22:35:55,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:55,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:55,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:55,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:55,687 INFO L87 Difference]: Start difference. First operand 12978 states and 19436 transitions. Second operand 3 states. [2019-11-23 22:35:56,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:56,394 INFO L93 Difference]: Finished difference Result 34908 states and 52966 transitions. [2019-11-23 22:35:56,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:56,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-11-23 22:35:56,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:56,435 INFO L225 Difference]: With dead ends: 34908 [2019-11-23 22:35:56,435 INFO L226 Difference]: Without dead ends: 22262 [2019-11-23 22:35:56,458 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:56,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22262 states. [2019-11-23 22:35:57,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22262 to 19902. [2019-11-23 22:35:57,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19902 states. [2019-11-23 22:35:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19902 states to 19902 states and 30451 transitions. [2019-11-23 22:35:57,310 INFO L78 Accepts]: Start accepts. Automaton has 19902 states and 30451 transitions. Word has length 159 [2019-11-23 22:35:57,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:57,310 INFO L462 AbstractCegarLoop]: Abstraction has 19902 states and 30451 transitions. [2019-11-23 22:35:57,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:57,310 INFO L276 IsEmpty]: Start isEmpty. Operand 19902 states and 30451 transitions. [2019-11-23 22:35:57,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-23 22:35:57,317 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:57,317 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:57,317 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:57,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:57,318 INFO L82 PathProgramCache]: Analyzing trace with hash -328127570, now seen corresponding path program 1 times [2019-11-23 22:35:57,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:57,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582113558] [2019-11-23 22:35:57,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:57,486 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:57,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582113558] [2019-11-23 22:35:57,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:57,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:35:57,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415550106] [2019-11-23 22:35:57,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:35:57,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:57,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:35:57,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:35:57,489 INFO L87 Difference]: Start difference. First operand 19902 states and 30451 transitions. Second operand 8 states. [2019-11-23 22:36:01,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:01,485 INFO L93 Difference]: Finished difference Result 81354 states and 125150 transitions. [2019-11-23 22:36:01,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 22:36:01,486 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 159 [2019-11-23 22:36:01,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:01,579 INFO L225 Difference]: With dead ends: 81354 [2019-11-23 22:36:01,579 INFO L226 Difference]: Without dead ends: 61858 [2019-11-23 22:36:01,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-11-23 22:36:01,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61858 states. [2019-11-23 22:36:03,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61858 to 32362. [2019-11-23 22:36:03,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32362 states. [2019-11-23 22:36:03,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32362 states to 32362 states and 49103 transitions. [2019-11-23 22:36:03,506 INFO L78 Accepts]: Start accepts. Automaton has 32362 states and 49103 transitions. Word has length 159 [2019-11-23 22:36:03,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:03,507 INFO L462 AbstractCegarLoop]: Abstraction has 32362 states and 49103 transitions. [2019-11-23 22:36:03,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:36:03,507 INFO L276 IsEmpty]: Start isEmpty. Operand 32362 states and 49103 transitions. [2019-11-23 22:36:03,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-23 22:36:03,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:03,513 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:36:03,514 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:03,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:03,514 INFO L82 PathProgramCache]: Analyzing trace with hash -830198051, now seen corresponding path program 1 times [2019-11-23 22:36:03,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:03,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763255020] [2019-11-23 22:36:03,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:03,704 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:03,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763255020] [2019-11-23 22:36:03,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:03,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:36:03,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278434775] [2019-11-23 22:36:03,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:36:03,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:03,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:36:03,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:36:03,706 INFO L87 Difference]: Start difference. First operand 32362 states and 49103 transitions. Second operand 4 states. [2019-11-23 22:36:07,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:07,714 INFO L93 Difference]: Finished difference Result 89851 states and 135975 transitions. [2019-11-23 22:36:07,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:36:07,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-11-23 22:36:07,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:07,791 INFO L225 Difference]: With dead ends: 89851 [2019-11-23 22:36:07,791 INFO L226 Difference]: Without dead ends: 57528 [2019-11-23 22:36:07,825 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:07,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57528 states. [2019-11-23 22:36:10,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57528 to 57452. [2019-11-23 22:36:10,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57452 states. [2019-11-23 22:36:10,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57452 states to 57452 states and 85906 transitions. [2019-11-23 22:36:10,689 INFO L78 Accepts]: Start accepts. Automaton has 57452 states and 85906 transitions. Word has length 159 [2019-11-23 22:36:10,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:10,689 INFO L462 AbstractCegarLoop]: Abstraction has 57452 states and 85906 transitions. [2019-11-23 22:36:10,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:36:10,689 INFO L276 IsEmpty]: Start isEmpty. Operand 57452 states and 85906 transitions. [2019-11-23 22:36:10,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-23 22:36:10,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:10,698 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:36:10,698 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:10,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:10,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1278999897, now seen corresponding path program 1 times [2019-11-23 22:36:10,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:10,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806952273] [2019-11-23 22:36:10,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:10,739 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,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806952273] [2019-11-23 22:36:10,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:10,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:36:10,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117216700] [2019-11-23 22:36:10,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:36:10,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:10,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:36:10,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:36:10,741 INFO L87 Difference]: Start difference. First operand 57452 states and 85906 transitions. Second operand 3 states. [2019-11-23 22:36:17,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:17,381 INFO L93 Difference]: Finished difference Result 172164 states and 257471 transitions. [2019-11-23 22:36:17,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:36:17,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-11-23 22:36:17,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:17,542 INFO L225 Difference]: With dead ends: 172164 [2019-11-23 22:36:17,542 INFO L226 Difference]: Without dead ends: 114817 [2019-11-23 22:36:17,594 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:17,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114817 states. [2019-11-23 22:36:20,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114817 to 57458. [2019-11-23 22:36:20,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57458 states. [2019-11-23 22:36:21,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57458 states to 57458 states and 85912 transitions. [2019-11-23 22:36:21,007 INFO L78 Accepts]: Start accepts. Automaton has 57458 states and 85912 transitions. Word has length 160 [2019-11-23 22:36:21,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:21,007 INFO L462 AbstractCegarLoop]: Abstraction has 57458 states and 85912 transitions. [2019-11-23 22:36:21,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:36:21,008 INFO L276 IsEmpty]: Start isEmpty. Operand 57458 states and 85912 transitions. [2019-11-23 22:36:21,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-23 22:36:21,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:21,015 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] [2019-11-23 22:36:21,016 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:21,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:21,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1649820476, now seen corresponding path program 1 times [2019-11-23 22:36:21,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:21,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677614015] [2019-11-23 22:36:21,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:21,145 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:21,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677614015] [2019-11-23 22:36:21,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:21,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:36:21,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034834255] [2019-11-23 22:36:21,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:36:21,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:21,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:36:21,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:36:21,147 INFO L87 Difference]: Start difference. First operand 57458 states and 85912 transitions. Second operand 4 states. [2019-11-23 22:36:25,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:25,062 INFO L93 Difference]: Finished difference Result 114878 states and 171772 transitions. [2019-11-23 22:36:25,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:36:25,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-11-23 22:36:25,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:25,135 INFO L225 Difference]: With dead ends: 114878 [2019-11-23 22:36:25,135 INFO L226 Difference]: Without dead ends: 57452 [2019-11-23 22:36:25,176 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:36:25,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57452 states. [2019-11-23 22:36:28,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57452 to 57452. [2019-11-23 22:36:28,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57452 states. [2019-11-23 22:36:28,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57452 states to 57452 states and 85900 transitions. [2019-11-23 22:36:28,469 INFO L78 Accepts]: Start accepts. Automaton has 57452 states and 85900 transitions. Word has length 161 [2019-11-23 22:36:28,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:28,469 INFO L462 AbstractCegarLoop]: Abstraction has 57452 states and 85900 transitions. [2019-11-23 22:36:28,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:36:28,469 INFO L276 IsEmpty]: Start isEmpty. Operand 57452 states and 85900 transitions. [2019-11-23 22:36:28,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-23 22:36:28,477 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:28,477 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] [2019-11-23 22:36:28,477 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:28,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:28,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1431815238, now seen corresponding path program 1 times [2019-11-23 22:36:28,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:28,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977645785] [2019-11-23 22:36:28,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:28,559 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:28,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977645785] [2019-11-23 22:36:28,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:28,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:36:28,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858035374] [2019-11-23 22:36:28,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:36:28,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:28,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:36:28,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:36:28,561 INFO L87 Difference]: Start difference. First operand 57452 states and 85900 transitions. Second operand 3 states. [2019-11-23 22:36:33,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:33,948 INFO L93 Difference]: Finished difference Result 140607 states and 210071 transitions. [2019-11-23 22:36:33,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:36:33,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-11-23 22:36:33,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:34,052 INFO L225 Difference]: With dead ends: 140607 [2019-11-23 22:36:34,052 INFO L226 Difference]: Without dead ends: 83895 [2019-11-23 22:36:34,087 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:34,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83895 states. [2019-11-23 22:36:38,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83895 to 83819. [2019-11-23 22:36:38,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83819 states. [2019-11-23 22:36:38,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83819 states to 83819 states and 123775 transitions. [2019-11-23 22:36:38,755 INFO L78 Accepts]: Start accepts. Automaton has 83819 states and 123775 transitions. Word has length 161 [2019-11-23 22:36:38,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:38,756 INFO L462 AbstractCegarLoop]: Abstraction has 83819 states and 123775 transitions. [2019-11-23 22:36:38,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:36:38,756 INFO L276 IsEmpty]: Start isEmpty. Operand 83819 states and 123775 transitions. [2019-11-23 22:36:38,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-23 22:36:38,767 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:38,767 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:36:38,768 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:38,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:38,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1429871558, now seen corresponding path program 1 times [2019-11-23 22:36:38,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:38,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563760873] [2019-11-23 22:36:38,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:38,955 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:38,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563760873] [2019-11-23 22:36:38,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:38,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:36:38,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226993204] [2019-11-23 22:36:38,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:36:38,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:38,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:36:38,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:36:38,957 INFO L87 Difference]: Start difference. First operand 83819 states and 123775 transitions. Second operand 9 states. [2019-11-23 22:37:01,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:01,705 INFO L93 Difference]: Finished difference Result 399311 states and 589198 transitions. [2019-11-23 22:37:01,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 22:37:01,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 166 [2019-11-23 22:37:01,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:02,178 INFO L225 Difference]: With dead ends: 399311 [2019-11-23 22:37:02,178 INFO L226 Difference]: Without dead ends: 345711 [2019-11-23 22:37:02,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-11-23 22:37:02,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345711 states.