/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/systemc/token_ring.02.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 07:07:57,641 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 07:07:57,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 07:07:57,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 07:07:57,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 07:07:57,702 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 07:07:57,704 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 07:07:57,706 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 07:07:57,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 07:07:57,710 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 07:07:57,711 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 07:07:57,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 07:07:57,714 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 07:07:57,715 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 07:07:57,716 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 07:07:57,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 07:07:57,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 07:07:57,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 07:07:57,722 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 07:07:57,725 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 07:07:57,727 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 07:07:57,730 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 07:07:57,732 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 07:07:57,733 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 07:07:57,749 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 07:07:57,749 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 07:07:57,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 07:07:57,751 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 07:07:57,752 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 07:07:57,753 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 07:07:57,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 07:07:57,754 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 07:07:57,755 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 07:07:57,756 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 07:07:57,757 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 07:07:57,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 07:07:57,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 07:07:57,759 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 07:07:57,759 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 07:07:57,761 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 07:07:57,762 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 07:07:57,763 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-22 07:07:57,791 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 07:07:57,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 07:07:57,793 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 07:07:57,793 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 07:07:57,794 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 07:07:57,794 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 07:07:57,794 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 07:07:57,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 07:07:57,795 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 07:07:57,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 07:07:57,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 07:07:57,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 07:07:57,796 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 07:07:57,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 07:07:57,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 07:07:57,796 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 07:07:57,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 07:07:57,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 07:07:57,797 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 07:07:57,797 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 07:07:57,798 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 07:07:57,798 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 07:07:57,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 07:07:57,798 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 07:07:57,799 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 07:07:57,799 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-22 07:07:58,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 07:07:58,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 07:07:58,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 07:07:58,201 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 07:07:58,202 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 07:07:58,203 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2020-12-22 07:07:58,291 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3febb363/89b70e53853c4d9385d3f524b259ed28/FLAGf81847206 [2020-12-22 07:07:58,937 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 07:07:58,938 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2020-12-22 07:07:58,948 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3febb363/89b70e53853c4d9385d3f524b259ed28/FLAGf81847206 [2020-12-22 07:07:59,283 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3febb363/89b70e53853c4d9385d3f524b259ed28 [2020-12-22 07:07:59,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 07:07:59,290 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 07:07:59,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 07:07:59,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 07:07:59,299 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 07:07:59,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:07:59" (1/1) ... [2020-12-22 07:07:59,302 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@257e21de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:07:59, skipping insertion in model container [2020-12-22 07:07:59,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:07:59" (1/1) ... [2020-12-22 07:07:59,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 07:07:59,346 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 07:07:59,493 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.02.cil-2.c[366,379] [2020-12-22 07:07:59,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 07:07:59,570 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 07:07:59,584 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.02.cil-2.c[366,379] [2020-12-22 07:07:59,621 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 07:07:59,647 INFO L208 MainTranslator]: Completed translation [2020-12-22 07:07:59,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:07:59 WrapperNode [2020-12-22 07:07:59,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 07:07:59,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 07:07:59,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 07:07:59,650 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 07:07:59,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:07:59" (1/1) ... [2020-12-22 07:07:59,672 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:07:59" (1/1) ... [2020-12-22 07:07:59,725 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 07:07:59,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 07:07:59,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 07:07:59,726 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 07:07:59,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:07:59" (1/1) ... [2020-12-22 07:07:59,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:07:59" (1/1) ... [2020-12-22 07:07:59,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:07:59" (1/1) ... [2020-12-22 07:07:59,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:07:59" (1/1) ... [2020-12-22 07:07:59,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:07:59" (1/1) ... [2020-12-22 07:07:59,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:07:59" (1/1) ... [2020-12-22 07:07:59,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:07:59" (1/1) ... [2020-12-22 07:07:59,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 07:07:59,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 07:07:59,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 07:07:59,827 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 07:07:59,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:07:59" (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 [2020-12-22 07:07:59,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 07:07:59,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 07:07:59,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 07:07:59,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 07:08:00,882 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 07:08:00,882 INFO L299 CfgBuilder]: Removed 105 assume(true) statements. [2020-12-22 07:08:00,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:08:00 BoogieIcfgContainer [2020-12-22 07:08:00,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 07:08:00,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 07:08:00,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 07:08:00,890 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 07:08:00,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 07:07:59" (1/3) ... [2020-12-22 07:08:00,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70475c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 07:08:00, skipping insertion in model container [2020-12-22 07:08:00,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:07:59" (2/3) ... [2020-12-22 07:08:00,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70475c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 07:08:00, skipping insertion in model container [2020-12-22 07:08:00,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:08:00" (3/3) ... [2020-12-22 07:08:00,894 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2020-12-22 07:08:00,902 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 07:08:00,908 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-22 07:08:00,928 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-12-22 07:08:00,964 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 07:08:00,964 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 07:08:00,964 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 07:08:00,964 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 07:08:00,965 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 07:08:00,965 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 07:08:00,965 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 07:08:00,965 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 07:08:00,988 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states. [2020-12-22 07:08:00,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-22 07:08:00,997 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:00,998 INFO L422 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] [2020-12-22 07:08:00,999 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:01,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:01,005 INFO L82 PathProgramCache]: Analyzing trace with hash 603110903, now seen corresponding path program 1 times [2020-12-22 07:08:01,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:01,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699998236] [2020-12-22 07:08:01,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:01,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:08:01,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699998236] [2020-12-22 07:08:01,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:01,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:01,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431088834] [2020-12-22 07:08:01,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:01,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:01,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:01,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:01,244 INFO L87 Difference]: Start difference. First operand 225 states. Second operand 3 states. [2020-12-22 07:08:01,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:01,332 INFO L93 Difference]: Finished difference Result 445 states and 697 transitions. [2020-12-22 07:08:01,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:01,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-12-22 07:08:01,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:01,361 INFO L225 Difference]: With dead ends: 445 [2020-12-22 07:08:01,361 INFO L226 Difference]: Without dead ends: 221 [2020-12-22 07:08:01,372 INFO L677 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 [2020-12-22 07:08:01,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-12-22 07:08:01,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2020-12-22 07:08:01,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-12-22 07:08:01,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 335 transitions. [2020-12-22 07:08:01,439 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 335 transitions. Word has length 50 [2020-12-22 07:08:01,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:01,440 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 335 transitions. [2020-12-22 07:08:01,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:01,440 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 335 transitions. [2020-12-22 07:08:01,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-22 07:08:01,442 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:01,442 INFO L422 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] [2020-12-22 07:08:01,443 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 07:08:01,443 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:01,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:01,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1325161799, now seen corresponding path program 1 times [2020-12-22 07:08:01,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:01,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929528841] [2020-12-22 07:08:01,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:01,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:08:01,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929528841] [2020-12-22 07:08:01,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:01,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 07:08:01,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068967565] [2020-12-22 07:08:01,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:01,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:01,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:01,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:01,554 INFO L87 Difference]: Start difference. First operand 221 states and 335 transitions. Second operand 3 states. [2020-12-22 07:08:01,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:01,659 INFO L93 Difference]: Finished difference Result 595 states and 901 transitions. [2020-12-22 07:08:01,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:01,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-12-22 07:08:01,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:01,663 INFO L225 Difference]: With dead ends: 595 [2020-12-22 07:08:01,663 INFO L226 Difference]: Without dead ends: 381 [2020-12-22 07:08:01,666 INFO L677 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 [2020-12-22 07:08:01,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2020-12-22 07:08:01,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2020-12-22 07:08:01,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-12-22 07:08:01,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 570 transitions. [2020-12-22 07:08:01,713 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 570 transitions. Word has length 50 [2020-12-22 07:08:01,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:01,714 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 570 transitions. [2020-12-22 07:08:01,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:01,714 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 570 transitions. [2020-12-22 07:08:01,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-22 07:08:01,717 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:01,718 INFO L422 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] [2020-12-22 07:08:01,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-22 07:08:01,719 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:01,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:01,720 INFO L82 PathProgramCache]: Analyzing trace with hash 102769205, now seen corresponding path program 1 times [2020-12-22 07:08:01,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:01,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257762613] [2020-12-22 07:08:01,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:01,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:08:01,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257762613] [2020-12-22 07:08:01,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:01,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:01,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827073588] [2020-12-22 07:08:01,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:08:01,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:01,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:08:01,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:08:01,826 INFO L87 Difference]: Start difference. First operand 377 states and 570 transitions. Second operand 4 states. [2020-12-22 07:08:01,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:01,951 INFO L93 Difference]: Finished difference Result 905 states and 1366 transitions. [2020-12-22 07:08:01,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:08:01,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-12-22 07:08:01,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:01,956 INFO L225 Difference]: With dead ends: 905 [2020-12-22 07:08:01,956 INFO L226 Difference]: Without dead ends: 536 [2020-12-22 07:08:01,959 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:08:01,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-12-22 07:08:01,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 377. [2020-12-22 07:08:01,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-12-22 07:08:01,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 567 transitions. [2020-12-22 07:08:01,997 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 567 transitions. Word has length 50 [2020-12-22 07:08:01,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:01,997 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 567 transitions. [2020-12-22 07:08:01,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:08:01,997 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 567 transitions. [2020-12-22 07:08:01,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-22 07:08:01,999 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:01,999 INFO L422 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] [2020-12-22 07:08:01,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-22 07:08:02,000 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:02,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:02,000 INFO L82 PathProgramCache]: Analyzing trace with hash -794624073, now seen corresponding path program 1 times [2020-12-22 07:08:02,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:02,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819730919] [2020-12-22 07:08:02,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:02,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:08:02,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819730919] [2020-12-22 07:08:02,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:02,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:02,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787277942] [2020-12-22 07:08:02,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:08:02,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:02,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:08:02,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:08:02,085 INFO L87 Difference]: Start difference. First operand 377 states and 567 transitions. Second operand 4 states. [2020-12-22 07:08:02,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:02,183 INFO L93 Difference]: Finished difference Result 903 states and 1356 transitions. [2020-12-22 07:08:02,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:08:02,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-12-22 07:08:02,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:02,188 INFO L225 Difference]: With dead ends: 903 [2020-12-22 07:08:02,188 INFO L226 Difference]: Without dead ends: 535 [2020-12-22 07:08:02,190 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:08:02,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-12-22 07:08:02,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 377. [2020-12-22 07:08:02,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-12-22 07:08:02,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 564 transitions. [2020-12-22 07:08:02,233 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 564 transitions. Word has length 50 [2020-12-22 07:08:02,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:02,233 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 564 transitions. [2020-12-22 07:08:02,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:08:02,234 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 564 transitions. [2020-12-22 07:08:02,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-22 07:08:02,235 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:02,235 INFO L422 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] [2020-12-22 07:08:02,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-22 07:08:02,236 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:02,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:02,237 INFO L82 PathProgramCache]: Analyzing trace with hash -546477579, now seen corresponding path program 1 times [2020-12-22 07:08:02,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:02,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035991367] [2020-12-22 07:08:02,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:02,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:08:02,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035991367] [2020-12-22 07:08:02,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:02,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 07:08:02,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117083665] [2020-12-22 07:08:02,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:02,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:02,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:02,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:02,284 INFO L87 Difference]: Start difference. First operand 377 states and 564 transitions. Second operand 3 states. [2020-12-22 07:08:02,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:02,348 INFO L93 Difference]: Finished difference Result 744 states and 1115 transitions. [2020-12-22 07:08:02,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:02,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-12-22 07:08:02,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:02,352 INFO L225 Difference]: With dead ends: 744 [2020-12-22 07:08:02,352 INFO L226 Difference]: Without dead ends: 377 [2020-12-22 07:08:02,353 INFO L677 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 [2020-12-22 07:08:02,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-12-22 07:08:02,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2020-12-22 07:08:02,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-12-22 07:08:02,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 548 transitions. [2020-12-22 07:08:02,411 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 548 transitions. Word has length 50 [2020-12-22 07:08:02,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:02,414 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 548 transitions. [2020-12-22 07:08:02,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:02,414 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 548 transitions. [2020-12-22 07:08:02,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-22 07:08:02,416 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:02,417 INFO L422 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] [2020-12-22 07:08:02,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-22 07:08:02,417 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:02,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:02,419 INFO L82 PathProgramCache]: Analyzing trace with hash -585918790, now seen corresponding path program 1 times [2020-12-22 07:08:02,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:02,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775143824] [2020-12-22 07:08:02,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:02,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:08:02,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775143824] [2020-12-22 07:08:02,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:02,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:02,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86035916] [2020-12-22 07:08:02,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:08:02,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:02,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:08:02,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:08:02,491 INFO L87 Difference]: Start difference. First operand 377 states and 548 transitions. Second operand 4 states. [2020-12-22 07:08:02,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:02,609 INFO L93 Difference]: Finished difference Result 878 states and 1277 transitions. [2020-12-22 07:08:02,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:08:02,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-12-22 07:08:02,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:02,613 INFO L225 Difference]: With dead ends: 878 [2020-12-22 07:08:02,613 INFO L226 Difference]: Without dead ends: 512 [2020-12-22 07:08:02,614 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:08:02,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2020-12-22 07:08:02,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 377. [2020-12-22 07:08:02,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-12-22 07:08:02,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 545 transitions. [2020-12-22 07:08:02,641 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 545 transitions. Word has length 50 [2020-12-22 07:08:02,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:02,641 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 545 transitions. [2020-12-22 07:08:02,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:08:02,641 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 545 transitions. [2020-12-22 07:08:02,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-22 07:08:02,642 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:02,642 INFO L422 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] [2020-12-22 07:08:02,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-22 07:08:02,643 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:02,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:02,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1957726088, now seen corresponding path program 1 times [2020-12-22 07:08:02,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:02,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138789501] [2020-12-22 07:08:02,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:02,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:08:02,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138789501] [2020-12-22 07:08:02,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:02,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 07:08:02,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009702278] [2020-12-22 07:08:02,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:02,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:02,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:02,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:02,681 INFO L87 Difference]: Start difference. First operand 377 states and 545 transitions. Second operand 3 states. [2020-12-22 07:08:02,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:02,736 INFO L93 Difference]: Finished difference Result 742 states and 1075 transitions. [2020-12-22 07:08:02,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:02,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-12-22 07:08:02,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:02,739 INFO L225 Difference]: With dead ends: 742 [2020-12-22 07:08:02,740 INFO L226 Difference]: Without dead ends: 377 [2020-12-22 07:08:02,741 INFO L677 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 [2020-12-22 07:08:02,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-12-22 07:08:02,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2020-12-22 07:08:02,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-12-22 07:08:02,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 529 transitions. [2020-12-22 07:08:02,769 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 529 transitions. Word has length 50 [2020-12-22 07:08:02,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:02,769 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 529 transitions. [2020-12-22 07:08:02,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:02,769 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 529 transitions. [2020-12-22 07:08:02,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-22 07:08:02,770 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:02,771 INFO L422 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] [2020-12-22 07:08:02,771 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-22 07:08:02,771 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:02,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:02,772 INFO L82 PathProgramCache]: Analyzing trace with hash -787989636, now seen corresponding path program 1 times [2020-12-22 07:08:02,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:02,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128840588] [2020-12-22 07:08:02,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:02,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:08:02,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128840588] [2020-12-22 07:08:02,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:02,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 07:08:02,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401046491] [2020-12-22 07:08:02,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:08:02,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:02,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:08:02,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:08:02,822 INFO L87 Difference]: Start difference. First operand 377 states and 529 transitions. Second operand 5 states. [2020-12-22 07:08:02,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:02,964 INFO L93 Difference]: Finished difference Result 981 states and 1389 transitions. [2020-12-22 07:08:02,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 07:08:02,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2020-12-22 07:08:02,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:02,968 INFO L225 Difference]: With dead ends: 981 [2020-12-22 07:08:02,969 INFO L226 Difference]: Without dead ends: 623 [2020-12-22 07:08:02,970 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-22 07:08:02,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-12-22 07:08:03,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 383. [2020-12-22 07:08:03,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-12-22 07:08:03,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 527 transitions. [2020-12-22 07:08:03,005 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 527 transitions. Word has length 50 [2020-12-22 07:08:03,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:03,005 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 527 transitions. [2020-12-22 07:08:03,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:08:03,006 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 527 transitions. [2020-12-22 07:08:03,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-22 07:08:03,006 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:03,006 INFO L422 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] [2020-12-22 07:08:03,007 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-22 07:08:03,007 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:03,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:03,008 INFO L82 PathProgramCache]: Analyzing trace with hash -860376194, now seen corresponding path program 1 times [2020-12-22 07:08:03,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:03,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37285683] [2020-12-22 07:08:03,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:03,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:08:03,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37285683] [2020-12-22 07:08:03,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:03,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:03,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698427698] [2020-12-22 07:08:03,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:08:03,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:03,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:08:03,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:08:03,045 INFO L87 Difference]: Start difference. First operand 383 states and 527 transitions. Second operand 4 states. [2020-12-22 07:08:03,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:03,235 INFO L93 Difference]: Finished difference Result 1331 states and 1833 transitions. [2020-12-22 07:08:03,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:08:03,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-12-22 07:08:03,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:03,242 INFO L225 Difference]: With dead ends: 1331 [2020-12-22 07:08:03,242 INFO L226 Difference]: Without dead ends: 962 [2020-12-22 07:08:03,243 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:08:03,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2020-12-22 07:08:03,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 886. [2020-12-22 07:08:03,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2020-12-22 07:08:03,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1204 transitions. [2020-12-22 07:08:03,323 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1204 transitions. Word has length 50 [2020-12-22 07:08:03,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:03,323 INFO L481 AbstractCegarLoop]: Abstraction has 886 states and 1204 transitions. [2020-12-22 07:08:03,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:08:03,323 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1204 transitions. [2020-12-22 07:08:03,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-22 07:08:03,324 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:03,325 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-22 07:08:03,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-22 07:08:03,325 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:03,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:03,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1146431867, now seen corresponding path program 1 times [2020-12-22 07:08:03,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:03,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476669985] [2020-12-22 07:08:03,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:03,408 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-22 07:08:03,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476669985] [2020-12-22 07:08:03,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:03,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 07:08:03,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965809231] [2020-12-22 07:08:03,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:08:03,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:03,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:08:03,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:08:03,411 INFO L87 Difference]: Start difference. First operand 886 states and 1204 transitions. Second operand 5 states. [2020-12-22 07:08:03,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:03,669 INFO L93 Difference]: Finished difference Result 2286 states and 3127 transitions. [2020-12-22 07:08:03,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 07:08:03,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2020-12-22 07:08:03,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:03,678 INFO L225 Difference]: With dead ends: 2286 [2020-12-22 07:08:03,679 INFO L226 Difference]: Without dead ends: 1424 [2020-12-22 07:08:03,681 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-22 07:08:03,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-12-22 07:08:03,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 913. [2020-12-22 07:08:03,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2020-12-22 07:08:03,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1218 transitions. [2020-12-22 07:08:03,773 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1218 transitions. Word has length 63 [2020-12-22 07:08:03,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:03,774 INFO L481 AbstractCegarLoop]: Abstraction has 913 states and 1218 transitions. [2020-12-22 07:08:03,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:08:03,774 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1218 transitions. [2020-12-22 07:08:03,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-22 07:08:03,775 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:03,775 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-22 07:08:03,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-22 07:08:03,777 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:03,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:03,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1776728131, now seen corresponding path program 1 times [2020-12-22 07:08:03,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:03,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517837906] [2020-12-22 07:08:03,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:03,848 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-22 07:08:03,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517837906] [2020-12-22 07:08:03,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:03,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:03,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071317449] [2020-12-22 07:08:03,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:08:03,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:03,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:08:03,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:08:03,856 INFO L87 Difference]: Start difference. First operand 913 states and 1218 transitions. Second operand 4 states. [2020-12-22 07:08:04,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:04,030 INFO L93 Difference]: Finished difference Result 2185 states and 2919 transitions. [2020-12-22 07:08:04,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:08:04,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-12-22 07:08:04,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:04,039 INFO L225 Difference]: With dead ends: 2185 [2020-12-22 07:08:04,039 INFO L226 Difference]: Without dead ends: 1305 [2020-12-22 07:08:04,042 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:08:04,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2020-12-22 07:08:04,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 913. [2020-12-22 07:08:04,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2020-12-22 07:08:04,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1205 transitions. [2020-12-22 07:08:04,131 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1205 transitions. Word has length 63 [2020-12-22 07:08:04,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:04,131 INFO L481 AbstractCegarLoop]: Abstraction has 913 states and 1205 transitions. [2020-12-22 07:08:04,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:08:04,132 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1205 transitions. [2020-12-22 07:08:04,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-22 07:08:04,139 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:04,139 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-22 07:08:04,139 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-22 07:08:04,139 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:04,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:04,140 INFO L82 PathProgramCache]: Analyzing trace with hash 2051487745, now seen corresponding path program 1 times [2020-12-22 07:08:04,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:04,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014942361] [2020-12-22 07:08:04,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:04,204 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-22 07:08:04,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014942361] [2020-12-22 07:08:04,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:04,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:04,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449374807] [2020-12-22 07:08:04,206 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:08:04,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:04,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:08:04,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:08:04,207 INFO L87 Difference]: Start difference. First operand 913 states and 1205 transitions. Second operand 4 states. [2020-12-22 07:08:04,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:04,393 INFO L93 Difference]: Finished difference Result 2184 states and 2889 transitions. [2020-12-22 07:08:04,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:08:04,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-12-22 07:08:04,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:04,407 INFO L225 Difference]: With dead ends: 2184 [2020-12-22 07:08:04,407 INFO L226 Difference]: Without dead ends: 1305 [2020-12-22 07:08:04,409 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:08:04,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2020-12-22 07:08:04,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 913. [2020-12-22 07:08:04,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2020-12-22 07:08:04,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1192 transitions. [2020-12-22 07:08:04,513 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1192 transitions. Word has length 63 [2020-12-22 07:08:04,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:04,513 INFO L481 AbstractCegarLoop]: Abstraction has 913 states and 1192 transitions. [2020-12-22 07:08:04,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:08:04,514 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1192 transitions. [2020-12-22 07:08:04,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-22 07:08:04,515 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:04,515 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-22 07:08:04,515 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-22 07:08:04,515 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:04,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:04,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1541879677, now seen corresponding path program 1 times [2020-12-22 07:08:04,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:04,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481196522] [2020-12-22 07:08:04,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:04,556 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:08:04,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481196522] [2020-12-22 07:08:04,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:04,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:04,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788423480] [2020-12-22 07:08:04,558 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:04,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:04,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:04,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:04,559 INFO L87 Difference]: Start difference. First operand 913 states and 1192 transitions. Second operand 3 states. [2020-12-22 07:08:04,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:04,729 INFO L93 Difference]: Finished difference Result 2514 states and 3253 transitions. [2020-12-22 07:08:04,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:04,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-12-22 07:08:04,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:04,738 INFO L225 Difference]: With dead ends: 2514 [2020-12-22 07:08:04,739 INFO L226 Difference]: Without dead ends: 1638 [2020-12-22 07:08:04,746 INFO L677 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 [2020-12-22 07:08:04,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2020-12-22 07:08:04,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1638. [2020-12-22 07:08:04,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1638 states. [2020-12-22 07:08:04,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2079 transitions. [2020-12-22 07:08:04,918 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2079 transitions. Word has length 63 [2020-12-22 07:08:04,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:04,922 INFO L481 AbstractCegarLoop]: Abstraction has 1638 states and 2079 transitions. [2020-12-22 07:08:04,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:04,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2079 transitions. [2020-12-22 07:08:04,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-12-22 07:08:04,926 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:04,927 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:04,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-22 07:08:04,927 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:04,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:04,928 INFO L82 PathProgramCache]: Analyzing trace with hash -443703688, now seen corresponding path program 1 times [2020-12-22 07:08:04,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:04,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662615321] [2020-12-22 07:08:04,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:04,996 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:08:04,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662615321] [2020-12-22 07:08:04,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:04,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:04,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387811586] [2020-12-22 07:08:04,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:04,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:04,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:05,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:05,000 INFO L87 Difference]: Start difference. First operand 1638 states and 2079 transitions. Second operand 3 states. [2020-12-22 07:08:05,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:05,287 INFO L93 Difference]: Finished difference Result 4524 states and 5739 transitions. [2020-12-22 07:08:05,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:05,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-12-22 07:08:05,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:05,304 INFO L225 Difference]: With dead ends: 4524 [2020-12-22 07:08:05,304 INFO L226 Difference]: Without dead ends: 2956 [2020-12-22 07:08:05,309 INFO L677 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 [2020-12-22 07:08:05,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-12-22 07:08:05,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2916. [2020-12-22 07:08:05,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2916 states. [2020-12-22 07:08:05,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 3671 transitions. [2020-12-22 07:08:05,569 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 3671 transitions. Word has length 64 [2020-12-22 07:08:05,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:05,570 INFO L481 AbstractCegarLoop]: Abstraction has 2916 states and 3671 transitions. [2020-12-22 07:08:05,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:05,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 3671 transitions. [2020-12-22 07:08:05,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-12-22 07:08:05,572 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:05,573 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:05,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-22 07:08:05,573 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:05,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:05,574 INFO L82 PathProgramCache]: Analyzing trace with hash 116996090, now seen corresponding path program 1 times [2020-12-22 07:08:05,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:05,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559356821] [2020-12-22 07:08:05,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:05,601 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-22 07:08:05,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559356821] [2020-12-22 07:08:05,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:05,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:05,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870025427] [2020-12-22 07:08:05,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:05,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:05,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:05,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:05,604 INFO L87 Difference]: Start difference. First operand 2916 states and 3671 transitions. Second operand 3 states. [2020-12-22 07:08:05,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:05,826 INFO L93 Difference]: Finished difference Result 5712 states and 7209 transitions. [2020-12-22 07:08:05,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:05,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-12-22 07:08:05,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:05,841 INFO L225 Difference]: With dead ends: 5712 [2020-12-22 07:08:05,842 INFO L226 Difference]: Without dead ends: 2854 [2020-12-22 07:08:05,849 INFO L677 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 [2020-12-22 07:08:05,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2020-12-22 07:08:06,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 2854. [2020-12-22 07:08:06,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2854 states. [2020-12-22 07:08:06,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2854 states and 3601 transitions. [2020-12-22 07:08:06,147 INFO L78 Accepts]: Start accepts. Automaton has 2854 states and 3601 transitions. Word has length 64 [2020-12-22 07:08:06,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:06,148 INFO L481 AbstractCegarLoop]: Abstraction has 2854 states and 3601 transitions. [2020-12-22 07:08:06,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:06,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 3601 transitions. [2020-12-22 07:08:06,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-12-22 07:08:06,149 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:06,150 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:06,150 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-22 07:08:06,150 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:06,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:06,151 INFO L82 PathProgramCache]: Analyzing trace with hash 2104278287, now seen corresponding path program 1 times [2020-12-22 07:08:06,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:06,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558497648] [2020-12-22 07:08:06,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:06,189 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-22 07:08:06,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558497648] [2020-12-22 07:08:06,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:06,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 07:08:06,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127633305] [2020-12-22 07:08:06,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:06,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:06,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:06,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:06,195 INFO L87 Difference]: Start difference. First operand 2854 states and 3601 transitions. Second operand 3 states. [2020-12-22 07:08:06,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:06,578 INFO L93 Difference]: Finished difference Result 6838 states and 8679 transitions. [2020-12-22 07:08:06,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:06,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-12-22 07:08:06,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:06,602 INFO L225 Difference]: With dead ends: 6838 [2020-12-22 07:08:06,603 INFO L226 Difference]: Without dead ends: 4770 [2020-12-22 07:08:06,608 INFO L677 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 [2020-12-22 07:08:06,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4770 states. [2020-12-22 07:08:06,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4770 to 3882. [2020-12-22 07:08:06,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3882 states. [2020-12-22 07:08:06,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3882 states to 3882 states and 4899 transitions. [2020-12-22 07:08:06,984 INFO L78 Accepts]: Start accepts. Automaton has 3882 states and 4899 transitions. Word has length 65 [2020-12-22 07:08:06,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:06,984 INFO L481 AbstractCegarLoop]: Abstraction has 3882 states and 4899 transitions. [2020-12-22 07:08:06,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:06,985 INFO L276 IsEmpty]: Start isEmpty. Operand 3882 states and 4899 transitions. [2020-12-22 07:08:06,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-22 07:08:06,988 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:06,988 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-22 07:08:06,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-22 07:08:06,988 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:06,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:06,989 INFO L82 PathProgramCache]: Analyzing trace with hash 23144866, now seen corresponding path program 1 times [2020-12-22 07:08:06,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:06,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881017969] [2020-12-22 07:08:06,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:07,034 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:08:07,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881017969] [2020-12-22 07:08:07,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:07,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 07:08:07,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292210234] [2020-12-22 07:08:07,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:08:07,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:07,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:08:07,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:08:07,037 INFO L87 Difference]: Start difference. First operand 3882 states and 4899 transitions. Second operand 5 states. [2020-12-22 07:08:07,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:07,679 INFO L93 Difference]: Finished difference Result 9686 states and 12267 transitions. [2020-12-22 07:08:07,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 07:08:07,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2020-12-22 07:08:07,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:07,708 INFO L225 Difference]: With dead ends: 9686 [2020-12-22 07:08:07,708 INFO L226 Difference]: Without dead ends: 5862 [2020-12-22 07:08:07,716 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-22 07:08:07,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5862 states. [2020-12-22 07:08:08,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5862 to 3930. [2020-12-22 07:08:08,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3930 states. [2020-12-22 07:08:08,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3930 states to 3930 states and 4873 transitions. [2020-12-22 07:08:08,139 INFO L78 Accepts]: Start accepts. Automaton has 3930 states and 4873 transitions. Word has length 82 [2020-12-22 07:08:08,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:08,140 INFO L481 AbstractCegarLoop]: Abstraction has 3930 states and 4873 transitions. [2020-12-22 07:08:08,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:08:08,140 INFO L276 IsEmpty]: Start isEmpty. Operand 3930 states and 4873 transitions. [2020-12-22 07:08:08,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-22 07:08:08,143 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:08,143 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-22 07:08:08,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-22 07:08:08,143 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:08,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:08,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1565203036, now seen corresponding path program 1 times [2020-12-22 07:08:08,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:08,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257419384] [2020-12-22 07:08:08,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:08,192 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:08:08,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257419384] [2020-12-22 07:08:08,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:08,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:08,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832101273] [2020-12-22 07:08:08,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:08,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:08,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:08,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:08,195 INFO L87 Difference]: Start difference. First operand 3930 states and 4873 transitions. Second operand 3 states. [2020-12-22 07:08:08,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:08,830 INFO L93 Difference]: Finished difference Result 11242 states and 13901 transitions. [2020-12-22 07:08:08,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:08,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2020-12-22 07:08:08,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:08,850 INFO L225 Difference]: With dead ends: 11242 [2020-12-22 07:08:08,850 INFO L226 Difference]: Without dead ends: 7382 [2020-12-22 07:08:08,858 INFO L677 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 [2020-12-22 07:08:08,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2020-12-22 07:08:09,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7170. [2020-12-22 07:08:09,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7170 states. [2020-12-22 07:08:09,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7170 states to 7170 states and 8765 transitions. [2020-12-22 07:08:09,450 INFO L78 Accepts]: Start accepts. Automaton has 7170 states and 8765 transitions. Word has length 82 [2020-12-22 07:08:09,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:09,450 INFO L481 AbstractCegarLoop]: Abstraction has 7170 states and 8765 transitions. [2020-12-22 07:08:09,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:09,451 INFO L276 IsEmpty]: Start isEmpty. Operand 7170 states and 8765 transitions. [2020-12-22 07:08:09,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-22 07:08:09,454 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:09,454 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-22 07:08:09,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-22 07:08:09,455 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:09,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:09,455 INFO L82 PathProgramCache]: Analyzing trace with hash 794948131, now seen corresponding path program 1 times [2020-12-22 07:08:09,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:09,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599279302] [2020-12-22 07:08:09,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:08:09,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599279302] [2020-12-22 07:08:09,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:09,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:08:09,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437886924] [2020-12-22 07:08:09,495 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:08:09,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:09,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:08:09,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:08:09,497 INFO L87 Difference]: Start difference. First operand 7170 states and 8765 transitions. Second operand 4 states. [2020-12-22 07:08:10,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:10,212 INFO L93 Difference]: Finished difference Result 12646 states and 15461 transitions. [2020-12-22 07:08:10,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:08:10,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2020-12-22 07:08:10,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:10,238 INFO L225 Difference]: With dead ends: 12646 [2020-12-22 07:08:10,238 INFO L226 Difference]: Without dead ends: 5513 [2020-12-22 07:08:10,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:08:10,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5513 states. [2020-12-22 07:08:10,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5513 to 5509. [2020-12-22 07:08:10,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5509 states. [2020-12-22 07:08:10,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5509 states to 5509 states and 6669 transitions. [2020-12-22 07:08:10,709 INFO L78 Accepts]: Start accepts. Automaton has 5509 states and 6669 transitions. Word has length 83 [2020-12-22 07:08:10,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:10,710 INFO L481 AbstractCegarLoop]: Abstraction has 5509 states and 6669 transitions. [2020-12-22 07:08:10,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:08:10,710 INFO L276 IsEmpty]: Start isEmpty. Operand 5509 states and 6669 transitions. [2020-12-22 07:08:10,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-22 07:08:10,715 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:10,715 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-22 07:08:10,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-22 07:08:10,716 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:10,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:10,717 INFO L82 PathProgramCache]: Analyzing trace with hash -471564153, now seen corresponding path program 1 times [2020-12-22 07:08:10,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:10,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548239463] [2020-12-22 07:08:10,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:10,781 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:08:10,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548239463] [2020-12-22 07:08:10,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:10,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 07:08:10,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912502226] [2020-12-22 07:08:10,783 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:10,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:10,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:10,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:10,784 INFO L87 Difference]: Start difference. First operand 5509 states and 6669 transitions. Second operand 3 states. [2020-12-22 07:08:11,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:11,552 INFO L93 Difference]: Finished difference Result 12613 states and 15226 transitions. [2020-12-22 07:08:11,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:11,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-12-22 07:08:11,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:11,573 INFO L225 Difference]: With dead ends: 12613 [2020-12-22 07:08:11,574 INFO L226 Difference]: Without dead ends: 7130 [2020-12-22 07:08:11,583 INFO L677 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 [2020-12-22 07:08:11,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7130 states. [2020-12-22 07:08:12,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7130 to 7082. [2020-12-22 07:08:12,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7082 states. [2020-12-22 07:08:12,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7082 states to 7082 states and 8483 transitions. [2020-12-22 07:08:12,063 INFO L78 Accepts]: Start accepts. Automaton has 7082 states and 8483 transitions. Word has length 106 [2020-12-22 07:08:12,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:12,064 INFO L481 AbstractCegarLoop]: Abstraction has 7082 states and 8483 transitions. [2020-12-22 07:08:12,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:12,064 INFO L276 IsEmpty]: Start isEmpty. Operand 7082 states and 8483 transitions. [2020-12-22 07:08:12,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-12-22 07:08:12,071 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:12,071 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2020-12-22 07:08:12,071 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-22 07:08:12,072 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:12,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:12,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1818985301, now seen corresponding path program 1 times [2020-12-22 07:08:12,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:12,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606458099] [2020-12-22 07:08:12,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:12,155 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:08:12,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606458099] [2020-12-22 07:08:12,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:12,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:12,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900962922] [2020-12-22 07:08:12,156 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:12,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:12,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:12,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:12,157 INFO L87 Difference]: Start difference. First operand 7082 states and 8483 transitions. Second operand 3 states. [2020-12-22 07:08:12,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:12,675 INFO L93 Difference]: Finished difference Result 12586 states and 15145 transitions. [2020-12-22 07:08:12,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:12,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2020-12-22 07:08:12,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:12,692 INFO L225 Difference]: With dead ends: 12586 [2020-12-22 07:08:12,692 INFO L226 Difference]: Without dead ends: 7114 [2020-12-22 07:08:12,700 INFO L677 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 [2020-12-22 07:08:12,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7114 states. [2020-12-22 07:08:13,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7114 to 7082. [2020-12-22 07:08:13,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7082 states. [2020-12-22 07:08:13,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7082 states to 7082 states and 8311 transitions. [2020-12-22 07:08:13,165 INFO L78 Accepts]: Start accepts. Automaton has 7082 states and 8311 transitions. Word has length 121 [2020-12-22 07:08:13,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:13,166 INFO L481 AbstractCegarLoop]: Abstraction has 7082 states and 8311 transitions. [2020-12-22 07:08:13,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:13,166 INFO L276 IsEmpty]: Start isEmpty. Operand 7082 states and 8311 transitions. [2020-12-22 07:08:13,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-12-22 07:08:13,172 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:13,173 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2020-12-22 07:08:13,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-22 07:08:13,173 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:13,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:13,174 INFO L82 PathProgramCache]: Analyzing trace with hash -654472485, now seen corresponding path program 1 times [2020-12-22 07:08:13,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:13,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030267990] [2020-12-22 07:08:13,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:13,220 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:08:13,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030267990] [2020-12-22 07:08:13,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:13,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:08:13,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966769232] [2020-12-22 07:08:13,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:08:13,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:13,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:08:13,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:08:13,222 INFO L87 Difference]: Start difference. First operand 7082 states and 8311 transitions. Second operand 4 states. [2020-12-22 07:08:13,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:13,849 INFO L93 Difference]: Finished difference Result 12566 states and 14775 transitions. [2020-12-22 07:08:13,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:08:13,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2020-12-22 07:08:13,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:13,866 INFO L225 Difference]: With dead ends: 12566 [2020-12-22 07:08:13,867 INFO L226 Difference]: Without dead ends: 7094 [2020-12-22 07:08:13,882 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:08:13,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7094 states. [2020-12-22 07:08:14,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7094 to 7082. [2020-12-22 07:08:14,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7082 states. [2020-12-22 07:08:14,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7082 states to 7082 states and 8275 transitions. [2020-12-22 07:08:14,619 INFO L78 Accepts]: Start accepts. Automaton has 7082 states and 8275 transitions. Word has length 122 [2020-12-22 07:08:14,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:14,620 INFO L481 AbstractCegarLoop]: Abstraction has 7082 states and 8275 transitions. [2020-12-22 07:08:14,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:08:14,620 INFO L276 IsEmpty]: Start isEmpty. Operand 7082 states and 8275 transitions. [2020-12-22 07:08:14,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-22 07:08:14,631 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:14,632 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2020-12-22 07:08:14,632 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-22 07:08:14,632 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:14,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:14,633 INFO L82 PathProgramCache]: Analyzing trace with hash -956339995, now seen corresponding path program 1 times [2020-12-22 07:08:14,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:14,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943545100] [2020-12-22 07:08:14,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:14,709 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-22 07:08:14,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943545100] [2020-12-22 07:08:14,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:14,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:08:14,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501408966] [2020-12-22 07:08:14,711 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:08:14,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:14,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:08:14,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:08:14,712 INFO L87 Difference]: Start difference. First operand 7082 states and 8275 transitions. Second operand 4 states. [2020-12-22 07:08:15,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:15,688 INFO L93 Difference]: Finished difference Result 14332 states and 16735 transitions. [2020-12-22 07:08:15,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:08:15,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2020-12-22 07:08:15,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:15,701 INFO L225 Difference]: With dead ends: 14332 [2020-12-22 07:08:15,702 INFO L226 Difference]: Without dead ends: 6492 [2020-12-22 07:08:15,713 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:08:15,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6492 states. [2020-12-22 07:08:16,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6492 to 6280. [2020-12-22 07:08:16,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6280 states. [2020-12-22 07:08:16,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6280 states to 6280 states and 7296 transitions. [2020-12-22 07:08:16,286 INFO L78 Accepts]: Start accepts. Automaton has 6280 states and 7296 transitions. Word has length 148 [2020-12-22 07:08:16,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:16,286 INFO L481 AbstractCegarLoop]: Abstraction has 6280 states and 7296 transitions. [2020-12-22 07:08:16,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:08:16,287 INFO L276 IsEmpty]: Start isEmpty. Operand 6280 states and 7296 transitions. [2020-12-22 07:08:16,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-12-22 07:08:16,293 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:16,294 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2020-12-22 07:08:16,294 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-22 07:08:16,294 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:16,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:16,295 INFO L82 PathProgramCache]: Analyzing trace with hash 199848580, now seen corresponding path program 1 times [2020-12-22 07:08:16,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:16,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278535220] [2020-12-22 07:08:16,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:16,346 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-22 07:08:16,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278535220] [2020-12-22 07:08:16,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:16,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:16,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264005809] [2020-12-22 07:08:16,348 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:16,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:16,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:16,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:16,349 INFO L87 Difference]: Start difference. First operand 6280 states and 7296 transitions. Second operand 3 states. [2020-12-22 07:08:16,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:16,898 INFO L93 Difference]: Finished difference Result 10747 states and 12514 transitions. [2020-12-22 07:08:16,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:16,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2020-12-22 07:08:16,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:16,914 INFO L225 Difference]: With dead ends: 10747 [2020-12-22 07:08:16,914 INFO L226 Difference]: Without dead ends: 6564 [2020-12-22 07:08:16,921 INFO L677 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 [2020-12-22 07:08:16,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6564 states. [2020-12-22 07:08:17,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6564 to 6280. [2020-12-22 07:08:17,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6280 states. [2020-12-22 07:08:17,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6280 states to 6280 states and 7176 transitions. [2020-12-22 07:08:17,540 INFO L78 Accepts]: Start accepts. Automaton has 6280 states and 7176 transitions. Word has length 149 [2020-12-22 07:08:17,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:17,540 INFO L481 AbstractCegarLoop]: Abstraction has 6280 states and 7176 transitions. [2020-12-22 07:08:17,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:17,540 INFO L276 IsEmpty]: Start isEmpty. Operand 6280 states and 7176 transitions. [2020-12-22 07:08:17,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-12-22 07:08:17,546 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:17,546 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2020-12-22 07:08:17,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-22 07:08:17,546 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:17,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:17,547 INFO L82 PathProgramCache]: Analyzing trace with hash 965086109, now seen corresponding path program 1 times [2020-12-22 07:08:17,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:17,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247315646] [2020-12-22 07:08:17,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:17,607 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-22 07:08:17,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247315646] [2020-12-22 07:08:17,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:17,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:08:17,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988867619] [2020-12-22 07:08:17,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:08:17,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:17,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:08:17,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:08:17,609 INFO L87 Difference]: Start difference. First operand 6280 states and 7176 transitions. Second operand 4 states. [2020-12-22 07:08:17,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:17,915 INFO L93 Difference]: Finished difference Result 9046 states and 10258 transitions. [2020-12-22 07:08:17,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:08:17,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2020-12-22 07:08:17,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:17,920 INFO L225 Difference]: With dead ends: 9046 [2020-12-22 07:08:17,920 INFO L226 Difference]: Without dead ends: 1885 [2020-12-22 07:08:17,931 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:08:17,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1885 states. [2020-12-22 07:08:18,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1885 to 1873. [2020-12-22 07:08:18,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1873 states. [2020-12-22 07:08:18,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2014 transitions. [2020-12-22 07:08:18,095 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2014 transitions. Word has length 150 [2020-12-22 07:08:18,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:18,096 INFO L481 AbstractCegarLoop]: Abstraction has 1873 states and 2014 transitions. [2020-12-22 07:08:18,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:08:18,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2014 transitions. [2020-12-22 07:08:18,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-12-22 07:08:18,099 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:18,099 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2020-12-22 07:08:18,100 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-22 07:08:18,100 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:18,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:18,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1275276035, now seen corresponding path program 1 times [2020-12-22 07:08:18,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:18,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580078260] [2020-12-22 07:08:18,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:18,178 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:08:18,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580078260] [2020-12-22 07:08:18,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:18,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:18,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800024095] [2020-12-22 07:08:18,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:18,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:18,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:18,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:18,181 INFO L87 Difference]: Start difference. First operand 1873 states and 2014 transitions. Second operand 3 states. [2020-12-22 07:08:18,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:18,336 INFO L93 Difference]: Finished difference Result 2511 states and 2705 transitions. [2020-12-22 07:08:18,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:18,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2020-12-22 07:08:18,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:18,339 INFO L225 Difference]: With dead ends: 2511 [2020-12-22 07:08:18,339 INFO L226 Difference]: Without dead ends: 1507 [2020-12-22 07:08:18,340 INFO L677 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 [2020-12-22 07:08:18,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2020-12-22 07:08:18,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2020-12-22 07:08:18,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2020-12-22 07:08:18,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1613 transitions. [2020-12-22 07:08:18,444 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1613 transitions. Word has length 150 [2020-12-22 07:08:18,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:18,444 INFO L481 AbstractCegarLoop]: Abstraction has 1507 states and 1613 transitions. [2020-12-22 07:08:18,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:18,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1613 transitions. [2020-12-22 07:08:18,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-12-22 07:08:18,446 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:18,447 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2020-12-22 07:08:18,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-22 07:08:18,447 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:18,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:18,447 INFO L82 PathProgramCache]: Analyzing trace with hash -660923245, now seen corresponding path program 1 times [2020-12-22 07:08:18,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:18,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113778208] [2020-12-22 07:08:18,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-22 07:08:18,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113778208] [2020-12-22 07:08:18,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:18,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 07:08:18,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744251904] [2020-12-22 07:08:18,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:08:18,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:18,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:08:18,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:08:18,597 INFO L87 Difference]: Start difference. First operand 1507 states and 1613 transitions. Second operand 5 states. [2020-12-22 07:08:18,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:18,865 INFO L93 Difference]: Finished difference Result 1507 states and 1613 transitions. [2020-12-22 07:08:18,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:08:18,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2020-12-22 07:08:18,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:18,868 INFO L225 Difference]: With dead ends: 1507 [2020-12-22 07:08:18,868 INFO L226 Difference]: Without dead ends: 1505 [2020-12-22 07:08:18,869 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:08:18,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2020-12-22 07:08:19,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2020-12-22 07:08:19,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1505 states. [2020-12-22 07:08:19,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1610 transitions. [2020-12-22 07:08:19,023 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1610 transitions. Word has length 152 [2020-12-22 07:08:19,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:19,023 INFO L481 AbstractCegarLoop]: Abstraction has 1505 states and 1610 transitions. [2020-12-22 07:08:19,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:08:19,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1610 transitions. [2020-12-22 07:08:19,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-12-22 07:08:19,026 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:19,026 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2020-12-22 07:08:19,026 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-22 07:08:19,027 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:19,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:19,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1317806111, now seen corresponding path program 1 times [2020-12-22 07:08:19,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:19,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365818222] [2020-12-22 07:08:19,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:19,089 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-12-22 07:08:19,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365818222] [2020-12-22 07:08:19,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:19,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:19,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638255352] [2020-12-22 07:08:19,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:19,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:19,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:19,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:19,091 INFO L87 Difference]: Start difference. First operand 1505 states and 1610 transitions. Second operand 3 states. [2020-12-22 07:08:19,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:19,298 INFO L93 Difference]: Finished difference Result 2761 states and 2943 transitions. [2020-12-22 07:08:19,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:19,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2020-12-22 07:08:19,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:19,301 INFO L225 Difference]: With dead ends: 2761 [2020-12-22 07:08:19,301 INFO L226 Difference]: Without dead ends: 2125 [2020-12-22 07:08:19,302 INFO L677 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 [2020-12-22 07:08:19,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2020-12-22 07:08:19,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 1507. [2020-12-22 07:08:19,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2020-12-22 07:08:19,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1612 transitions. [2020-12-22 07:08:19,453 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1612 transitions. Word has length 156 [2020-12-22 07:08:19,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:19,453 INFO L481 AbstractCegarLoop]: Abstraction has 1507 states and 1612 transitions. [2020-12-22 07:08:19,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:19,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1612 transitions. [2020-12-22 07:08:19,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-12-22 07:08:19,456 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:19,456 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2020-12-22 07:08:19,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-22 07:08:19,457 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:19,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:19,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1860246650, now seen corresponding path program 1 times [2020-12-22 07:08:19,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:19,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917230632] [2020-12-22 07:08:19,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 07:08:19,478 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 07:08:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 07:08:19,498 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 07:08:19,569 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-22 07:08:19,570 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-22 07:08:19,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-22 07:08:19,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 07:08:19 BoogieIcfgContainer [2020-12-22 07:08:19,744 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-22 07:08:19,745 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-22 07:08:19,745 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-22 07:08:19,745 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-22 07:08:19,746 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:08:00" (3/4) ... [2020-12-22 07:08:19,748 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-22 07:08:19,903 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/systemc/token_ring.02.cil-2.c-witness.graphml [2020-12-22 07:08:19,904 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-22 07:08:19,905 INFO L168 Benchmark]: Toolchain (without parser) took 20614.69 ms. Allocated memory was 154.1 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 129.6 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 128.2 MB. Max. memory is 8.0 GB. [2020-12-22 07:08:19,906 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 154.1 MB. Free memory is still 128.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 07:08:19,906 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.16 ms. Allocated memory is still 154.1 MB. Free memory was 129.4 MB in the beginning and 115.7 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-12-22 07:08:19,907 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.78 ms. Allocated memory is still 154.1 MB. Free memory was 115.6 MB in the beginning and 112.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-12-22 07:08:19,907 INFO L168 Benchmark]: Boogie Preprocessor took 98.24 ms. Allocated memory is still 154.1 MB. Free memory was 112.5 MB in the beginning and 109.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-12-22 07:08:19,908 INFO L168 Benchmark]: RCFGBuilder took 1060.22 ms. Allocated memory is still 154.1 MB. Free memory was 109.8 MB in the beginning and 87.7 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.1 MB. Max. memory is 8.0 GB. [2020-12-22 07:08:19,908 INFO L168 Benchmark]: TraceAbstraction took 18857.86 ms. Allocated memory was 154.1 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 87.2 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 62.0 MB. Max. memory is 8.0 GB. [2020-12-22 07:08:19,908 INFO L168 Benchmark]: Witness Printer took 158.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 23.6 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. [2020-12-22 07:08:19,911 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 154.1 MB. Free memory is still 128.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 356.16 ms. Allocated memory is still 154.1 MB. Free memory was 129.4 MB in the beginning and 115.7 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 75.78 ms. Allocated memory is still 154.1 MB. Free memory was 115.6 MB in the beginning and 112.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 98.24 ms. Allocated memory is still 154.1 MB. Free memory was 112.5 MB in the beginning and 109.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1060.22 ms. Allocated memory is still 154.1 MB. Free memory was 109.8 MB in the beginning and 87.7 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 18857.86 ms. Allocated memory was 154.1 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 87.2 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 62.0 MB. Max. memory is 8.0 GB. * Witness Printer took 158.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 23.6 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int m_pc = 0; [L17] int t1_pc = 0; [L18] int t2_pc = 0; [L19] int m_st ; [L20] int t1_st ; [L21] int t2_st ; [L22] int m_i ; [L23] int t1_i ; [L24] int t2_i ; [L25] int M_E = 2; [L26] int T1_E = 2; [L27] int T2_E = 2; [L28] int E_M = 2; [L29] int E_1 = 2; [L30] int E_2 = 2; [L35] int token ; [L37] int local ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L602] int __retres1 ; [L516] m_i = 1 [L517] t1_i = 1 [L518] t2_i = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L543] int kernel_st ; [L544] int tmp ; [L545] int tmp___0 ; [L549] kernel_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L235] COND TRUE m_i == 1 [L236] m_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L240] COND TRUE t1_i == 1 [L241] t1_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L245] COND TRUE t2_i == 1 [L246] t2_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L348] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L353] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L358] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L363] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L368] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L373] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L170] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L180] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L182] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L427] tmp = is_master_triggered() [L429] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L186] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L189] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L199] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L201] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L435] tmp___0 = is_transmit1_triggered() [L437] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L205] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L208] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L218] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L220] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L443] tmp___1 = is_transmit2_triggered() [L445] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L386] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L391] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L396] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L401] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L406] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L411] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L557] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L560] kernel_st = 1 [L281] int tmp ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L285] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L255] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L258] COND TRUE m_st == 0 [L259] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L276] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L288] tmp = exists_runnable_thread() [L290] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L295] COND TRUE m_st == 0 [L296] int tmp_ndt_1; [L297] tmp_ndt_1 = __VERIFIER_nondet_int() [L298] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L309] COND TRUE t1_st == 0 [L310] int tmp_ndt_2; [L311] tmp_ndt_2 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_2) [L314] t1_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L98] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L109] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L111] t1_pc = 1 [L112] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L323] COND TRUE t2_st == 0 [L324] int tmp_ndt_3; [L325] tmp_ndt_3 = __VERIFIER_nondet_int() [L326] COND TRUE \read(tmp_ndt_3) [L328] t2_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L134] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L145] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L147] t2_pc = 1 [L148] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L285] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L255] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L258] COND TRUE m_st == 0 [L259] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L276] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L288] tmp = exists_runnable_thread() [L290] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L295] COND TRUE m_st == 0 [L296] int tmp_ndt_1; [L297] tmp_ndt_1 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_1) [L300] m_st = 1 [L40] int tmp_var = __VERIFIER_nondet_int(); [L42] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L53] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L56] token = __VERIFIER_nondet_int() [L57] local = token [L58] E_1 = 1 [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L170] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L180] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L182] return (__retres1); VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L427] tmp = is_master_triggered() [L429] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L186] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L189] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L190] COND TRUE E_1 == 1 [L191] __retres1 = 1 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L201] return (__retres1); VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L435] tmp___0 = is_transmit1_triggered() [L437] COND TRUE \read(tmp___0) [L438] t1_st = 0 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L205] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L208] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L209] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L218] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L220] return (__retres1); VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L443] tmp___1 = is_transmit2_triggered() [L445] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L60] E_1 = 2 [L61] m_pc = 1 [L62] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L309] COND TRUE t1_st == 0 [L310] int tmp_ndt_2; [L311] tmp_ndt_2 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_2) [L314] t1_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L98] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L101] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L117] token += 1 [L118] E_2 = 1 [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L170] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L171] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L180] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L182] return (__retres1); VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L427] tmp = is_master_triggered() [L429] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L186] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L189] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L190] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L199] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L201] return (__retres1); VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L435] tmp___0 = is_transmit1_triggered() [L437] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L205] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L208] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L209] COND TRUE E_2 == 1 [L210] __retres1 = 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L220] return (__retres1); VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L443] tmp___1 = is_transmit2_triggered() [L445] COND TRUE \read(tmp___1) [L446] t2_st = 0 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L120] E_2 = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L109] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L111] t1_pc = 1 [L112] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L323] COND TRUE t2_st == 0 [L324] int tmp_ndt_3; [L325] tmp_ndt_3 = __VERIFIER_nondet_int() [L326] COND TRUE \read(tmp_ndt_3) [L328] t2_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L134] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L137] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L153] token += 1 [L154] E_M = 1 [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L170] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L171] COND TRUE E_M == 1 [L172] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L182] return (__retres1); VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L427] tmp = is_master_triggered() [L429] COND TRUE \read(tmp) [L430] m_st = 0 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L186] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L189] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L190] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L199] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L201] return (__retres1); VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L435] tmp___0 = is_transmit1_triggered() [L437] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L205] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L208] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L209] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L218] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L220] return (__retres1); VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L443] tmp___1 = is_transmit2_triggered() [L445] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L156] E_M = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L145] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L147] t2_pc = 1 [L148] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L285] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L255] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L258] COND TRUE m_st == 0 [L259] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L276] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L288] tmp = exists_runnable_thread() [L290] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L295] COND TRUE m_st == 0 [L296] int tmp_ndt_1; [L297] tmp_ndt_1 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_1) [L300] m_st = 1 [L40] int tmp_var = __VERIFIER_nondet_int(); [L42] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L45] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L67] COND FALSE !(token != local + 2) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L72] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L73] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L78] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L79] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L80] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L12] reach_error() VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 225 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 18.6s, OverallIterations: 29, TraceHistogramMax: 3, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 9880 SDtfs, 12499 SDslu, 9568 SDs, 0 SdLazy, 711 SolverSat, 261 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7170occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 6361 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 2553 NumberOfCodeBlocks, 2553 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2368 ConstructedInterpolants, 0 QuantifiedInterpolants, 468497 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 358/358 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...