/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.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:35:24,698 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:35:24,700 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:35:24,712 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:35:24,712 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:35:24,713 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:35:24,715 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:35:24,718 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:35:24,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:35:24,721 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:35:24,725 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:35:24,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:35:24,727 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:35:24,727 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:35:24,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:35:24,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:35:24,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:35:24,732 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:35:24,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:35:24,738 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:35:24,740 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:35:24,741 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:35:24,742 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:35:24,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:35:24,747 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:35:24,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:35:24,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:35:24,750 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:35:24,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:35:24,753 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:35:24,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:35:24,754 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:35:24,754 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:35:24,755 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:35:24,758 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:35:24,759 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:35:24,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:35:24,760 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:35:24,760 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:35:24,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:35:24,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:35:24,764 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:24,798 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:35:24,798 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:35:24,800 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:35:24,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:35:24,803 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:35:24,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:35:24,803 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:35:24,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:35:24,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:35:24,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:35:24,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:35:24,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:35:24,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:35:24,804 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:35:24,805 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:35:24,805 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:35:24,805 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:35:24,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:35:24,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:35:24,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:35:24,806 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:35:24,807 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:35:24,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:35:24,807 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:35:24,808 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:35:24,808 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:35:24,808 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:35:24,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:35:24,808 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:35:24,808 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:35:25,057 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:35:25,070 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:35:25,073 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:35:25,075 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:35:25,075 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:35:25,076 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.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-23 22:35:25,133 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91882556d/8520f80af2f7494abeb60cf63127258f/FLAG1274840a0 [2019-11-23 22:35:25,718 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:35:25,719 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-23 22:35:25,736 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91882556d/8520f80af2f7494abeb60cf63127258f/FLAG1274840a0 [2019-11-23 22:35:25,957 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91882556d/8520f80af2f7494abeb60cf63127258f [2019-11-23 22:35:25,966 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:35:25,968 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:35:25,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:35:25,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:35:25,974 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:35:25,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:35:25" (1/1) ... [2019-11-23 22:35:25,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57eace34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:25, skipping insertion in model container [2019-11-23 22:35:25,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:35:25" (1/1) ... [2019-11-23 22:35:25,986 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:35:26,047 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:35:26,735 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:35:26,763 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:35:27,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:35:27,164 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:35:27,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:27 WrapperNode [2019-11-23 22:35:27,165 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:35:27,166 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:35:27,166 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:35:27,167 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:35:27,173 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:27" (1/1) ... [2019-11-23 22:35:27,193 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:27" (1/1) ... [2019-11-23 22:35:27,262 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:35:27,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:35:27,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:35:27,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:35:27,277 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:27" (1/1) ... [2019-11-23 22:35:27,277 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:27" (1/1) ... [2019-11-23 22:35:27,289 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:27" (1/1) ... [2019-11-23 22:35:27,289 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:27" (1/1) ... [2019-11-23 22:35:27,324 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:27" (1/1) ... [2019-11-23 22:35:27,342 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:27" (1/1) ... [2019-11-23 22:35:27,348 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:27" (1/1) ... [2019-11-23 22:35:27,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:35:27,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:35:27,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:35:27,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:35:27,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:35:27,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:35:27,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:35:29,201 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:35:29,205 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-23 22:35:29,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:35:29 BoogieIcfgContainer [2019-11-23 22:35:29,208 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:35:29,209 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:35:29,209 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:35:29,215 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:35:29,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:35:25" (1/3) ... [2019-11-23 22:35:29,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33311df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:35:29, skipping insertion in model container [2019-11-23 22:35:29,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:27" (2/3) ... [2019-11-23 22:35:29,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33311df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:35:29, skipping insertion in model container [2019-11-23 22:35:29,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:35:29" (3/3) ... [2019-11-23 22:35:29,221 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-23 22:35:29,231 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:35:29,242 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-23 22:35:29,253 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-23 22:35:29,295 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:35:29,295 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:35:29,295 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:35:29,295 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:35:29,295 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:35:29,295 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:35:29,296 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:35:29,296 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:35:29,318 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states. [2019-11-23 22:35:29,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-23 22:35:29,334 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:29,335 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] [2019-11-23 22:35:29,336 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:29,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:29,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1495225560, now seen corresponding path program 1 times [2019-11-23 22:35:29,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:29,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630755559] [2019-11-23 22:35:29,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:29,888 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:29,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630755559] [2019-11-23 22:35:29,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:29,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:29,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434216632] [2019-11-23 22:35:29,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:29,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:29,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:29,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:29,914 INFO L87 Difference]: Start difference. First operand 400 states. Second operand 3 states. [2019-11-23 22:35:30,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:30,146 INFO L93 Difference]: Finished difference Result 737 states and 1302 transitions. [2019-11-23 22:35:30,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:30,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-11-23 22:35:30,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:30,175 INFO L225 Difference]: With dead ends: 737 [2019-11-23 22:35:30,175 INFO L226 Difference]: Without dead ends: 603 [2019-11-23 22:35:30,182 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:30,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-11-23 22:35:30,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2019-11-23 22:35:30,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-11-23 22:35:30,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 883 transitions. [2019-11-23 22:35:30,308 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 883 transitions. Word has length 145 [2019-11-23 22:35:30,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:30,312 INFO L462 AbstractCegarLoop]: Abstraction has 601 states and 883 transitions. [2019-11-23 22:35:30,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:30,312 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 883 transitions. [2019-11-23 22:35:30,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-23 22:35:30,321 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:30,322 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] [2019-11-23 22:35:30,322 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:30,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:30,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1494794584, now seen corresponding path program 1 times [2019-11-23 22:35:30,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:30,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052941744] [2019-11-23 22:35:30,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:30,793 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:30,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052941744] [2019-11-23 22:35:30,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:30,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:30,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914305528] [2019-11-23 22:35:30,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:30,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:30,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:30,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:30,799 INFO L87 Difference]: Start difference. First operand 601 states and 883 transitions. Second operand 4 states. [2019-11-23 22:35:30,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:30,937 INFO L93 Difference]: Finished difference Result 1766 states and 2586 transitions. [2019-11-23 22:35:30,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:30,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-11-23 22:35:30,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:30,944 INFO L225 Difference]: With dead ends: 1766 [2019-11-23 22:35:30,944 INFO L226 Difference]: Without dead ends: 1174 [2019-11-23 22:35:30,951 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:30,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2019-11-23 22:35:31,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1134. [2019-11-23 22:35:31,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1134 states. [2019-11-23 22:35:31,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1662 transitions. [2019-11-23 22:35:31,009 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1662 transitions. Word has length 145 [2019-11-23 22:35:31,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:31,010 INFO L462 AbstractCegarLoop]: Abstraction has 1134 states and 1662 transitions. [2019-11-23 22:35:31,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:31,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1662 transitions. [2019-11-23 22:35:31,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-23 22:35:31,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:31,020 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] [2019-11-23 22:35:31,020 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:31,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:31,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1642675868, now seen corresponding path program 1 times [2019-11-23 22:35:31,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:31,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669585227] [2019-11-23 22:35:31,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:31,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:31,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669585227] [2019-11-23 22:35:31,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:31,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:31,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770101645] [2019-11-23 22:35:31,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:31,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:31,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:31,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:31,108 INFO L87 Difference]: Start difference. First operand 1134 states and 1662 transitions. Second operand 3 states. [2019-11-23 22:35:31,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:31,209 INFO L93 Difference]: Finished difference Result 3364 states and 4924 transitions. [2019-11-23 22:35:31,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:31,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-11-23 22:35:31,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:31,225 INFO L225 Difference]: With dead ends: 3364 [2019-11-23 22:35:31,225 INFO L226 Difference]: Without dead ends: 2258 [2019-11-23 22:35:31,227 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:31,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2019-11-23 22:35:31,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 1136. [2019-11-23 22:35:31,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1136 states. [2019-11-23 22:35:31,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1664 transitions. [2019-11-23 22:35:31,292 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1664 transitions. Word has length 146 [2019-11-23 22:35:31,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:31,293 INFO L462 AbstractCegarLoop]: Abstraction has 1136 states and 1664 transitions. [2019-11-23 22:35:31,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:31,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1664 transitions. [2019-11-23 22:35:31,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-23 22:35:31,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:31,303 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:31,303 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:31,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:31,304 INFO L82 PathProgramCache]: Analyzing trace with hash -341862217, now seen corresponding path program 1 times [2019-11-23 22:35:31,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:31,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259022643] [2019-11-23 22:35:31,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:31,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:31,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259022643] [2019-11-23 22:35:31,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:31,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:31,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907414675] [2019-11-23 22:35:31,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:31,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:31,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:31,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:31,522 INFO L87 Difference]: Start difference. First operand 1136 states and 1664 transitions. Second operand 4 states. [2019-11-23 22:35:31,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:31,589 INFO L93 Difference]: Finished difference Result 2262 states and 3314 transitions. [2019-11-23 22:35:31,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:31,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-23 22:35:31,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:31,595 INFO L225 Difference]: With dead ends: 2262 [2019-11-23 22:35:31,595 INFO L226 Difference]: Without dead ends: 1134 [2019-11-23 22:35:31,598 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:31,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2019-11-23 22:35:31,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1134. [2019-11-23 22:35:31,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1134 states. [2019-11-23 22:35:31,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1660 transitions. [2019-11-23 22:35:31,666 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1660 transitions. Word has length 147 [2019-11-23 22:35:31,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:31,667 INFO L462 AbstractCegarLoop]: Abstraction has 1134 states and 1660 transitions. [2019-11-23 22:35:31,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:31,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1660 transitions. [2019-11-23 22:35:31,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-23 22:35:31,670 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:31,670 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:31,670 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:31,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:31,671 INFO L82 PathProgramCache]: Analyzing trace with hash 973934955, now seen corresponding path program 1 times [2019-11-23 22:35:31,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:31,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707481565] [2019-11-23 22:35:31,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:31,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:31,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707481565] [2019-11-23 22:35:31,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:31,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:31,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094707502] [2019-11-23 22:35:31,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:31,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:31,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:31,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:31,820 INFO L87 Difference]: Start difference. First operand 1134 states and 1660 transitions. Second operand 3 states. [2019-11-23 22:35:31,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:31,956 INFO L93 Difference]: Finished difference Result 2636 states and 3860 transitions. [2019-11-23 22:35:31,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:31,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-11-23 22:35:31,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:31,969 INFO L225 Difference]: With dead ends: 2636 [2019-11-23 22:35:31,971 INFO L226 Difference]: Without dead ends: 1695 [2019-11-23 22:35:31,974 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:31,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2019-11-23 22:35:32,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1655. [2019-11-23 22:35:32,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1655 states. [2019-11-23 22:35:32,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2397 transitions. [2019-11-23 22:35:32,107 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2397 transitions. Word has length 147 [2019-11-23 22:35:32,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:32,109 INFO L462 AbstractCegarLoop]: Abstraction has 1655 states and 2397 transitions. [2019-11-23 22:35:32,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:32,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2397 transitions. [2019-11-23 22:35:32,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 22:35:32,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:32,116 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:32,116 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:32,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:32,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1439929385, now seen corresponding path program 1 times [2019-11-23 22:35:32,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:32,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179933071] [2019-11-23 22:35:32,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:32,220 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:32,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179933071] [2019-11-23 22:35:32,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:32,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:32,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917359726] [2019-11-23 22:35:32,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:32,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:32,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:32,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:32,225 INFO L87 Difference]: Start difference. First operand 1655 states and 2397 transitions. Second operand 3 states. [2019-11-23 22:35:32,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:32,382 INFO L93 Difference]: Finished difference Result 3573 states and 5304 transitions. [2019-11-23 22:35:32,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:32,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-23 22:35:32,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:32,394 INFO L225 Difference]: With dead ends: 3573 [2019-11-23 22:35:32,394 INFO L226 Difference]: Without dead ends: 2103 [2019-11-23 22:35:32,399 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:32,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2103 states. [2019-11-23 22:35:32,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2103 to 2071. [2019-11-23 22:35:32,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2019-11-23 22:35:32,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 3073 transitions. [2019-11-23 22:35:32,576 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 3073 transitions. Word has length 148 [2019-11-23 22:35:32,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:32,577 INFO L462 AbstractCegarLoop]: Abstraction has 2071 states and 3073 transitions. [2019-11-23 22:35:32,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:32,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 3073 transitions. [2019-11-23 22:35:32,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-23 22:35:32,581 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:32,581 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] [2019-11-23 22:35:32,581 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:32,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:32,582 INFO L82 PathProgramCache]: Analyzing trace with hash -879962432, now seen corresponding path program 1 times [2019-11-23 22:35:32,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:32,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663855503] [2019-11-23 22:35:32,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:32,811 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:32,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663855503] [2019-11-23 22:35:32,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:32,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:35:32,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417130585] [2019-11-23 22:35:32,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:35:32,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:32,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:35:32,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:35:32,813 INFO L87 Difference]: Start difference. First operand 2071 states and 3073 transitions. Second operand 8 states. [2019-11-23 22:35:34,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:34,537 INFO L93 Difference]: Finished difference Result 9953 states and 15525 transitions. [2019-11-23 22:35:34,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 22:35:34,538 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 151 [2019-11-23 22:35:34,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:34,578 INFO L225 Difference]: With dead ends: 9953 [2019-11-23 22:35:34,579 INFO L226 Difference]: Without dead ends: 8925 [2019-11-23 22:35:34,583 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2019-11-23 22:35:34,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8925 states. [2019-11-23 22:35:34,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8925 to 4635. [2019-11-23 22:35:34,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4635 states. [2019-11-23 22:35:34,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4635 states to 4635 states and 6996 transitions. [2019-11-23 22:35:34,861 INFO L78 Accepts]: Start accepts. Automaton has 4635 states and 6996 transitions. Word has length 151 [2019-11-23 22:35:34,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:34,862 INFO L462 AbstractCegarLoop]: Abstraction has 4635 states and 6996 transitions. [2019-11-23 22:35:34,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:35:34,862 INFO L276 IsEmpty]: Start isEmpty. Operand 4635 states and 6996 transitions. [2019-11-23 22:35:34,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-23 22:35:34,867 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:34,868 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] [2019-11-23 22:35:34,868 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:34,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:34,868 INFO L82 PathProgramCache]: Analyzing trace with hash 739797792, now seen corresponding path program 1 times [2019-11-23 22:35:34,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:34,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909135127] [2019-11-23 22:35:34,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:35,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:35,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909135127] [2019-11-23 22:35:35,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:35,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:35:35,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816179259] [2019-11-23 22:35:35,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:35:35,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:35,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:35:35,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:35:35,168 INFO L87 Difference]: Start difference. First operand 4635 states and 6996 transitions. Second operand 9 states. [2019-11-23 22:35:36,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:36,168 INFO L93 Difference]: Finished difference Result 8661 states and 13299 transitions. [2019-11-23 22:35:36,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 22:35:36,169 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 151 [2019-11-23 22:35:36,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:36,198 INFO L225 Difference]: With dead ends: 8661 [2019-11-23 22:35:36,199 INFO L226 Difference]: Without dead ends: 4379 [2019-11-23 22:35:36,205 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-11-23 22:35:36,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4379 states. [2019-11-23 22:35:36,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4379 to 2484. [2019-11-23 22:35:36,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2484 states. [2019-11-23 22:35:36,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2484 states to 2484 states and 3662 transitions. [2019-11-23 22:35:36,411 INFO L78 Accepts]: Start accepts. Automaton has 2484 states and 3662 transitions. Word has length 151 [2019-11-23 22:35:36,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:36,412 INFO L462 AbstractCegarLoop]: Abstraction has 2484 states and 3662 transitions. [2019-11-23 22:35:36,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:35:36,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2484 states and 3662 transitions. [2019-11-23 22:35:36,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-23 22:35:36,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:36,417 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] [2019-11-23 22:35:36,417 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:36,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:36,417 INFO L82 PathProgramCache]: Analyzing trace with hash -274452600, now seen corresponding path program 1 times [2019-11-23 22:35:36,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:36,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380718115] [2019-11-23 22:35:36,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:36,610 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:36,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380718115] [2019-11-23 22:35:36,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:36,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:36,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654493769] [2019-11-23 22:35:36,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:36,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:36,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:36,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:36,617 INFO L87 Difference]: Start difference. First operand 2484 states and 3662 transitions. Second operand 4 states. [2019-11-23 22:35:36,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:36,908 INFO L93 Difference]: Finished difference Result 6546 states and 9643 transitions. [2019-11-23 22:35:36,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:36,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-11-23 22:35:36,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:36,948 INFO L225 Difference]: With dead ends: 6546 [2019-11-23 22:35:36,948 INFO L226 Difference]: Without dead ends: 4081 [2019-11-23 22:35:36,954 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:36,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4081 states. [2019-11-23 22:35:37,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4081 to 4047. [2019-11-23 22:35:37,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4047 states. [2019-11-23 22:35:37,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4047 states to 4047 states and 5915 transitions. [2019-11-23 22:35:37,247 INFO L78 Accepts]: Start accepts. Automaton has 4047 states and 5915 transitions. Word has length 151 [2019-11-23 22:35:37,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:37,247 INFO L462 AbstractCegarLoop]: Abstraction has 4047 states and 5915 transitions. [2019-11-23 22:35:37,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:37,247 INFO L276 IsEmpty]: Start isEmpty. Operand 4047 states and 5915 transitions. [2019-11-23 22:35:37,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-23 22:35:37,251 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:37,251 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:37,252 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:37,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:37,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1442339308, now seen corresponding path program 1 times [2019-11-23 22:35:37,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:37,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870062468] [2019-11-23 22:35:37,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:37,391 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:37,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870062468] [2019-11-23 22:35:37,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:37,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:37,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715971704] [2019-11-23 22:35:37,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:37,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:37,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:37,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:37,394 INFO L87 Difference]: Start difference. First operand 4047 states and 5915 transitions. Second operand 4 states. [2019-11-23 22:35:37,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:37,616 INFO L93 Difference]: Finished difference Result 7332 states and 10743 transitions. [2019-11-23 22:35:37,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:37,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-11-23 22:35:37,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:37,625 INFO L225 Difference]: With dead ends: 7332 [2019-11-23 22:35:37,625 INFO L226 Difference]: Without dead ends: 4047 [2019-11-23 22:35:37,630 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:37,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4047 states. [2019-11-23 22:35:37,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4047 to 4047. [2019-11-23 22:35:37,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4047 states. [2019-11-23 22:35:37,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4047 states to 4047 states and 5914 transitions. [2019-11-23 22:35:37,894 INFO L78 Accepts]: Start accepts. Automaton has 4047 states and 5914 transitions. Word has length 153 [2019-11-23 22:35:37,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:37,894 INFO L462 AbstractCegarLoop]: Abstraction has 4047 states and 5914 transitions. [2019-11-23 22:35:37,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:37,895 INFO L276 IsEmpty]: Start isEmpty. Operand 4047 states and 5914 transitions. [2019-11-23 22:35:37,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-23 22:35:37,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:37,899 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:37,899 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:37,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:37,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1454349143, now seen corresponding path program 1 times [2019-11-23 22:35:37,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:37,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110848384] [2019-11-23 22:35:37,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:37,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:37,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110848384] [2019-11-23 22:35:37,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:37,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:37,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294257819] [2019-11-23 22:35:37,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:37,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:37,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:37,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:37,979 INFO L87 Difference]: Start difference. First operand 4047 states and 5914 transitions. Second operand 3 states. [2019-11-23 22:35:38,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:38,294 INFO L93 Difference]: Finished difference Result 9893 states and 14511 transitions. [2019-11-23 22:35:38,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:38,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-23 22:35:38,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:38,308 INFO L225 Difference]: With dead ends: 9893 [2019-11-23 22:35:38,308 INFO L226 Difference]: Without dead ends: 6202 [2019-11-23 22:35:38,314 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:38,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6202 states. [2019-11-23 22:35:38,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6202 to 6172. [2019-11-23 22:35:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6172 states. [2019-11-23 22:35:38,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6172 states to 6172 states and 8913 transitions. [2019-11-23 22:35:38,656 INFO L78 Accepts]: Start accepts. Automaton has 6172 states and 8913 transitions. Word has length 153 [2019-11-23 22:35:38,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:38,656 INFO L462 AbstractCegarLoop]: Abstraction has 6172 states and 8913 transitions. [2019-11-23 22:35:38,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:38,656 INFO L276 IsEmpty]: Start isEmpty. Operand 6172 states and 8913 transitions. [2019-11-23 22:35:38,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-23 22:35:38,662 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:38,662 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:35:38,663 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:38,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:38,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1869869251, now seen corresponding path program 1 times [2019-11-23 22:35:38,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:38,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833596122] [2019-11-23 22:35:38,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:38,725 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:38,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833596122] [2019-11-23 22:35:38,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:38,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:38,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604950403] [2019-11-23 22:35:38,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:38,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:38,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:38,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:38,727 INFO L87 Difference]: Start difference. First operand 6172 states and 8913 transitions. Second operand 3 states. [2019-11-23 22:35:39,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:39,299 INFO L93 Difference]: Finished difference Result 15857 states and 23336 transitions. [2019-11-23 22:35:39,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:39,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-11-23 22:35:39,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:39,322 INFO L225 Difference]: With dead ends: 15857 [2019-11-23 22:35:39,322 INFO L226 Difference]: Without dead ends: 10022 [2019-11-23 22:35:39,330 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:39,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10022 states. [2019-11-23 22:35:39,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10022 to 9036. [2019-11-23 22:35:39,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9036 states. [2019-11-23 22:35:39,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9036 states to 9036 states and 13448 transitions. [2019-11-23 22:35:39,821 INFO L78 Accepts]: Start accepts. Automaton has 9036 states and 13448 transitions. Word has length 157 [2019-11-23 22:35:39,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:39,822 INFO L462 AbstractCegarLoop]: Abstraction has 9036 states and 13448 transitions. [2019-11-23 22:35:39,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:39,822 INFO L276 IsEmpty]: Start isEmpty. Operand 9036 states and 13448 transitions. [2019-11-23 22:35:39,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-23 22:35:39,827 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:39,827 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:35:39,828 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:39,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:39,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1411777473, now seen corresponding path program 1 times [2019-11-23 22:35:39,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:39,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773929381] [2019-11-23 22:35:39,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:40,007 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:40,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773929381] [2019-11-23 22:35:40,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:40,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:35:40,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816252753] [2019-11-23 22:35:40,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:35:40,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:40,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:35:40,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:35:40,010 INFO L87 Difference]: Start difference. First operand 9036 states and 13448 transitions. Second operand 9 states. [2019-11-23 22:35:42,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:42,564 INFO L93 Difference]: Finished difference Result 37629 states and 57224 transitions. [2019-11-23 22:35:42,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 22:35:42,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 157 [2019-11-23 22:35:42,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:42,624 INFO L225 Difference]: With dead ends: 37629 [2019-11-23 22:35:42,624 INFO L226 Difference]: Without dead ends: 29004 [2019-11-23 22:35:42,637 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:35:42,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29004 states. [2019-11-23 22:35:43,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29004 to 18720. [2019-11-23 22:35:43,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18720 states. [2019-11-23 22:35:43,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18720 states to 18720 states and 28038 transitions. [2019-11-23 22:35:43,956 INFO L78 Accepts]: Start accepts. Automaton has 18720 states and 28038 transitions. Word has length 157 [2019-11-23 22:35:43,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:43,956 INFO L462 AbstractCegarLoop]: Abstraction has 18720 states and 28038 transitions. [2019-11-23 22:35:43,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:35:43,957 INFO L276 IsEmpty]: Start isEmpty. Operand 18720 states and 28038 transitions. [2019-11-23 22:35:43,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-23 22:35:43,962 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:43,962 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:35:43,962 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:43,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:43,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1913416978, now seen corresponding path program 1 times [2019-11-23 22:35:43,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:43,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683232497] [2019-11-23 22:35:43,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:44,165 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:44,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683232497] [2019-11-23 22:35:44,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:44,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:44,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084152176] [2019-11-23 22:35:44,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:44,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:44,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:44,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:44,167 INFO L87 Difference]: Start difference. First operand 18720 states and 28038 transitions. Second operand 4 states. [2019-11-23 22:35:46,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:46,430 INFO L93 Difference]: Finished difference Result 52648 states and 78764 transitions. [2019-11-23 22:35:46,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:46,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-23 22:35:46,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:46,480 INFO L225 Difference]: With dead ends: 52648 [2019-11-23 22:35:46,481 INFO L226 Difference]: Without dead ends: 33967 [2019-11-23 22:35:46,502 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:46,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33967 states. [2019-11-23 22:35:48,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33967 to 33915. [2019-11-23 22:35:48,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33915 states. [2019-11-23 22:35:48,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33915 states to 33915 states and 50278 transitions. [2019-11-23 22:35:48,619 INFO L78 Accepts]: Start accepts. Automaton has 33915 states and 50278 transitions. Word has length 157 [2019-11-23 22:35:48,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:48,620 INFO L462 AbstractCegarLoop]: Abstraction has 33915 states and 50278 transitions. [2019-11-23 22:35:48,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:48,620 INFO L276 IsEmpty]: Start isEmpty. Operand 33915 states and 50278 transitions. [2019-11-23 22:35:48,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-23 22:35:48,628 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:48,628 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] [2019-11-23 22:35:48,628 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:35:48,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:48,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1414227080, now seen corresponding path program 1 times [2019-11-23 22:35:48,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:48,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516251830] [2019-11-23 22:35:48,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:48,668 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,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516251830] [2019-11-23 22:35:48,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:48,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:48,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380444151] [2019-11-23 22:35:48,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:48,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:48,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:48,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:48,670 INFO L87 Difference]: Start difference. First operand 33915 states and 50278 transitions. Second operand 3 states. [2019-11-23 22:35:52,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:52,572 INFO L93 Difference]: Finished difference Result 101551 states and 150583 transitions. [2019-11-23 22:35:52,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:52,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-23 22:35:52,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:52,645 INFO L225 Difference]: With dead ends: 101551 [2019-11-23 22:35:52,645 INFO L226 Difference]: Without dead ends: 67742 [2019-11-23 22:35:52,681 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:52,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67742 states. [2019-11-23 22:35:55,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67742 to 33921. [2019-11-23 22:35:55,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33921 states. [2019-11-23 22:35:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33921 states to 33921 states and 50284 transitions. [2019-11-23 22:35:55,077 INFO L78 Accepts]: Start accepts. Automaton has 33921 states and 50284 transitions. Word has length 158 [2019-11-23 22:35:55,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:55,077 INFO L462 AbstractCegarLoop]: Abstraction has 33921 states and 50284 transitions. [2019-11-23 22:35:55,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:55,078 INFO L276 IsEmpty]: Start isEmpty. Operand 33921 states and 50284 transitions. [2019-11-23 22:35:55,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-23 22:35:55,085 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:55,085 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:35:55,085 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:35:55,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:55,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1806961421, now seen corresponding path program 1 times [2019-11-23 22:35:55,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:55,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638385462] [2019-11-23 22:35:55,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:55,197 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,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638385462] [2019-11-23 22:35:55,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:55,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:55,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419339837] [2019-11-23 22:35:55,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:55,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:55,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:55,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:55,199 INFO L87 Difference]: Start difference. First operand 33921 states and 50284 transitions. Second operand 4 states. [2019-11-23 22:35:58,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:58,594 INFO L93 Difference]: Finished difference Result 67804 states and 100516 transitions. [2019-11-23 22:35:58,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:58,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-11-23 22:35:58,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:58,633 INFO L225 Difference]: With dead ends: 67804 [2019-11-23 22:35:58,633 INFO L226 Difference]: Without dead ends: 33915 [2019-11-23 22:35:58,654 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:58,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33915 states. [2019-11-23 22:36:00,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33915 to 33915. [2019-11-23 22:36:00,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33915 states. [2019-11-23 22:36:00,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33915 states to 33915 states and 50272 transitions. [2019-11-23 22:36:00,633 INFO L78 Accepts]: Start accepts. Automaton has 33915 states and 50272 transitions. Word has length 159 [2019-11-23 22:36:00,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:00,633 INFO L462 AbstractCegarLoop]: Abstraction has 33915 states and 50272 transitions. [2019-11-23 22:36:00,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:36:00,634 INFO L276 IsEmpty]: Start isEmpty. Operand 33915 states and 50272 transitions. [2019-11-23 22:36:00,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-23 22:36:00,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:00,639 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:00,639 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:00,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:00,640 INFO L82 PathProgramCache]: Analyzing trace with hash 13436701, now seen corresponding path program 1 times [2019-11-23 22:36:00,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:00,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227341264] [2019-11-23 22:36:00,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:00,726 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:00,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227341264] [2019-11-23 22:36:00,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:00,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:36:00,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510352727] [2019-11-23 22:36:00,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:36:00,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:00,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:36:00,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:36:00,728 INFO L87 Difference]: Start difference. First operand 33915 states and 50272 transitions. Second operand 3 states. [2019-11-23 22:36:03,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:03,835 INFO L93 Difference]: Finished difference Result 84718 states and 125622 transitions. [2019-11-23 22:36:03,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:36:03,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-11-23 22:36:03,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:03,894 INFO L225 Difference]: With dead ends: 84718 [2019-11-23 22:36:03,894 INFO L226 Difference]: Without dead ends: 51552 [2019-11-23 22:36:03,917 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:03,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51552 states. [2019-11-23 22:36:08,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51552 to 51500. [2019-11-23 22:36:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51500 states. [2019-11-23 22:36:08,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51500 states to 51500 states and 75572 transitions. [2019-11-23 22:36:08,513 INFO L78 Accepts]: Start accepts. Automaton has 51500 states and 75572 transitions. Word has length 159 [2019-11-23 22:36:08,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:08,513 INFO L462 AbstractCegarLoop]: Abstraction has 51500 states and 75572 transitions. [2019-11-23 22:36:08,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:36:08,513 INFO L276 IsEmpty]: Start isEmpty. Operand 51500 states and 75572 transitions. [2019-11-23 22:36:08,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 22:36:08,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:08,522 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] [2019-11-23 22:36:08,522 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:08,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:08,522 INFO L82 PathProgramCache]: Analyzing trace with hash 685945559, now seen corresponding path program 1 times [2019-11-23 22:36:08,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:08,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586503050] [2019-11-23 22:36:08,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:08,589 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:08,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586503050] [2019-11-23 22:36:08,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:08,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:36:08,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057125055] [2019-11-23 22:36:08,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:36:08,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:08,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:36:08,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:36:08,592 INFO L87 Difference]: Start difference. First operand 51500 states and 75572 transitions. Second operand 3 states. [2019-11-23 22:36:13,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:13,549 INFO L93 Difference]: Finished difference Result 124426 states and 183753 transitions. [2019-11-23 22:36:13,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:36:13,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-23 22:36:13,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:13,636 INFO L225 Difference]: With dead ends: 124426 [2019-11-23 22:36:13,636 INFO L226 Difference]: Without dead ends: 80803 [2019-11-23 22:36:13,658 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:13,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80803 states. [2019-11-23 22:36:18,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80803 to 76306. [2019-11-23 22:36:18,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76306 states. [2019-11-23 22:36:18,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76306 states to 76306 states and 113119 transitions. [2019-11-23 22:36:18,414 INFO L78 Accepts]: Start accepts. Automaton has 76306 states and 113119 transitions. Word has length 163 [2019-11-23 22:36:18,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:18,415 INFO L462 AbstractCegarLoop]: Abstraction has 76306 states and 113119 transitions. [2019-11-23 22:36:18,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:36:18,415 INFO L276 IsEmpty]: Start isEmpty. Operand 76306 states and 113119 transitions. [2019-11-23 22:36:18,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-23 22:36:18,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:18,422 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] [2019-11-23 22:36:18,423 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:18,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:18,423 INFO L82 PathProgramCache]: Analyzing trace with hash 361471566, now seen corresponding path program 1 times [2019-11-23 22:36:18,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:18,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467180468] [2019-11-23 22:36:18,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:18,716 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:18,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467180468] [2019-11-23 22:36:18,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:18,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:36:18,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221449776] [2019-11-23 22:36:18,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:36:18,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:18,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:36:18,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:36:18,718 INFO L87 Difference]: Start difference. First operand 76306 states and 113119 transitions. Second operand 9 states. [2019-11-23 22:36:51,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:51,181 INFO L93 Difference]: Finished difference Result 476382 states and 699238 transitions. [2019-11-23 22:36:51,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 22:36:51,181 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 164 [2019-11-23 22:36:51,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:51,767 INFO L225 Difference]: With dead ends: 476382 [2019-11-23 22:36:51,767 INFO L226 Difference]: Without dead ends: 401995 [2019-11-23 22:36:51,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600