/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/eca-rers2012/Problem03_label54.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:57:02,705 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:57:02,708 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:57:02,725 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:57:02,725 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:57:02,726 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:57:02,728 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:57:02,730 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:57:02,731 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:57:02,732 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:57:02,733 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:57:02,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:57:02,735 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:57:02,736 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:57:02,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:57:02,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:57:02,739 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:57:02,740 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:57:02,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:57:02,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:57:02,745 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:57:02,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:57:02,747 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:57:02,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:57:02,753 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:57:02,753 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:57:02,754 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:57:02,754 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:57:02,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:57:02,758 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:57:02,759 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:57:02,759 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:57:02,760 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:57:02,764 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:57:02,765 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:57:02,765 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:57:02,768 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:57:02,769 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:57:02,769 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:57:02,770 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:57:02,770 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:57:02,774 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 20:57:02,792 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:57:02,793 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:57:02,794 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:57:02,794 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:57:02,794 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:57:02,794 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:57:02,795 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:57:02,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:57:02,795 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:57:02,795 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:57:02,795 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:57:02,796 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:57:02,796 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:57:02,796 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:57:02,796 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:57:02,796 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:57:02,797 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:57:02,797 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:57:02,797 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:57:02,797 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:57:02,797 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:57:02,798 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:57:02,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:57:02,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:57:02,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:57:02,799 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:57:02,799 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:57:02,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:57:02,799 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:57:02,799 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:57:03,076 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:57:03,094 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:57:03,098 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:57:03,099 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:57:03,100 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:57:03,101 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label54.c [2019-11-23 20:57:03,178 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/020b04320/088846fb24114cb1baa13e7ed1a29520/FLAGd74aa02d2 [2019-11-23 20:57:03,802 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:57:03,802 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label54.c [2019-11-23 20:57:03,823 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/020b04320/088846fb24114cb1baa13e7ed1a29520/FLAGd74aa02d2 [2019-11-23 20:57:03,985 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/020b04320/088846fb24114cb1baa13e7ed1a29520 [2019-11-23 20:57:03,996 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:57:03,997 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:57:03,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:57:03,999 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:57:04,002 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:57:04,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:57:03" (1/1) ... [2019-11-23 20:57:04,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f7bf8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:04, skipping insertion in model container [2019-11-23 20:57:04,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:57:03" (1/1) ... [2019-11-23 20:57:04,015 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:57:04,110 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:57:04,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:57:05,012 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:57:05,478 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:57:05,500 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:57:05,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:05 WrapperNode [2019-11-23 20:57:05,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:57:05,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:57:05,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:57:05,502 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:57:05,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:05" (1/1) ... [2019-11-23 20:57:05,553 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:05" (1/1) ... [2019-11-23 20:57:05,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:57:05,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:57:05,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:57:05,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:57:05,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:05" (1/1) ... [2019-11-23 20:57:05,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:05" (1/1) ... [2019-11-23 20:57:05,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:05" (1/1) ... [2019-11-23 20:57:05,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:05" (1/1) ... [2019-11-23 20:57:05,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:05" (1/1) ... [2019-11-23 20:57:05,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:05" (1/1) ... [2019-11-23 20:57:05,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:05" (1/1) ... [2019-11-23 20:57:05,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:57:05,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:57:05,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:57:05,803 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:57:05,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:05" (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 20:57:05,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:57:05,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:57:07,935 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:57:07,935 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:57:07,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:57:07 BoogieIcfgContainer [2019-11-23 20:57:07,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:57:07,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:57:07,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:57:07,943 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:57:07,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:57:03" (1/3) ... [2019-11-23 20:57:07,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27604962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:57:07, skipping insertion in model container [2019-11-23 20:57:07,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:05" (2/3) ... [2019-11-23 20:57:07,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27604962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:57:07, skipping insertion in model container [2019-11-23 20:57:07,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:57:07" (3/3) ... [2019-11-23 20:57:07,949 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label54.c [2019-11-23 20:57:07,960 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:57:07,971 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:57:07,984 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:57:08,030 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:57:08,031 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:57:08,031 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:57:08,031 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:57:08,032 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:57:08,032 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:57:08,033 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:57:08,033 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:57:08,067 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-23 20:57:08,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-23 20:57:08,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:08,090 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:57:08,091 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:08,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:08,099 INFO L82 PathProgramCache]: Analyzing trace with hash -590757190, now seen corresponding path program 1 times [2019-11-23 20:57:08,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:08,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433696904] [2019-11-23 20:57:08,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:08,789 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 20:57:08,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433696904] [2019-11-23 20:57:08,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:08,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:57:08,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13455684] [2019-11-23 20:57:08,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:08,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:08,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:08,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:08,816 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 3 states. [2019-11-23 20:57:10,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:10,285 INFO L93 Difference]: Finished difference Result 829 states and 1478 transitions. [2019-11-23 20:57:10,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:10,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-11-23 20:57:10,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:10,308 INFO L225 Difference]: With dead ends: 829 [2019-11-23 20:57:10,308 INFO L226 Difference]: Without dead ends: 463 [2019-11-23 20:57:10,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 20:57:10,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-11-23 20:57:10,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 449. [2019-11-23 20:57:10,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-23 20:57:10,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 725 transitions. [2019-11-23 20:57:10,389 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 725 transitions. Word has length 166 [2019-11-23 20:57:10,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:10,391 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 725 transitions. [2019-11-23 20:57:10,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:10,391 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 725 transitions. [2019-11-23 20:57:10,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-23 20:57:10,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:10,396 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:57:10,396 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:10,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:10,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1027354506, now seen corresponding path program 1 times [2019-11-23 20:57:10,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:10,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939260738] [2019-11-23 20:57:10,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:10,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:57:10,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939260738] [2019-11-23 20:57:10,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:10,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:10,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730247532] [2019-11-23 20:57:10,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:57:10,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:10,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:57:10,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:10,546 INFO L87 Difference]: Start difference. First operand 449 states and 725 transitions. Second operand 4 states. [2019-11-23 20:57:12,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:12,365 INFO L93 Difference]: Finished difference Result 1737 states and 2828 transitions. [2019-11-23 20:57:12,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:57:12,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-11-23 20:57:12,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:12,374 INFO L225 Difference]: With dead ends: 1737 [2019-11-23 20:57:12,374 INFO L226 Difference]: Without dead ends: 1290 [2019-11-23 20:57:12,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:12,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-11-23 20:57:12,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 859. [2019-11-23 20:57:12,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-11-23 20:57:12,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1316 transitions. [2019-11-23 20:57:12,425 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1316 transitions. Word has length 171 [2019-11-23 20:57:12,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:12,425 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1316 transitions. [2019-11-23 20:57:12,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:57:12,425 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1316 transitions. [2019-11-23 20:57:12,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-23 20:57:12,439 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:12,439 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:57:12,440 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:12,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:12,440 INFO L82 PathProgramCache]: Analyzing trace with hash 560447781, now seen corresponding path program 1 times [2019-11-23 20:57:12,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:12,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943513664] [2019-11-23 20:57:12,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:12,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:57:12,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943513664] [2019-11-23 20:57:12,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:12,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:12,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328180551] [2019-11-23 20:57:12,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:12,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:12,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:12,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:12,716 INFO L87 Difference]: Start difference. First operand 859 states and 1316 transitions. Second operand 3 states. [2019-11-23 20:57:13,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:13,767 INFO L93 Difference]: Finished difference Result 2541 states and 3900 transitions. [2019-11-23 20:57:13,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:13,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-11-23 20:57:13,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:13,777 INFO L225 Difference]: With dead ends: 2541 [2019-11-23 20:57:13,777 INFO L226 Difference]: Without dead ends: 1684 [2019-11-23 20:57:13,779 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 20:57:13,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2019-11-23 20:57:13,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1682. [2019-11-23 20:57:13,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2019-11-23 20:57:13,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2434 transitions. [2019-11-23 20:57:13,817 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2434 transitions. Word has length 173 [2019-11-23 20:57:13,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:13,818 INFO L462 AbstractCegarLoop]: Abstraction has 1682 states and 2434 transitions. [2019-11-23 20:57:13,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:13,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2434 transitions. [2019-11-23 20:57:13,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-23 20:57:13,823 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:13,823 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:57:13,823 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:13,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:13,824 INFO L82 PathProgramCache]: Analyzing trace with hash 2004202496, now seen corresponding path program 1 times [2019-11-23 20:57:13,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:13,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398246644] [2019-11-23 20:57:13,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:13,912 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-23 20:57:13,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398246644] [2019-11-23 20:57:13,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:13,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:57:13,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101392272] [2019-11-23 20:57:13,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:13,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:13,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:13,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:13,915 INFO L87 Difference]: Start difference. First operand 1682 states and 2434 transitions. Second operand 3 states. [2019-11-23 20:57:14,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:14,340 INFO L93 Difference]: Finished difference Result 5027 states and 7280 transitions. [2019-11-23 20:57:14,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:14,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-11-23 20:57:14,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:14,356 INFO L225 Difference]: With dead ends: 5027 [2019-11-23 20:57:14,357 INFO L226 Difference]: Without dead ends: 3347 [2019-11-23 20:57:14,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 20:57:14,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3347 states. [2019-11-23 20:57:14,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3347 to 3343. [2019-11-23 20:57:14,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3343 states. [2019-11-23 20:57:14,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3343 states to 3343 states and 4837 transitions. [2019-11-23 20:57:14,430 INFO L78 Accepts]: Start accepts. Automaton has 3343 states and 4837 transitions. Word has length 186 [2019-11-23 20:57:14,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:14,431 INFO L462 AbstractCegarLoop]: Abstraction has 3343 states and 4837 transitions. [2019-11-23 20:57:14,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:14,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3343 states and 4837 transitions. [2019-11-23 20:57:14,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-23 20:57:14,437 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:14,437 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:57:14,438 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:14,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:14,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1182972067, now seen corresponding path program 1 times [2019-11-23 20:57:14,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:14,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326145156] [2019-11-23 20:57:14,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:14,524 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:57:14,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326145156] [2019-11-23 20:57:14,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:14,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:14,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509116617] [2019-11-23 20:57:14,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:57:14,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:14,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:57:14,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:14,527 INFO L87 Difference]: Start difference. First operand 3343 states and 4837 transitions. Second operand 4 states. [2019-11-23 20:57:16,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:16,262 INFO L93 Difference]: Finished difference Result 13212 states and 19138 transitions. [2019-11-23 20:57:16,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:57:16,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-11-23 20:57:16,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:16,307 INFO L225 Difference]: With dead ends: 13212 [2019-11-23 20:57:16,307 INFO L226 Difference]: Without dead ends: 9871 [2019-11-23 20:57:16,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:16,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9871 states. [2019-11-23 20:57:16,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9871 to 6599. [2019-11-23 20:57:16,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6599 states. [2019-11-23 20:57:16,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6599 states to 6599 states and 9124 transitions. [2019-11-23 20:57:16,460 INFO L78 Accepts]: Start accepts. Automaton has 6599 states and 9124 transitions. Word has length 189 [2019-11-23 20:57:16,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:16,462 INFO L462 AbstractCegarLoop]: Abstraction has 6599 states and 9124 transitions. [2019-11-23 20:57:16,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:57:16,462 INFO L276 IsEmpty]: Start isEmpty. Operand 6599 states and 9124 transitions. [2019-11-23 20:57:16,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-23 20:57:16,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:16,474 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:57:16,475 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:16,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:16,475 INFO L82 PathProgramCache]: Analyzing trace with hash 564713384, now seen corresponding path program 1 times [2019-11-23 20:57:16,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:16,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086165184] [2019-11-23 20:57:16,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:16,571 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 20:57:16,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086165184] [2019-11-23 20:57:16,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:16,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:57:16,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322374975] [2019-11-23 20:57:16,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:16,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:16,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:16,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:16,575 INFO L87 Difference]: Start difference. First operand 6599 states and 9124 transitions. Second operand 3 states. [2019-11-23 20:57:17,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:17,251 INFO L93 Difference]: Finished difference Result 13146 states and 18178 transitions. [2019-11-23 20:57:17,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:17,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-11-23 20:57:17,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:17,281 INFO L225 Difference]: With dead ends: 13146 [2019-11-23 20:57:17,282 INFO L226 Difference]: Without dead ends: 6549 [2019-11-23 20:57:17,292 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 20:57:17,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6549 states. [2019-11-23 20:57:17,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6549 to 6549. [2019-11-23 20:57:17,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6549 states. [2019-11-23 20:57:17,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6549 states to 6549 states and 8900 transitions. [2019-11-23 20:57:17,436 INFO L78 Accepts]: Start accepts. Automaton has 6549 states and 8900 transitions. Word has length 201 [2019-11-23 20:57:17,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:17,437 INFO L462 AbstractCegarLoop]: Abstraction has 6549 states and 8900 transitions. [2019-11-23 20:57:17,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:17,437 INFO L276 IsEmpty]: Start isEmpty. Operand 6549 states and 8900 transitions. [2019-11-23 20:57:17,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-23 20:57:17,448 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:17,448 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:57:17,448 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:17,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:17,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1766135422, now seen corresponding path program 1 times [2019-11-23 20:57:17,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:17,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319634776] [2019-11-23 20:57:17,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:57:17,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319634776] [2019-11-23 20:57:17,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:17,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:57:17,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105805646] [2019-11-23 20:57:17,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:57:17,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:17,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:57:17,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:57:17,660 INFO L87 Difference]: Start difference. First operand 6549 states and 8900 transitions. Second operand 5 states. [2019-11-23 20:57:20,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:20,153 INFO L93 Difference]: Finished difference Result 14742 states and 20173 transitions. [2019-11-23 20:57:20,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:57:20,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-11-23 20:57:20,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:20,182 INFO L225 Difference]: With dead ends: 14742 [2019-11-23 20:57:20,182 INFO L226 Difference]: Without dead ends: 8195 [2019-11-23 20:57:20,191 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:57:20,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8195 states. [2019-11-23 20:57:20,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8195 to 6955. [2019-11-23 20:57:20,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6955 states. [2019-11-23 20:57:20,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6955 states to 6955 states and 9402 transitions. [2019-11-23 20:57:20,336 INFO L78 Accepts]: Start accepts. Automaton has 6955 states and 9402 transitions. Word has length 204 [2019-11-23 20:57:20,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:20,336 INFO L462 AbstractCegarLoop]: Abstraction has 6955 states and 9402 transitions. [2019-11-23 20:57:20,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:57:20,336 INFO L276 IsEmpty]: Start isEmpty. Operand 6955 states and 9402 transitions. [2019-11-23 20:57:20,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-23 20:57:20,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:20,344 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:57:20,345 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:20,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:20,345 INFO L82 PathProgramCache]: Analyzing trace with hash -563684781, now seen corresponding path program 1 times [2019-11-23 20:57:20,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:20,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113618864] [2019-11-23 20:57:20,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:20,431 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:57:20,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113618864] [2019-11-23 20:57:20,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:20,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:20,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297146734] [2019-11-23 20:57:20,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:20,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:20,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:20,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:20,434 INFO L87 Difference]: Start difference. First operand 6955 states and 9402 transitions. Second operand 3 states. [2019-11-23 20:57:21,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:21,374 INFO L93 Difference]: Finished difference Result 13914 states and 18813 transitions. [2019-11-23 20:57:21,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:21,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-11-23 20:57:21,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:21,392 INFO L225 Difference]: With dead ends: 13914 [2019-11-23 20:57:21,392 INFO L226 Difference]: Without dead ends: 6961 [2019-11-23 20:57:21,402 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 20:57:21,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6961 states. [2019-11-23 20:57:21,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6961 to 6955. [2019-11-23 20:57:21,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6955 states. [2019-11-23 20:57:21,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6955 states to 6955 states and 8976 transitions. [2019-11-23 20:57:21,493 INFO L78 Accepts]: Start accepts. Automaton has 6955 states and 8976 transitions. Word has length 204 [2019-11-23 20:57:21,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:21,494 INFO L462 AbstractCegarLoop]: Abstraction has 6955 states and 8976 transitions. [2019-11-23 20:57:21,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:21,494 INFO L276 IsEmpty]: Start isEmpty. Operand 6955 states and 8976 transitions. [2019-11-23 20:57:21,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-23 20:57:21,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:21,502 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:57:21,503 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:21,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:21,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1016650501, now seen corresponding path program 1 times [2019-11-23 20:57:21,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:21,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157067822] [2019-11-23 20:57:21,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:21,577 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-23 20:57:21,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157067822] [2019-11-23 20:57:21,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:21,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:21,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665497021] [2019-11-23 20:57:21,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:21,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:21,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:21,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:21,580 INFO L87 Difference]: Start difference. First operand 6955 states and 8976 transitions. Second operand 3 states. [2019-11-23 20:57:22,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:22,649 INFO L93 Difference]: Finished difference Result 19596 states and 25237 transitions. [2019-11-23 20:57:22,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:22,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-11-23 20:57:22,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:22,672 INFO L225 Difference]: With dead ends: 19596 [2019-11-23 20:57:22,672 INFO L226 Difference]: Without dead ends: 12643 [2019-11-23 20:57:22,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 20:57:22,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12643 states. [2019-11-23 20:57:22,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12643 to 12639. [2019-11-23 20:57:22,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12639 states. [2019-11-23 20:57:22,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12639 states to 12639 states and 14935 transitions. [2019-11-23 20:57:22,847 INFO L78 Accepts]: Start accepts. Automaton has 12639 states and 14935 transitions. Word has length 210 [2019-11-23 20:57:22,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:22,848 INFO L462 AbstractCegarLoop]: Abstraction has 12639 states and 14935 transitions. [2019-11-23 20:57:22,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:22,848 INFO L276 IsEmpty]: Start isEmpty. Operand 12639 states and 14935 transitions. [2019-11-23 20:57:22,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-11-23 20:57:22,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:22,863 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:57:22,864 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:22,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:22,864 INFO L82 PathProgramCache]: Analyzing trace with hash -513494624, now seen corresponding path program 1 times [2019-11-23 20:57:22,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:22,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127644480] [2019-11-23 20:57:22,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:22,974 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-23 20:57:22,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127644480] [2019-11-23 20:57:22,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:22,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:22,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133944301] [2019-11-23 20:57:22,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:22,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:22,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:22,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:22,977 INFO L87 Difference]: Start difference. First operand 12639 states and 14935 transitions. Second operand 3 states. [2019-11-23 20:57:24,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:24,024 INFO L93 Difference]: Finished difference Result 30757 states and 36877 transitions. [2019-11-23 20:57:24,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:24,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2019-11-23 20:57:24,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:24,054 INFO L225 Difference]: With dead ends: 30757 [2019-11-23 20:57:24,054 INFO L226 Difference]: Without dead ends: 18120 [2019-11-23 20:57:24,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 20:57:24,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18120 states. [2019-11-23 20:57:24,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18120 to 18120. [2019-11-23 20:57:24,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18120 states. [2019-11-23 20:57:24,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18120 states to 18120 states and 20736 transitions. [2019-11-23 20:57:24,318 INFO L78 Accepts]: Start accepts. Automaton has 18120 states and 20736 transitions. Word has length 236 [2019-11-23 20:57:24,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:24,327 INFO L462 AbstractCegarLoop]: Abstraction has 18120 states and 20736 transitions. [2019-11-23 20:57:24,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:24,327 INFO L276 IsEmpty]: Start isEmpty. Operand 18120 states and 20736 transitions. [2019-11-23 20:57:24,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-11-23 20:57:24,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:24,342 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:57:24,342 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:24,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:24,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1649515910, now seen corresponding path program 1 times [2019-11-23 20:57:24,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:24,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096191990] [2019-11-23 20:57:24,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:24,548 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:57:24,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096191990] [2019-11-23 20:57:24,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:24,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:24,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841883594] [2019-11-23 20:57:24,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:24,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:24,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:24,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:24,551 INFO L87 Difference]: Start difference. First operand 18120 states and 20736 transitions. Second operand 3 states. [2019-11-23 20:57:25,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:25,496 INFO L93 Difference]: Finished difference Result 42950 states and 49334 transitions. [2019-11-23 20:57:25,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:25,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-11-23 20:57:25,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:25,527 INFO L225 Difference]: With dead ends: 42950 [2019-11-23 20:57:25,527 INFO L226 Difference]: Without dead ends: 24832 [2019-11-23 20:57:25,552 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 20:57:25,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24832 states. [2019-11-23 20:57:26,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24832 to 24819. [2019-11-23 20:57:26,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24819 states. [2019-11-23 20:57:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24819 states to 24819 states and 28237 transitions. [2019-11-23 20:57:26,651 INFO L78 Accepts]: Start accepts. Automaton has 24819 states and 28237 transitions. Word has length 240 [2019-11-23 20:57:26,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:26,652 INFO L462 AbstractCegarLoop]: Abstraction has 24819 states and 28237 transitions. [2019-11-23 20:57:26,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:26,652 INFO L276 IsEmpty]: Start isEmpty. Operand 24819 states and 28237 transitions. [2019-11-23 20:57:26,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-11-23 20:57:26,684 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:26,685 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:57:26,685 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:26,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:26,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1754135256, now seen corresponding path program 1 times [2019-11-23 20:57:26,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:26,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567442378] [2019-11-23 20:57:26,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:26,967 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:57:26,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567442378] [2019-11-23 20:57:26,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:26,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:26,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791129236] [2019-11-23 20:57:26,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:57:26,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:26,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:57:26,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:26,969 INFO L87 Difference]: Start difference. First operand 24819 states and 28237 transitions. Second operand 4 states. [2019-11-23 20:57:27,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:27,683 INFO L93 Difference]: Finished difference Result 92565 states and 105448 transitions. [2019-11-23 20:57:27,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:57:27,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 296 [2019-11-23 20:57:27,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:27,758 INFO L225 Difference]: With dead ends: 92565 [2019-11-23 20:57:27,758 INFO L226 Difference]: Without dead ends: 67748 [2019-11-23 20:57:27,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:27,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67748 states. [2019-11-23 20:57:28,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67748 to 43337. [2019-11-23 20:57:28,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43337 states. [2019-11-23 20:57:28,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43337 states to 43337 states and 49461 transitions. [2019-11-23 20:57:28,614 INFO L78 Accepts]: Start accepts. Automaton has 43337 states and 49461 transitions. Word has length 296 [2019-11-23 20:57:28,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:28,614 INFO L462 AbstractCegarLoop]: Abstraction has 43337 states and 49461 transitions. [2019-11-23 20:57:28,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:57:28,615 INFO L276 IsEmpty]: Start isEmpty. Operand 43337 states and 49461 transitions. [2019-11-23 20:57:28,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-11-23 20:57:28,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:28,642 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:57:28,642 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:28,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:28,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1044487096, now seen corresponding path program 1 times [2019-11-23 20:57:28,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:28,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512305757] [2019-11-23 20:57:28,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:28,918 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 20:57:28,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512305757] [2019-11-23 20:57:28,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:28,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:28,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484527046] [2019-11-23 20:57:28,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:57:28,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:28,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:57:28,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:28,920 INFO L87 Difference]: Start difference. First operand 43337 states and 49461 transitions. Second operand 4 states. [2019-11-23 20:57:30,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:30,577 INFO L93 Difference]: Finished difference Result 122882 states and 140384 transitions. [2019-11-23 20:57:30,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:57:30,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 317 [2019-11-23 20:57:30,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:30,644 INFO L225 Difference]: With dead ends: 122882 [2019-11-23 20:57:30,644 INFO L226 Difference]: Without dead ends: 79547 [2019-11-23 20:57:30,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:30,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79547 states. [2019-11-23 20:57:32,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79547 to 79545. [2019-11-23 20:57:32,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79545 states. [2019-11-23 20:57:32,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79545 states to 79545 states and 90903 transitions. [2019-11-23 20:57:32,923 INFO L78 Accepts]: Start accepts. Automaton has 79545 states and 90903 transitions. Word has length 317 [2019-11-23 20:57:32,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:32,924 INFO L462 AbstractCegarLoop]: Abstraction has 79545 states and 90903 transitions. [2019-11-23 20:57:32,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:57:32,924 INFO L276 IsEmpty]: Start isEmpty. Operand 79545 states and 90903 transitions. [2019-11-23 20:57:32,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-11-23 20:57:32,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:32,960 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:57:32,960 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:32,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:32,960 INFO L82 PathProgramCache]: Analyzing trace with hash -875944340, now seen corresponding path program 1 times [2019-11-23 20:57:32,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:32,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475269043] [2019-11-23 20:57:32,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-11-23 20:57:33,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475269043] [2019-11-23 20:57:33,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:33,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:33,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061808045] [2019-11-23 20:57:33,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:57:33,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:33,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:57:33,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:33,134 INFO L87 Difference]: Start difference. First operand 79545 states and 90903 transitions. Second operand 4 states. [2019-11-23 20:57:35,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:35,742 INFO L93 Difference]: Finished difference Result 288882 states and 330108 transitions. [2019-11-23 20:57:35,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:57:35,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 389 [2019-11-23 20:57:35,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:35,941 INFO L225 Difference]: With dead ends: 288882 [2019-11-23 20:57:35,941 INFO L226 Difference]: Without dead ends: 209339 [2019-11-23 20:57:35,997 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:36,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209339 states. [2019-11-23 20:57:40,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209339 to 209327. [2019-11-23 20:57:40,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209327 states. [2019-11-23 20:57:40,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209327 states to 209327 states and 238905 transitions. [2019-11-23 20:57:40,464 INFO L78 Accepts]: Start accepts. Automaton has 209327 states and 238905 transitions. Word has length 389 [2019-11-23 20:57:40,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:40,464 INFO L462 AbstractCegarLoop]: Abstraction has 209327 states and 238905 transitions. [2019-11-23 20:57:40,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:57:40,465 INFO L276 IsEmpty]: Start isEmpty. Operand 209327 states and 238905 transitions. [2019-11-23 20:57:40,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2019-11-23 20:57:40,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:40,549 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:57:40,549 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:40,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:40,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1124837717, now seen corresponding path program 1 times [2019-11-23 20:57:40,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:40,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584452635] [2019-11-23 20:57:40,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:40,786 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-11-23 20:57:40,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584452635] [2019-11-23 20:57:40,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:40,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:40,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881066660] [2019-11-23 20:57:40,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:57:40,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:40,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:57:40,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:40,788 INFO L87 Difference]: Start difference. First operand 209327 states and 238905 transitions. Second operand 4 states. [2019-11-23 20:57:43,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:43,349 INFO L93 Difference]: Finished difference Result 414986 states and 473830 transitions. [2019-11-23 20:57:43,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:57:43,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 450 [2019-11-23 20:57:43,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:43,553 INFO L225 Difference]: With dead ends: 414986 [2019-11-23 20:57:43,553 INFO L226 Difference]: Without dead ends: 205661 [2019-11-23 20:57:43,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:43,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205661 states. [2019-11-23 20:57:49,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205661 to 194293. [2019-11-23 20:57:49,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194293 states. [2019-11-23 20:57:49,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194293 states to 194293 states and 214783 transitions. [2019-11-23 20:57:49,681 INFO L78 Accepts]: Start accepts. Automaton has 194293 states and 214783 transitions. Word has length 450 [2019-11-23 20:57:49,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:49,681 INFO L462 AbstractCegarLoop]: Abstraction has 194293 states and 214783 transitions. [2019-11-23 20:57:49,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:57:49,681 INFO L276 IsEmpty]: Start isEmpty. Operand 194293 states and 214783 transitions. [2019-11-23 20:57:49,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2019-11-23 20:57:49,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:49,747 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:57:49,747 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:49,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:49,747 INFO L82 PathProgramCache]: Analyzing trace with hash 556265015, now seen corresponding path program 1 times [2019-11-23 20:57:49,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:49,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525549471] [2019-11-23 20:57:49,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:50,058 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2019-11-23 20:57:50,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525549471] [2019-11-23 20:57:50,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:50,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:57:50,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525867451] [2019-11-23 20:57:50,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:57:50,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:50,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:57:50,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:57:50,061 INFO L87 Difference]: Start difference. First operand 194293 states and 214783 transitions. Second operand 5 states. [2019-11-23 20:57:55,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:55,478 INFO L93 Difference]: Finished difference Result 488176 states and 536468 transitions. [2019-11-23 20:57:55,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:57:55,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 504 [2019-11-23 20:57:55,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:55,754 INFO L225 Difference]: With dead ends: 488176 [2019-11-23 20:57:55,754 INFO L226 Difference]: Without dead ends: 293885 [2019-11-23 20:57:55,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:57:56,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293885 states. [2019-11-23 20:57:58,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293885 to 284499. [2019-11-23 20:57:58,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284499 states. [2019-11-23 20:58:03,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284499 states to 284499 states and 311821 transitions. [2019-11-23 20:58:03,928 INFO L78 Accepts]: Start accepts. Automaton has 284499 states and 311821 transitions. Word has length 504 [2019-11-23 20:58:03,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:58:03,929 INFO L462 AbstractCegarLoop]: Abstraction has 284499 states and 311821 transitions. [2019-11-23 20:58:03,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:58:03,929 INFO L276 IsEmpty]: Start isEmpty. Operand 284499 states and 311821 transitions. [2019-11-23 20:58:04,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2019-11-23 20:58:04,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:58:04,020 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:58:04,021 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:58:04,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:58:04,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1409970701, now seen corresponding path program 1 times [2019-11-23 20:58:04,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:58:04,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072847971] [2019-11-23 20:58:04,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:58:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:58:04,271 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2019-11-23 20:58:04,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072847971] [2019-11-23 20:58:04,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:58:04,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:58:04,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109943359] [2019-11-23 20:58:04,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:58:04,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:58:04,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:58:04,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:58:04,273 INFO L87 Difference]: Start difference. First operand 284499 states and 311821 transitions. Second operand 4 states. [2019-11-23 20:58:07,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:58:07,380 INFO L93 Difference]: Finished difference Result 568926 states and 623629 transitions. [2019-11-23 20:58:07,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:58:07,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 504 [2019-11-23 20:58:07,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:58:07,746 INFO L225 Difference]: With dead ends: 568926 [2019-11-23 20:58:07,746 INFO L226 Difference]: Without dead ends: 284429 [2019-11-23 20:58:07,856 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:58:08,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284429 states. [2019-11-23 20:58:10,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284429 to 284296. [2019-11-23 20:58:10,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284296 states. [2019-11-23 20:58:11,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284296 states to 284296 states and 311108 transitions. [2019-11-23 20:58:11,150 INFO L78 Accepts]: Start accepts. Automaton has 284296 states and 311108 transitions. Word has length 504 [2019-11-23 20:58:11,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:58:11,150 INFO L462 AbstractCegarLoop]: Abstraction has 284296 states and 311108 transitions. [2019-11-23 20:58:11,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:58:11,150 INFO L276 IsEmpty]: Start isEmpty. Operand 284296 states and 311108 transitions. [2019-11-23 20:58:11,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2019-11-23 20:58:11,280 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:58:11,280 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:58:11,280 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:58:11,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:58:11,281 INFO L82 PathProgramCache]: Analyzing trace with hash 489549233, now seen corresponding path program 1 times [2019-11-23 20:58:11,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:58:11,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743727246] [2019-11-23 20:58:11,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:58:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:58:12,405 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2019-11-23 20:58:12,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743727246] [2019-11-23 20:58:12,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:58:12,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:58:12,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829581078] [2019-11-23 20:58:12,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:58:12,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:58:12,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:58:12,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:58:12,420 INFO L87 Difference]: Start difference. First operand 284296 states and 311108 transitions. Second operand 4 states. [2019-11-23 20:58:15,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:58:15,037 INFO L93 Difference]: Finished difference Result 590677 states and 646247 transitions. [2019-11-23 20:58:15,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:58:15,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 531 [2019-11-23 20:58:15,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:58:15,319 INFO L225 Difference]: With dead ends: 590677 [2019-11-23 20:58:15,320 INFO L226 Difference]: Without dead ends: 301105 [2019-11-23 20:58:15,448 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:58:15,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301105 states.