/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.03.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 07:08:02,234 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 07:08:02,238 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 07:08:02,300 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 07:08:02,301 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 07:08:02,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 07:08:02,311 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 07:08:02,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 07:08:02,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 07:08:02,332 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 07:08:02,334 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 07:08:02,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 07:08:02,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 07:08:02,341 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 07:08:02,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 07:08:02,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 07:08:02,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 07:08:02,364 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 07:08:02,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 07:08:02,383 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 07:08:02,385 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 07:08:02,388 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 07:08:02,390 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 07:08:02,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 07:08:02,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 07:08:02,402 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 07:08:02,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 07:08:02,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 07:08:02,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 07:08:02,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 07:08:02,407 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 07:08:02,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 07:08:02,411 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 07:08:02,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 07:08:02,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 07:08:02,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 07:08:02,414 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 07:08:02,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 07:08:02,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 07:08:02,416 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 07:08:02,417 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 07:08:02,418 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:08:02,482 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 07:08:02,482 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 07:08:02,488 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 07:08:02,488 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 07:08:02,488 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 07:08:02,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 07:08:02,489 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 07:08:02,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 07:08:02,489 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 07:08:02,490 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 07:08:02,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 07:08:02,491 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 07:08:02,492 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 07:08:02,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 07:08:02,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 07:08:02,492 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 07:08:02,492 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 07:08:02,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 07:08:02,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 07:08:02,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 07:08:02,494 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 07:08:02,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 07:08:02,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 07:08:02,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 07:08:02,495 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 07:08:02,495 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:08:03,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 07:08:03,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 07:08:03,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 07:08:03,069 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 07:08:03,070 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 07:08:03,071 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.03.cil-1.c [2020-12-22 07:08:03,154 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d9263707/519fac9481bf495aae07722ff8adc8a5/FLAG9ffbe21bb [2020-12-22 07:08:03,886 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 07:08:03,887 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.03.cil-1.c [2020-12-22 07:08:03,900 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d9263707/519fac9481bf495aae07722ff8adc8a5/FLAG9ffbe21bb [2020-12-22 07:08:04,181 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d9263707/519fac9481bf495aae07722ff8adc8a5 [2020-12-22 07:08:04,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 07:08:04,187 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 07:08:04,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 07:08:04,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 07:08:04,193 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 07:08:04,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:08:04" (1/1) ... [2020-12-22 07:08:04,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25894a85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:08:04, skipping insertion in model container [2020-12-22 07:08:04,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:08:04" (1/1) ... [2020-12-22 07:08:04,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 07:08:04,239 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 07:08:04,399 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.03.cil-1.c[366,379] [2020-12-22 07:08:04,527 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 07:08:04,541 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 07:08:04,554 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.03.cil-1.c[366,379] [2020-12-22 07:08:04,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 07:08:04,625 INFO L208 MainTranslator]: Completed translation [2020-12-22 07:08:04,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:08:04 WrapperNode [2020-12-22 07:08:04,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 07:08:04,627 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 07:08:04,628 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 07:08:04,628 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 07:08:04,637 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:08:04" (1/1) ... [2020-12-22 07:08:04,650 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:08:04" (1/1) ... [2020-12-22 07:08:04,717 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 07:08:04,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 07:08:04,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 07:08:04,719 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 07:08:04,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:08:04" (1/1) ... [2020-12-22 07:08:04,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:08:04" (1/1) ... [2020-12-22 07:08:04,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:08:04" (1/1) ... [2020-12-22 07:08:04,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:08:04" (1/1) ... [2020-12-22 07:08:04,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:08:04" (1/1) ... [2020-12-22 07:08:04,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:08:04" (1/1) ... [2020-12-22 07:08:04,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:08:04" (1/1) ... [2020-12-22 07:08:04,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 07:08:04,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 07:08:04,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 07:08:04,833 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 07:08:04,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:08:04" (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:08:04,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 07:08:04,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 07:08:04,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 07:08:04,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 07:08:06,153 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 07:08:06,153 INFO L299 CfgBuilder]: Removed 132 assume(true) statements. [2020-12-22 07:08:06,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:08:06 BoogieIcfgContainer [2020-12-22 07:08:06,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 07:08:06,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 07:08:06,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 07:08:06,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 07:08:06,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 07:08:04" (1/3) ... [2020-12-22 07:08:06,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c15918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 07:08:06, skipping insertion in model container [2020-12-22 07:08:06,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:08:04" (2/3) ... [2020-12-22 07:08:06,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c15918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 07:08:06, skipping insertion in model container [2020-12-22 07:08:06,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:08:06" (3/3) ... [2020-12-22 07:08:06,170 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-1.c [2020-12-22 07:08:06,180 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 07:08:06,191 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-22 07:08:06,218 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-12-22 07:08:06,264 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 07:08:06,265 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 07:08:06,265 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 07:08:06,265 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 07:08:06,267 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 07:08:06,268 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 07:08:06,268 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 07:08:06,268 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 07:08:06,314 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states. [2020-12-22 07:08:06,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-22 07:08:06,332 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:06,333 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:06,334 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:06,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:06,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1976596934, now seen corresponding path program 1 times [2020-12-22 07:08:06,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:06,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441416524] [2020-12-22 07:08:06,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:06,757 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:06,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441416524] [2020-12-22 07:08:06,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:06,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:06,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456727084] [2020-12-22 07:08:06,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:06,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:06,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:06,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:06,801 INFO L87 Difference]: Start difference. First operand 316 states. Second operand 3 states. [2020-12-22 07:08:06,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:06,969 INFO L93 Difference]: Finished difference Result 627 states and 979 transitions. [2020-12-22 07:08:06,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:06,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-12-22 07:08:06,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:06,992 INFO L225 Difference]: With dead ends: 627 [2020-12-22 07:08:06,992 INFO L226 Difference]: Without dead ends: 312 [2020-12-22 07:08:06,999 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:07,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2020-12-22 07:08:07,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2020-12-22 07:08:07,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2020-12-22 07:08:07,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 474 transitions. [2020-12-22 07:08:07,087 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 474 transitions. Word has length 61 [2020-12-22 07:08:07,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:07,088 INFO L481 AbstractCegarLoop]: Abstraction has 312 states and 474 transitions. [2020-12-22 07:08:07,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:07,089 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 474 transitions. [2020-12-22 07:08:07,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-22 07:08:07,092 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:07,092 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:07,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 07:08:07,093 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:07,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:07,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1057453112, now seen corresponding path program 1 times [2020-12-22 07:08:07,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:07,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719276992] [2020-12-22 07:08:07,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:07,179 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:07,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719276992] [2020-12-22 07:08:07,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:07,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 07:08:07,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849580822] [2020-12-22 07:08:07,182 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:07,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:07,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:07,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:07,184 INFO L87 Difference]: Start difference. First operand 312 states and 474 transitions. Second operand 3 states. [2020-12-22 07:08:07,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:07,315 INFO L93 Difference]: Finished difference Result 848 states and 1286 transitions. [2020-12-22 07:08:07,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:07,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-12-22 07:08:07,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:07,322 INFO L225 Difference]: With dead ends: 848 [2020-12-22 07:08:07,322 INFO L226 Difference]: Without dead ends: 544 [2020-12-22 07:08:07,326 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:07,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-12-22 07:08:07,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 540. [2020-12-22 07:08:07,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2020-12-22 07:08:07,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 818 transitions. [2020-12-22 07:08:07,400 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 818 transitions. Word has length 61 [2020-12-22 07:08:07,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:07,400 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 818 transitions. [2020-12-22 07:08:07,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:07,402 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 818 transitions. [2020-12-22 07:08:07,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-22 07:08:07,412 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:07,413 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:07,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-22 07:08:07,413 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:07,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:07,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1933472118, now seen corresponding path program 1 times [2020-12-22 07:08:07,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:07,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101076058] [2020-12-22 07:08:07,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:07,534 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:07,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101076058] [2020-12-22 07:08:07,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:07,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:07,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198244573] [2020-12-22 07:08:07,536 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:08:07,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:07,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:08:07,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:08:07,538 INFO L87 Difference]: Start difference. First operand 540 states and 818 transitions. Second operand 4 states. [2020-12-22 07:08:07,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:07,668 INFO L93 Difference]: Finished difference Result 1302 states and 1969 transitions. [2020-12-22 07:08:07,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:08:07,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-12-22 07:08:07,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:07,674 INFO L225 Difference]: With dead ends: 1302 [2020-12-22 07:08:07,674 INFO L226 Difference]: Without dead ends: 771 [2020-12-22 07:08:07,677 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:07,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2020-12-22 07:08:07,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 540. [2020-12-22 07:08:07,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2020-12-22 07:08:07,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 815 transitions. [2020-12-22 07:08:07,717 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 815 transitions. Word has length 61 [2020-12-22 07:08:07,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:07,718 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 815 transitions. [2020-12-22 07:08:07,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:08:07,718 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 815 transitions. [2020-12-22 07:08:07,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-22 07:08:07,719 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:07,719 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:07,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-22 07:08:07,720 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:07,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:07,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1917594504, now seen corresponding path program 1 times [2020-12-22 07:08:07,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:07,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381336057] [2020-12-22 07:08:07,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:07,834 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:07,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381336057] [2020-12-22 07:08:07,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:07,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:07,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565596869] [2020-12-22 07:08:07,839 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:08:07,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:07,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:08:07,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:08:07,841 INFO L87 Difference]: Start difference. First operand 540 states and 815 transitions. Second operand 4 states. [2020-12-22 07:08:07,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:07,954 INFO L93 Difference]: Finished difference Result 1300 states and 1959 transitions. [2020-12-22 07:08:07,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:08:07,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-12-22 07:08:07,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:07,960 INFO L225 Difference]: With dead ends: 1300 [2020-12-22 07:08:07,960 INFO L226 Difference]: Without dead ends: 770 [2020-12-22 07:08:07,962 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:07,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2020-12-22 07:08:08,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 540. [2020-12-22 07:08:08,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2020-12-22 07:08:08,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 812 transitions. [2020-12-22 07:08:08,033 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 812 transitions. Word has length 61 [2020-12-22 07:08:08,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:08,033 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 812 transitions. [2020-12-22 07:08:08,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:08:08,033 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 812 transitions. [2020-12-22 07:08:08,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-22 07:08:08,034 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:08,035 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:08,035 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-22 07:08:08,035 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:08,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:08,036 INFO L82 PathProgramCache]: Analyzing trace with hash -379254474, now seen corresponding path program 1 times [2020-12-22 07:08:08,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:08,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847076580] [2020-12-22 07:08:08,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:08,100 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:08,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847076580] [2020-12-22 07:08:08,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:08,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 07:08:08,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604598201] [2020-12-22 07:08:08,104 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:08,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:08,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:08,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:08,108 INFO L87 Difference]: Start difference. First operand 540 states and 812 transitions. Second operand 3 states. [2020-12-22 07:08:08,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:08,168 INFO L93 Difference]: Finished difference Result 1069 states and 1609 transitions. [2020-12-22 07:08:08,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:08,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-12-22 07:08:08,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:08,173 INFO L225 Difference]: With dead ends: 1069 [2020-12-22 07:08:08,173 INFO L226 Difference]: Without dead ends: 540 [2020-12-22 07:08:08,175 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:08,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-12-22 07:08:08,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2020-12-22 07:08:08,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2020-12-22 07:08:08,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 804 transitions. [2020-12-22 07:08:08,218 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 804 transitions. Word has length 61 [2020-12-22 07:08:08,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:08,219 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 804 transitions. [2020-12-22 07:08:08,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:08,219 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 804 transitions. [2020-12-22 07:08:08,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-22 07:08:08,221 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:08,222 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:08,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-22 07:08:08,223 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:08,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:08,224 INFO L82 PathProgramCache]: Analyzing trace with hash 198182970, now seen corresponding path program 1 times [2020-12-22 07:08:08,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:08,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341924808] [2020-12-22 07:08:08,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:08,331 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:08,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341924808] [2020-12-22 07:08:08,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:08,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 07:08:08,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177125391] [2020-12-22 07:08:08,333 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:08,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:08,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:08,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:08,336 INFO L87 Difference]: Start difference. First operand 540 states and 804 transitions. Second operand 3 states. [2020-12-22 07:08:08,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:08,426 INFO L93 Difference]: Finished difference Result 1068 states and 1592 transitions. [2020-12-22 07:08:08,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:08,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-12-22 07:08:08,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:08,430 INFO L225 Difference]: With dead ends: 1068 [2020-12-22 07:08:08,431 INFO L226 Difference]: Without dead ends: 540 [2020-12-22 07:08:08,433 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:08,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-12-22 07:08:08,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2020-12-22 07:08:08,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2020-12-22 07:08:08,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 786 transitions. [2020-12-22 07:08:08,473 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 786 transitions. Word has length 61 [2020-12-22 07:08:08,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:08,474 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 786 transitions. [2020-12-22 07:08:08,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:08,475 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 786 transitions. [2020-12-22 07:08:08,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-22 07:08:08,477 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:08,477 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:08,478 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-22 07:08:08,478 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:08,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:08,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1144447607, now seen corresponding path program 1 times [2020-12-22 07:08:08,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:08,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005878282] [2020-12-22 07:08:08,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:08,587 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:08,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005878282] [2020-12-22 07:08:08,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:08,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 07:08:08,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337271178] [2020-12-22 07:08:08,592 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:08,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:08,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:08,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:08,594 INFO L87 Difference]: Start difference. First operand 540 states and 786 transitions. Second operand 3 states. [2020-12-22 07:08:08,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:08,672 INFO L93 Difference]: Finished difference Result 1066 states and 1553 transitions. [2020-12-22 07:08:08,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:08,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-12-22 07:08:08,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:08,680 INFO L225 Difference]: With dead ends: 1066 [2020-12-22 07:08:08,680 INFO L226 Difference]: Without dead ends: 540 [2020-12-22 07:08:08,683 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:08,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-12-22 07:08:08,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2020-12-22 07:08:08,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2020-12-22 07:08:08,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 768 transitions. [2020-12-22 07:08:08,734 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 768 transitions. Word has length 61 [2020-12-22 07:08:08,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:08,734 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 768 transitions. [2020-12-22 07:08:08,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:08,735 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 768 transitions. [2020-12-22 07:08:08,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-22 07:08:08,736 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:08,737 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:08,737 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-22 07:08:08,737 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:08,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:08,738 INFO L82 PathProgramCache]: Analyzing trace with hash 485983540, now seen corresponding path program 1 times [2020-12-22 07:08:08,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:08,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705216285] [2020-12-22 07:08:08,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:08,800 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:08,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705216285] [2020-12-22 07:08:08,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:08,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 07:08:08,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725276797] [2020-12-22 07:08:08,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:08,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:08,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:08,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:08,808 INFO L87 Difference]: Start difference. First operand 540 states and 768 transitions. Second operand 3 states. [2020-12-22 07:08:08,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:08,892 INFO L93 Difference]: Finished difference Result 1065 states and 1516 transitions. [2020-12-22 07:08:08,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:08,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-12-22 07:08:08,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:08,897 INFO L225 Difference]: With dead ends: 1065 [2020-12-22 07:08:08,898 INFO L226 Difference]: Without dead ends: 540 [2020-12-22 07:08:08,900 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:08,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-12-22 07:08:08,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2020-12-22 07:08:08,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2020-12-22 07:08:08,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 750 transitions. [2020-12-22 07:08:08,941 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 750 transitions. Word has length 61 [2020-12-22 07:08:08,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:08,942 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 750 transitions. [2020-12-22 07:08:08,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:08,942 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 750 transitions. [2020-12-22 07:08:08,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-22 07:08:08,943 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:08,944 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:08,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-22 07:08:08,944 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:08,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:08,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1475481145, now seen corresponding path program 1 times [2020-12-22 07:08:08,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:08,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81064624] [2020-12-22 07:08:08,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:09,045 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:09,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81064624] [2020-12-22 07:08:09,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:09,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 07:08:09,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366642293] [2020-12-22 07:08:09,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:08:09,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:09,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:08:09,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:08:09,059 INFO L87 Difference]: Start difference. First operand 540 states and 750 transitions. Second operand 5 states. [2020-12-22 07:08:09,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:09,247 INFO L93 Difference]: Finished difference Result 1372 states and 1926 transitions. [2020-12-22 07:08:09,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 07:08:09,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2020-12-22 07:08:09,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:09,254 INFO L225 Difference]: With dead ends: 1372 [2020-12-22 07:08:09,254 INFO L226 Difference]: Without dead ends: 854 [2020-12-22 07:08:09,256 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:09,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2020-12-22 07:08:09,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 546. [2020-12-22 07:08:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2020-12-22 07:08:09,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 746 transitions. [2020-12-22 07:08:09,307 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 746 transitions. Word has length 61 [2020-12-22 07:08:09,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:09,313 INFO L481 AbstractCegarLoop]: Abstraction has 546 states and 746 transitions. [2020-12-22 07:08:09,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:08:09,313 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 746 transitions. [2020-12-22 07:08:09,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-22 07:08:09,314 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:09,314 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:09,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-22 07:08:09,315 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:09,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:09,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1899127867, now seen corresponding path program 1 times [2020-12-22 07:08:09,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:09,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311638455] [2020-12-22 07:08:09,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:09,392 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:09,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311638455] [2020-12-22 07:08:09,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:09,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 07:08:09,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096990337] [2020-12-22 07:08:09,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:08:09,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:09,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:08:09,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:08:09,400 INFO L87 Difference]: Start difference. First operand 546 states and 746 transitions. Second operand 5 states. [2020-12-22 07:08:09,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:09,706 INFO L93 Difference]: Finished difference Result 1918 states and 2625 transitions. [2020-12-22 07:08:09,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 07:08:09,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2020-12-22 07:08:09,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:09,716 INFO L225 Difference]: With dead ends: 1918 [2020-12-22 07:08:09,717 INFO L226 Difference]: Without dead ends: 1401 [2020-12-22 07:08:09,719 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:09,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2020-12-22 07:08:09,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 582. [2020-12-22 07:08:09,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2020-12-22 07:08:09,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 782 transitions. [2020-12-22 07:08:09,784 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 782 transitions. Word has length 61 [2020-12-22 07:08:09,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:09,784 INFO L481 AbstractCegarLoop]: Abstraction has 582 states and 782 transitions. [2020-12-22 07:08:09,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:08:09,784 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 782 transitions. [2020-12-22 07:08:09,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-22 07:08:09,785 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:09,785 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:09,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-22 07:08:09,786 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:09,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:09,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1055122365, now seen corresponding path program 1 times [2020-12-22 07:08:09,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:09,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056728441] [2020-12-22 07:08:09,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:09,832 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:09,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056728441] [2020-12-22 07:08:09,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:09,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 07:08:09,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132272189] [2020-12-22 07:08:09,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:08:09,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:09,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:08:09,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:08:09,835 INFO L87 Difference]: Start difference. First operand 582 states and 782 transitions. Second operand 5 states. [2020-12-22 07:08:10,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:10,046 INFO L93 Difference]: Finished difference Result 1559 states and 2113 transitions. [2020-12-22 07:08:10,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 07:08:10,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2020-12-22 07:08:10,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:10,052 INFO L225 Difference]: With dead ends: 1559 [2020-12-22 07:08:10,053 INFO L226 Difference]: Without dead ends: 1016 [2020-12-22 07:08:10,054 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:10,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2020-12-22 07:08:10,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 588. [2020-12-22 07:08:10,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2020-12-22 07:08:10,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 778 transitions. [2020-12-22 07:08:10,131 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 778 transitions. Word has length 61 [2020-12-22 07:08:10,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:10,131 INFO L481 AbstractCegarLoop]: Abstraction has 588 states and 778 transitions. [2020-12-22 07:08:10,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:08:10,132 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 778 transitions. [2020-12-22 07:08:10,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-22 07:08:10,133 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:10,133 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:10,133 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-22 07:08:10,134 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:10,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:10,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1853641537, now seen corresponding path program 1 times [2020-12-22 07:08:10,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:10,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151309957] [2020-12-22 07:08:10,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:10,185 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:10,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151309957] [2020-12-22 07:08:10,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:10,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 07:08:10,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730645523] [2020-12-22 07:08:10,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:08:10,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:10,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:08:10,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:08:10,189 INFO L87 Difference]: Start difference. First operand 588 states and 778 transitions. Second operand 5 states. [2020-12-22 07:08:10,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:10,446 INFO L93 Difference]: Finished difference Result 1612 states and 2151 transitions. [2020-12-22 07:08:10,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 07:08:10,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2020-12-22 07:08:10,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:10,453 INFO L225 Difference]: With dead ends: 1612 [2020-12-22 07:08:10,454 INFO L226 Difference]: Without dead ends: 1070 [2020-12-22 07:08:10,456 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:10,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2020-12-22 07:08:10,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 594. [2020-12-22 07:08:10,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2020-12-22 07:08:10,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 774 transitions. [2020-12-22 07:08:10,553 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 774 transitions. Word has length 61 [2020-12-22 07:08:10,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:10,554 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 774 transitions. [2020-12-22 07:08:10,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:08:10,554 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 774 transitions. [2020-12-22 07:08:10,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-22 07:08:10,555 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:10,555 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:10,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-22 07:08:10,556 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:10,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:10,556 INFO L82 PathProgramCache]: Analyzing trace with hash 635887425, now seen corresponding path program 1 times [2020-12-22 07:08:10,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:10,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977996488] [2020-12-22 07:08:10,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:10,623 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:10,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977996488] [2020-12-22 07:08:10,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:10,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:10,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216730162] [2020-12-22 07:08:10,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:08:10,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:10,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:08:10,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:08:10,627 INFO L87 Difference]: Start difference. First operand 594 states and 774 transitions. Second operand 4 states. [2020-12-22 07:08:10,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:10,803 INFO L93 Difference]: Finished difference Result 1389 states and 1813 transitions. [2020-12-22 07:08:10,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:08:10,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-12-22 07:08:10,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:10,810 INFO L225 Difference]: With dead ends: 1389 [2020-12-22 07:08:10,810 INFO L226 Difference]: Without dead ends: 843 [2020-12-22 07:08:10,819 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:10,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2020-12-22 07:08:10,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 594. [2020-12-22 07:08:10,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2020-12-22 07:08:10,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 769 transitions. [2020-12-22 07:08:10,888 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 769 transitions. Word has length 61 [2020-12-22 07:08:10,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:10,889 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 769 transitions. [2020-12-22 07:08:10,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:08:10,889 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 769 transitions. [2020-12-22 07:08:10,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-22 07:08:10,892 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:10,892 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:10,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-22 07:08:10,892 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:10,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:10,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1058589251, now seen corresponding path program 1 times [2020-12-22 07:08:10,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:10,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216903017] [2020-12-22 07:08:10,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:10,932 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:10,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216903017] [2020-12-22 07:08:10,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:10,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:10,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35349693] [2020-12-22 07:08:10,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:08:10,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:10,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:08:10,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:08:10,935 INFO L87 Difference]: Start difference. First operand 594 states and 769 transitions. Second operand 4 states. [2020-12-22 07:08:11,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:11,081 INFO L93 Difference]: Finished difference Result 1388 states and 1801 transitions. [2020-12-22 07:08:11,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:08:11,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-12-22 07:08:11,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:11,086 INFO L225 Difference]: With dead ends: 1388 [2020-12-22 07:08:11,087 INFO L226 Difference]: Without dead ends: 843 [2020-12-22 07:08:11,088 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:11,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2020-12-22 07:08:11,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 594. [2020-12-22 07:08:11,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2020-12-22 07:08:11,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 764 transitions. [2020-12-22 07:08:11,160 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 764 transitions. Word has length 61 [2020-12-22 07:08:11,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:11,161 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 764 transitions. [2020-12-22 07:08:11,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:08:11,161 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 764 transitions. [2020-12-22 07:08:11,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-22 07:08:11,162 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:11,162 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:11,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-22 07:08:11,163 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:11,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:11,163 INFO L82 PathProgramCache]: Analyzing trace with hash 240940801, now seen corresponding path program 1 times [2020-12-22 07:08:11,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:11,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881357685] [2020-12-22 07:08:11,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:11,202 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:11,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881357685] [2020-12-22 07:08:11,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:11,203 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:11,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259239893] [2020-12-22 07:08:11,203 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:08:11,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:11,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:08:11,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:08:11,204 INFO L87 Difference]: Start difference. First operand 594 states and 764 transitions. Second operand 4 states. [2020-12-22 07:08:11,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:11,416 INFO L93 Difference]: Finished difference Result 1516 states and 1931 transitions. [2020-12-22 07:08:11,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:08:11,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-12-22 07:08:11,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:11,422 INFO L225 Difference]: With dead ends: 1516 [2020-12-22 07:08:11,423 INFO L226 Difference]: Without dead ends: 951 [2020-12-22 07:08:11,425 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:11,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2020-12-22 07:08:11,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 681. [2020-12-22 07:08:11,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2020-12-22 07:08:11,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 848 transitions. [2020-12-22 07:08:11,495 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 848 transitions. Word has length 61 [2020-12-22 07:08:11,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:11,496 INFO L481 AbstractCegarLoop]: Abstraction has 681 states and 848 transitions. [2020-12-22 07:08:11,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:08:11,496 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 848 transitions. [2020-12-22 07:08:11,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-22 07:08:11,497 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:11,497 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:11,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-22 07:08:11,498 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:11,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:11,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1347407101, now seen corresponding path program 1 times [2020-12-22 07:08:11,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:11,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493548200] [2020-12-22 07:08:11,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:11,536 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:11,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493548200] [2020-12-22 07:08:11,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:11,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 07:08:11,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462068430] [2020-12-22 07:08:11,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:11,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:11,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:11,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:11,541 INFO L87 Difference]: Start difference. First operand 681 states and 848 transitions. Second operand 3 states. [2020-12-22 07:08:11,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:11,708 INFO L93 Difference]: Finished difference Result 1893 states and 2357 transitions. [2020-12-22 07:08:11,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:11,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-12-22 07:08:11,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:11,716 INFO L225 Difference]: With dead ends: 1893 [2020-12-22 07:08:11,716 INFO L226 Difference]: Without dead ends: 1233 [2020-12-22 07:08:11,719 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,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2020-12-22 07:08:11,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1175. [2020-12-22 07:08:11,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1175 states. [2020-12-22 07:08:11,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1451 transitions. [2020-12-22 07:08:11,865 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1451 transitions. Word has length 61 [2020-12-22 07:08:11,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:11,866 INFO L481 AbstractCegarLoop]: Abstraction has 1175 states and 1451 transitions. [2020-12-22 07:08:11,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:11,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1451 transitions. [2020-12-22 07:08:11,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-22 07:08:11,868 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:11,869 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] [2020-12-22 07:08:11,869 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-22 07:08:11,869 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:11,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:11,870 INFO L82 PathProgramCache]: Analyzing trace with hash -648263858, now seen corresponding path program 1 times [2020-12-22 07:08:11,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:11,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434232767] [2020-12-22 07:08:11,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:11,930 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:11,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434232767] [2020-12-22 07:08:11,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:11,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:11,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134732304] [2020-12-22 07:08:11,931 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:08:11,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:11,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:08:11,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:08:11,933 INFO L87 Difference]: Start difference. First operand 1175 states and 1451 transitions. Second operand 4 states. [2020-12-22 07:08:12,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:12,374 INFO L93 Difference]: Finished difference Result 3772 states and 4664 transitions. [2020-12-22 07:08:12,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:08:12,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2020-12-22 07:08:12,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:12,388 INFO L225 Difference]: With dead ends: 3772 [2020-12-22 07:08:12,388 INFO L226 Difference]: Without dead ends: 2634 [2020-12-22 07:08:12,392 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:12,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2020-12-22 07:08:12,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2065. [2020-12-22 07:08:12,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2065 states. [2020-12-22 07:08:12,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 2065 states and 2544 transitions. [2020-12-22 07:08:12,615 INFO L78 Accepts]: Start accepts. Automaton has 2065 states and 2544 transitions. Word has length 99 [2020-12-22 07:08:12,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:12,616 INFO L481 AbstractCegarLoop]: Abstraction has 2065 states and 2544 transitions. [2020-12-22 07:08:12,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:08:12,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 2544 transitions. [2020-12-22 07:08:12,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-22 07:08:12,618 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:12,618 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] [2020-12-22 07:08:12,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-22 07:08:12,619 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:12,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:12,619 INFO L82 PathProgramCache]: Analyzing trace with hash -838618223, now seen corresponding path program 1 times [2020-12-22 07:08:12,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:12,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719246488] [2020-12-22 07:08:12,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:12,690 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:12,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719246488] [2020-12-22 07:08:12,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:12,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:12,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362804168] [2020-12-22 07:08:12,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:12,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:12,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:12,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:12,694 INFO L87 Difference]: Start difference. First operand 2065 states and 2544 transitions. Second operand 3 states. [2020-12-22 07:08:13,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:13,080 INFO L93 Difference]: Finished difference Result 5823 states and 7152 transitions. [2020-12-22 07:08:13,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:13,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2020-12-22 07:08:13,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:13,101 INFO L225 Difference]: With dead ends: 5823 [2020-12-22 07:08:13,102 INFO L226 Difference]: Without dead ends: 3841 [2020-12-22 07:08:13,106 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:13,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3841 states. [2020-12-22 07:08:13,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3841 to 3837. [2020-12-22 07:08:13,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3837 states. [2020-12-22 07:08:13,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 4666 transitions. [2020-12-22 07:08:13,576 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 4666 transitions. Word has length 99 [2020-12-22 07:08:13,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:13,577 INFO L481 AbstractCegarLoop]: Abstraction has 3837 states and 4666 transitions. [2020-12-22 07:08:13,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:13,577 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 4666 transitions. [2020-12-22 07:08:13,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-22 07:08:13,580 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:13,580 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] [2020-12-22 07:08:13,580 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-22 07:08:13,581 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:13,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:13,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1280283035, now seen corresponding path program 1 times [2020-12-22 07:08:13,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:13,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631829877] [2020-12-22 07:08:13,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:13,629 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:13,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631829877] [2020-12-22 07:08:13,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:13,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:13,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075193977] [2020-12-22 07:08:13,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:13,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:13,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:13,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:13,632 INFO L87 Difference]: Start difference. First operand 3837 states and 4666 transitions. Second operand 3 states. [2020-12-22 07:08:14,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:14,497 INFO L93 Difference]: Finished difference Result 10822 states and 13146 transitions. [2020-12-22 07:08:14,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:14,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2020-12-22 07:08:14,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:14,539 INFO L225 Difference]: With dead ends: 10822 [2020-12-22 07:08:14,539 INFO L226 Difference]: Without dead ends: 7068 [2020-12-22 07:08:14,550 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:14,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7068 states. [2020-12-22 07:08:15,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7068 to 7064. [2020-12-22 07:08:15,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7064 states. [2020-12-22 07:08:15,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7064 states to 7064 states and 8530 transitions. [2020-12-22 07:08:15,515 INFO L78 Accepts]: Start accepts. Automaton has 7064 states and 8530 transitions. Word has length 100 [2020-12-22 07:08:15,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:15,516 INFO L481 AbstractCegarLoop]: Abstraction has 7064 states and 8530 transitions. [2020-12-22 07:08:15,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:15,516 INFO L276 IsEmpty]: Start isEmpty. Operand 7064 states and 8530 transitions. [2020-12-22 07:08:15,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-22 07:08:15,521 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:15,521 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] [2020-12-22 07:08:15,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-22 07:08:15,522 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:15,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:15,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1663299043, now seen corresponding path program 1 times [2020-12-22 07:08:15,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:15,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632092059] [2020-12-22 07:08:15,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:15,550 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-22 07:08:15,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632092059] [2020-12-22 07:08:15,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:15,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:15,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572657242] [2020-12-22 07:08:15,551 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:15,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:15,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:15,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:15,552 INFO L87 Difference]: Start difference. First operand 7064 states and 8530 transitions. Second operand 3 states. [2020-12-22 07:08:16,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:16,617 INFO L93 Difference]: Finished difference Result 13968 states and 16884 transitions. [2020-12-22 07:08:16,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:16,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2020-12-22 07:08:16,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:16,654 INFO L225 Difference]: With dead ends: 13968 [2020-12-22 07:08:16,655 INFO L226 Difference]: Without dead ends: 6987 [2020-12-22 07:08:16,670 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,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6987 states. [2020-12-22 07:08:17,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6987 to 6987. [2020-12-22 07:08:17,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6987 states. [2020-12-22 07:08:17,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6987 states to 6987 states and 8445 transitions. [2020-12-22 07:08:17,578 INFO L78 Accepts]: Start accepts. Automaton has 6987 states and 8445 transitions. Word has length 100 [2020-12-22 07:08:17,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:17,578 INFO L481 AbstractCegarLoop]: Abstraction has 6987 states and 8445 transitions. [2020-12-22 07:08:17,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:17,578 INFO L276 IsEmpty]: Start isEmpty. Operand 6987 states and 8445 transitions. [2020-12-22 07:08:17,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-22 07:08:17,583 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:17,584 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] [2020-12-22 07:08:17,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-22 07:08:17,584 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:17,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:17,585 INFO L82 PathProgramCache]: Analyzing trace with hash 291949850, now seen corresponding path program 1 times [2020-12-22 07:08:17,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:17,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797703703] [2020-12-22 07:08:17,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:17,647 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:17,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797703703] [2020-12-22 07:08:17,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:17,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:17,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775255148] [2020-12-22 07:08:17,649 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:17,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:17,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:17,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:17,650 INFO L87 Difference]: Start difference. First operand 6987 states and 8445 transitions. Second operand 3 states. [2020-12-22 07:08:18,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:18,725 INFO L93 Difference]: Finished difference Result 19767 states and 23907 transitions. [2020-12-22 07:08:18,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:18,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2020-12-22 07:08:18,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:18,759 INFO L225 Difference]: With dead ends: 19767 [2020-12-22 07:08:18,759 INFO L226 Difference]: Without dead ends: 12863 [2020-12-22 07:08:18,772 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,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12863 states. [2020-12-22 07:08:19,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12863 to 12859. [2020-12-22 07:08:19,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12859 states. [2020-12-22 07:08:20,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12859 states to 12859 states and 15495 transitions. [2020-12-22 07:08:20,003 INFO L78 Accepts]: Start accepts. Automaton has 12859 states and 15495 transitions. Word has length 101 [2020-12-22 07:08:20,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:20,004 INFO L481 AbstractCegarLoop]: Abstraction has 12859 states and 15495 transitions. [2020-12-22 07:08:20,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:20,004 INFO L276 IsEmpty]: Start isEmpty. Operand 12859 states and 15495 transitions. [2020-12-22 07:08:20,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-22 07:08:20,011 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:20,012 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] [2020-12-22 07:08:20,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-22 07:08:20,012 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:20,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:20,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1643335068, now seen corresponding path program 1 times [2020-12-22 07:08:20,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:20,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164663134] [2020-12-22 07:08:20,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:20,047 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-22 07:08:20,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164663134] [2020-12-22 07:08:20,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:20,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:20,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392195551] [2020-12-22 07:08:20,052 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:20,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:20,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:20,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:20,053 INFO L87 Difference]: Start difference. First operand 12859 states and 15495 transitions. Second operand 3 states. [2020-12-22 07:08:21,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:21,370 INFO L93 Difference]: Finished difference Result 25559 states and 30817 transitions. [2020-12-22 07:08:21,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:21,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2020-12-22 07:08:21,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:21,403 INFO L225 Difference]: With dead ends: 25559 [2020-12-22 07:08:21,403 INFO L226 Difference]: Without dead ends: 12783 [2020-12-22 07:08:21,420 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:21,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12783 states. [2020-12-22 07:08:22,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12783 to 12783. [2020-12-22 07:08:22,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12783 states. [2020-12-22 07:08:22,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12783 states to 12783 states and 15412 transitions. [2020-12-22 07:08:22,448 INFO L78 Accepts]: Start accepts. Automaton has 12783 states and 15412 transitions. Word has length 101 [2020-12-22 07:08:22,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:22,449 INFO L481 AbstractCegarLoop]: Abstraction has 12783 states and 15412 transitions. [2020-12-22 07:08:22,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:22,449 INFO L276 IsEmpty]: Start isEmpty. Operand 12783 states and 15412 transitions. [2020-12-22 07:08:22,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-22 07:08:22,457 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:22,457 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] [2020-12-22 07:08:22,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-22 07:08:22,457 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:22,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:22,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1739654126, now seen corresponding path program 1 times [2020-12-22 07:08:22,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:22,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501224549] [2020-12-22 07:08:22,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:22,518 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:22,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501224549] [2020-12-22 07:08:22,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:22,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:08:22,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611752753] [2020-12-22 07:08:22,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:08:22,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:22,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:08:22,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:08:22,527 INFO L87 Difference]: Start difference. First operand 12783 states and 15412 transitions. Second operand 4 states. [2020-12-22 07:08:24,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:24,314 INFO L93 Difference]: Finished difference Result 36486 states and 43733 transitions. [2020-12-22 07:08:24,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:08:24,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2020-12-22 07:08:24,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:24,354 INFO L225 Difference]: With dead ends: 36486 [2020-12-22 07:08:24,354 INFO L226 Difference]: Without dead ends: 18163 [2020-12-22 07:08:24,376 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:24,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18163 states. [2020-12-22 07:08:25,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18163 to 18159. [2020-12-22 07:08:25,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18159 states. [2020-12-22 07:08:25,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18159 states to 18159 states and 21519 transitions. [2020-12-22 07:08:25,676 INFO L78 Accepts]: Start accepts. Automaton has 18159 states and 21519 transitions. Word has length 102 [2020-12-22 07:08:25,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:25,676 INFO L481 AbstractCegarLoop]: Abstraction has 18159 states and 21519 transitions. [2020-12-22 07:08:25,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:08:25,677 INFO L276 IsEmpty]: Start isEmpty. Operand 18159 states and 21519 transitions. [2020-12-22 07:08:25,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-12-22 07:08:25,694 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:25,694 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, 1, 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:25,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-22 07:08:25,694 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:25,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:25,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1679759540, now seen corresponding path program 1 times [2020-12-22 07:08:25,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:25,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201945775] [2020-12-22 07:08:25,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:25,763 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:25,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201945775] [2020-12-22 07:08:25,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:25,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 07:08:25,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205924635] [2020-12-22 07:08:25,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:25,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:25,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:25,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:25,766 INFO L87 Difference]: Start difference. First operand 18159 states and 21519 transitions. Second operand 3 states. [2020-12-22 07:08:27,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:27,801 INFO L93 Difference]: Finished difference Result 41753 states and 49348 transitions. [2020-12-22 07:08:27,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:27,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2020-12-22 07:08:27,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:27,852 INFO L225 Difference]: With dead ends: 41753 [2020-12-22 07:08:27,852 INFO L226 Difference]: Without dead ends: 23653 [2020-12-22 07:08:27,873 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:27,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23653 states. [2020-12-22 07:08:29,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23653 to 23557. [2020-12-22 07:08:29,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23557 states. [2020-12-22 07:08:29,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23557 states to 23557 states and 27643 transitions. [2020-12-22 07:08:29,733 INFO L78 Accepts]: Start accepts. Automaton has 23557 states and 27643 transitions. Word has length 131 [2020-12-22 07:08:29,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:29,733 INFO L481 AbstractCegarLoop]: Abstraction has 23557 states and 27643 transitions. [2020-12-22 07:08:29,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:29,734 INFO L276 IsEmpty]: Start isEmpty. Operand 23557 states and 27643 transitions. [2020-12-22 07:08:29,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-22 07:08:29,750 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:29,750 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:29,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-22 07:08:29,750 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:29,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:29,751 INFO L82 PathProgramCache]: Analyzing trace with hash 736996014, now seen corresponding path program 1 times [2020-12-22 07:08:29,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:29,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134464024] [2020-12-22 07:08:29,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:29,809 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:29,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134464024] [2020-12-22 07:08:29,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:29,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:08:29,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929423388] [2020-12-22 07:08:29,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:08:29,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:29,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:08:29,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:08:29,811 INFO L87 Difference]: Start difference. First operand 23557 states and 27643 transitions. Second operand 4 states. [2020-12-22 07:08:31,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:31,505 INFO L93 Difference]: Finished difference Result 41645 states and 49079 transitions. [2020-12-22 07:08:31,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:08:31,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2020-12-22 07:08:31,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:31,542 INFO L225 Difference]: With dead ends: 41645 [2020-12-22 07:08:31,543 INFO L226 Difference]: Without dead ends: 23569 [2020-12-22 07:08:31,564 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:31,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23569 states. [2020-12-22 07:08:33,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23569 to 23557. [2020-12-22 07:08:33,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23557 states. [2020-12-22 07:08:33,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23557 states to 23557 states and 27583 transitions. [2020-12-22 07:08:33,530 INFO L78 Accepts]: Start accepts. Automaton has 23557 states and 27583 transitions. Word has length 148 [2020-12-22 07:08:33,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:33,530 INFO L481 AbstractCegarLoop]: Abstraction has 23557 states and 27583 transitions. [2020-12-22 07:08:33,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:08:33,530 INFO L276 IsEmpty]: Start isEmpty. Operand 23557 states and 27583 transitions. [2020-12-22 07:08:33,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-12-22 07:08:33,543 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:33,544 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:33,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-22 07:08:33,544 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:33,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:33,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1335072729, now seen corresponding path program 1 times [2020-12-22 07:08:33,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:33,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27752256] [2020-12-22 07:08:33,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:33,634 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-22 07:08:33,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27752256] [2020-12-22 07:08:33,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:33,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 07:08:33,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201557430] [2020-12-22 07:08:33,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:33,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:33,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:33,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:33,636 INFO L87 Difference]: Start difference. First operand 23557 states and 27583 transitions. Second operand 3 states. [2020-12-22 07:08:35,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:35,570 INFO L93 Difference]: Finished difference Result 52059 states and 60812 transitions. [2020-12-22 07:08:35,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:35,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2020-12-22 07:08:35,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:35,611 INFO L225 Difference]: With dead ends: 52059 [2020-12-22 07:08:35,611 INFO L226 Difference]: Without dead ends: 28547 [2020-12-22 07:08:35,635 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:35,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28547 states. [2020-12-22 07:08:37,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28547 to 28419. [2020-12-22 07:08:37,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28419 states. [2020-12-22 07:08:37,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28419 states to 28419 states and 33011 transitions. [2020-12-22 07:08:37,732 INFO L78 Accepts]: Start accepts. Automaton has 28419 states and 33011 transitions. Word has length 177 [2020-12-22 07:08:37,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:37,732 INFO L481 AbstractCegarLoop]: Abstraction has 28419 states and 33011 transitions. [2020-12-22 07:08:37,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:37,732 INFO L276 IsEmpty]: Start isEmpty. Operand 28419 states and 33011 transitions. [2020-12-22 07:08:37,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-12-22 07:08:37,753 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:37,753 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:37,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-22 07:08:37,754 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:37,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:37,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1751786614, now seen corresponding path program 1 times [2020-12-22 07:08:37,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:37,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720263045] [2020-12-22 07:08:37,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:37,855 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:37,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720263045] [2020-12-22 07:08:37,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:37,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:08:37,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657014479] [2020-12-22 07:08:37,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:08:37,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:37,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:08:37,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:08:37,858 INFO L87 Difference]: Start difference. First operand 28419 states and 33011 transitions. Second operand 4 states. [2020-12-22 07:08:39,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:39,937 INFO L93 Difference]: Finished difference Result 51907 states and 60515 transitions. [2020-12-22 07:08:39,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:08:39,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2020-12-22 07:08:39,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:39,975 INFO L225 Difference]: With dead ends: 51907 [2020-12-22 07:08:39,976 INFO L226 Difference]: Without dead ends: 28431 [2020-12-22 07:08:39,998 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:40,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28431 states. [2020-12-22 07:08:41,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28431 to 28419. [2020-12-22 07:08:41,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28419 states. [2020-12-22 07:08:41,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28419 states to 28419 states and 32911 transitions. [2020-12-22 07:08:41,896 INFO L78 Accepts]: Start accepts. Automaton has 28419 states and 32911 transitions. Word has length 180 [2020-12-22 07:08:41,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:41,897 INFO L481 AbstractCegarLoop]: Abstraction has 28419 states and 32911 transitions. [2020-12-22 07:08:41,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:08:41,897 INFO L276 IsEmpty]: Start isEmpty. Operand 28419 states and 32911 transitions. [2020-12-22 07:08:41,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-12-22 07:08:41,921 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:41,921 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:41,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-22 07:08:41,921 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:41,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:41,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1117959826, now seen corresponding path program 1 times [2020-12-22 07:08:41,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:41,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372086119] [2020-12-22 07:08:41,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:42,143 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-22 07:08:42,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372086119] [2020-12-22 07:08:42,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:42,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:08:42,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950199163] [2020-12-22 07:08:42,145 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:08:42,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:42,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:08:42,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:08:42,147 INFO L87 Difference]: Start difference. First operand 28419 states and 32911 transitions. Second operand 4 states. [2020-12-22 07:08:44,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:44,345 INFO L93 Difference]: Finished difference Result 56771 states and 65747 transitions. [2020-12-22 07:08:44,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:08:44,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2020-12-22 07:08:44,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:44,388 INFO L225 Difference]: With dead ends: 56771 [2020-12-22 07:08:44,389 INFO L226 Difference]: Without dead ends: 25869 [2020-12-22 07:08:44,416 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:44,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25869 states. [2020-12-22 07:08:46,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25869 to 25849. [2020-12-22 07:08:46,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25849 states. [2020-12-22 07:08:46,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25849 states to 25849 states and 29820 transitions. [2020-12-22 07:08:46,208 INFO L78 Accepts]: Start accepts. Automaton has 25849 states and 29820 transitions. Word has length 212 [2020-12-22 07:08:46,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:46,209 INFO L481 AbstractCegarLoop]: Abstraction has 25849 states and 29820 transitions. [2020-12-22 07:08:46,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:08:46,209 INFO L276 IsEmpty]: Start isEmpty. Operand 25849 states and 29820 transitions. [2020-12-22 07:08:46,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-12-22 07:08:46,221 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:46,222 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:46,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-22 07:08:46,222 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:46,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:46,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1763021255, now seen corresponding path program 1 times [2020-12-22 07:08:46,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:46,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763095019] [2020-12-22 07:08:46,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:46,346 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:08:46,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763095019] [2020-12-22 07:08:46,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:46,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:46,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309733146] [2020-12-22 07:08:46,347 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:46,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:46,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:46,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:46,348 INFO L87 Difference]: Start difference. First operand 25849 states and 29820 transitions. Second operand 3 states. [2020-12-22 07:08:48,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:48,210 INFO L93 Difference]: Finished difference Result 47941 states and 55471 transitions. [2020-12-22 07:08:48,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:48,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2020-12-22 07:08:48,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:48,243 INFO L225 Difference]: With dead ends: 47941 [2020-12-22 07:08:48,244 INFO L226 Difference]: Without dead ends: 25897 [2020-12-22 07:08:48,262 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:48,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25897 states. [2020-12-22 07:08:50,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25897 to 25849. [2020-12-22 07:08:50,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25849 states. [2020-12-22 07:08:50,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25849 states to 25849 states and 29228 transitions. [2020-12-22 07:08:50,222 INFO L78 Accepts]: Start accepts. Automaton has 25849 states and 29228 transitions. Word has length 212 [2020-12-22 07:08:50,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:50,222 INFO L481 AbstractCegarLoop]: Abstraction has 25849 states and 29228 transitions. [2020-12-22 07:08:50,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:50,222 INFO L276 IsEmpty]: Start isEmpty. Operand 25849 states and 29228 transitions. [2020-12-22 07:08:50,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-12-22 07:08:50,235 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:50,236 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:50,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-22 07:08:50,236 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:50,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:50,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1865011049, now seen corresponding path program 1 times [2020-12-22 07:08:50,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:50,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849907234] [2020-12-22 07:08:50,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:50,379 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:08:50,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849907234] [2020-12-22 07:08:50,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:50,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:50,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810385658] [2020-12-22 07:08:50,380 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:50,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:50,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:50,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:50,383 INFO L87 Difference]: Start difference. First operand 25849 states and 29228 transitions. Second operand 3 states. [2020-12-22 07:08:52,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:52,341 INFO L93 Difference]: Finished difference Result 45103 states and 51221 transitions. [2020-12-22 07:08:52,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:52,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2020-12-22 07:08:52,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:52,369 INFO L225 Difference]: With dead ends: 45103 [2020-12-22 07:08:52,369 INFO L226 Difference]: Without dead ends: 25905 [2020-12-22 07:08:52,382 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:52,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25905 states. [2020-12-22 07:08:54,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25905 to 25849. [2020-12-22 07:08:54,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25849 states. [2020-12-22 07:08:54,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25849 states to 25849 states and 28728 transitions. [2020-12-22 07:08:54,257 INFO L78 Accepts]: Start accepts. Automaton has 25849 states and 28728 transitions. Word has length 215 [2020-12-22 07:08:54,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:54,257 INFO L481 AbstractCegarLoop]: Abstraction has 25849 states and 28728 transitions. [2020-12-22 07:08:54,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:54,258 INFO L276 IsEmpty]: Start isEmpty. Operand 25849 states and 28728 transitions. [2020-12-22 07:08:54,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2020-12-22 07:08:54,269 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:54,269 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,269 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-22 07:08:54,269 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:54,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:54,270 INFO L82 PathProgramCache]: Analyzing trace with hash 562185031, now seen corresponding path program 1 times [2020-12-22 07:08:54,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:54,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449187843] [2020-12-22 07:08:54,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:54,414 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-22 07:08:54,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449187843] [2020-12-22 07:08:54,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:54,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:54,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471050821] [2020-12-22 07:08:54,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:54,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:54,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:54,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:54,419 INFO L87 Difference]: Start difference. First operand 25849 states and 28728 transitions. Second operand 3 states. [2020-12-22 07:08:56,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:56,398 INFO L93 Difference]: Finished difference Result 42795 states and 47751 transitions. [2020-12-22 07:08:56,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:56,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2020-12-22 07:08:56,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:56,427 INFO L225 Difference]: With dead ends: 42795 [2020-12-22 07:08:56,427 INFO L226 Difference]: Without dead ends: 26663 [2020-12-22 07:08:56,440 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:56,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26663 states. [2020-12-22 07:08:58,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26663 to 25849. [2020-12-22 07:08:58,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25849 states. [2020-12-22 07:08:58,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25849 states to 25849 states and 28326 transitions. [2020-12-22 07:08:58,293 INFO L78 Accepts]: Start accepts. Automaton has 25849 states and 28326 transitions. Word has length 218 [2020-12-22 07:08:58,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:58,293 INFO L481 AbstractCegarLoop]: Abstraction has 25849 states and 28326 transitions. [2020-12-22 07:08:58,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:58,293 INFO L276 IsEmpty]: Start isEmpty. Operand 25849 states and 28326 transitions. [2020-12-22 07:08:58,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-12-22 07:08:58,302 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:58,303 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-22 07:08:58,303 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:58,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:58,304 INFO L82 PathProgramCache]: Analyzing trace with hash -928723252, now seen corresponding path program 1 times [2020-12-22 07:08:58,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:58,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821703523] [2020-12-22 07:08:58,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:58,415 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:08:58,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821703523] [2020-12-22 07:08:58,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:58,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:58,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281727031] [2020-12-22 07:08:58,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:58,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:58,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:58,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:58,417 INFO L87 Difference]: Start difference. First operand 25849 states and 28326 transitions. Second operand 3 states. [2020-12-22 07:08:59,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:59,683 INFO L93 Difference]: Finished difference Result 43179 states and 47446 transitions. [2020-12-22 07:08:59,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:59,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2020-12-22 07:08:59,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:59,703 INFO L225 Difference]: With dead ends: 43179 [2020-12-22 07:08:59,703 INFO L226 Difference]: Without dead ends: 17409 [2020-12-22 07:08:59,719 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:59,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17409 states. [2020-12-22 07:09:00,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17409 to 17377. [2020-12-22 07:09:00,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17377 states. [2020-12-22 07:09:00,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17377 states to 17377 states and 18817 transitions. [2020-12-22 07:09:00,861 INFO L78 Accepts]: Start accepts. Automaton has 17377 states and 18817 transitions. Word has length 220 [2020-12-22 07:09:00,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:09:00,861 INFO L481 AbstractCegarLoop]: Abstraction has 17377 states and 18817 transitions. [2020-12-22 07:09:00,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:09:00,861 INFO L276 IsEmpty]: Start isEmpty. Operand 17377 states and 18817 transitions. [2020-12-22 07:09:00,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2020-12-22 07:09:00,870 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:09:00,870 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:00,870 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-22 07:09:00,871 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:09:00,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:09:00,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1613896568, now seen corresponding path program 1 times [2020-12-22 07:09:00,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:09:00,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246703598] [2020-12-22 07:09:00,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:09:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:09:01,141 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-22 07:09:01,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246703598] [2020-12-22 07:09:01,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:09:01,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 07:09:01,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885489853] [2020-12-22 07:09:01,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 07:09:01,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:09:01,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 07:09:01,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-22 07:09:01,144 INFO L87 Difference]: Start difference. First operand 17377 states and 18817 transitions. Second operand 6 states. [2020-12-22 07:09:05,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:09:05,653 INFO L93 Difference]: Finished difference Result 66251 states and 71727 transitions. [2020-12-22 07:09:05,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 07:09:05,654 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 223 [2020-12-22 07:09:05,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:09:05,712 INFO L225 Difference]: With dead ends: 66251 [2020-12-22 07:09:05,713 INFO L226 Difference]: Without dead ends: 59635 [2020-12-22 07:09:05,724 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-22 07:09:05,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59635 states. [2020-12-22 07:09:08,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59635 to 32304. [2020-12-22 07:09:08,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32304 states. [2020-12-22 07:09:08,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32304 states to 32304 states and 35058 transitions. [2020-12-22 07:09:08,327 INFO L78 Accepts]: Start accepts. Automaton has 32304 states and 35058 transitions. Word has length 223 [2020-12-22 07:09:08,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:09:08,328 INFO L481 AbstractCegarLoop]: Abstraction has 32304 states and 35058 transitions. [2020-12-22 07:09:08,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 07:09:08,328 INFO L276 IsEmpty]: Start isEmpty. Operand 32304 states and 35058 transitions. [2020-12-22 07:09:08,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2020-12-22 07:09:08,342 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:09:08,342 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:08,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-22 07:09:08,343 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:09:08,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:09:08,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1852984938, now seen corresponding path program 1 times [2020-12-22 07:09:08,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:09:08,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599634446] [2020-12-22 07:09:08,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:09:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:09:08,458 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-12-22 07:09:08,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599634446] [2020-12-22 07:09:08,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:09:08,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:09:08,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339946979] [2020-12-22 07:09:08,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:09:08,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:09:08,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:09:08,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:09:08,460 INFO L87 Difference]: Start difference. First operand 32304 states and 35058 transitions. Second operand 3 states. [2020-12-22 07:09:12,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:09:12,169 INFO L93 Difference]: Finished difference Result 69579 states and 75699 transitions. [2020-12-22 07:09:12,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:09:12,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2020-12-22 07:09:12,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:09:12,231 INFO L225 Difference]: With dead ends: 69579 [2020-12-22 07:09:12,232 INFO L226 Difference]: Without dead ends: 50858 [2020-12-22 07:09:12,253 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:09:12,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50858 states. [2020-12-22 07:09:15,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50858 to 32320. [2020-12-22 07:09:15,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32320 states. [2020-12-22 07:09:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32320 states to 32320 states and 35074 transitions. [2020-12-22 07:09:15,215 INFO L78 Accepts]: Start accepts. Automaton has 32320 states and 35074 transitions. Word has length 227 [2020-12-22 07:09:15,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:09:15,216 INFO L481 AbstractCegarLoop]: Abstraction has 32320 states and 35074 transitions. [2020-12-22 07:09:15,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:09:15,216 INFO L276 IsEmpty]: Start isEmpty. Operand 32320 states and 35074 transitions. [2020-12-22 07:09:15,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2020-12-22 07:09:15,225 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:09:15,226 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:15,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-22 07:09:15,226 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:09:15,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:09:15,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1845395018, now seen corresponding path program 1 times [2020-12-22 07:09:15,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:09:15,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664656788] [2020-12-22 07:09:15,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:09:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 07:09:15,253 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 07:09:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 07:09:15,282 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 07:09:15,398 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-22 07:09:15,398 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-22 07:09:15,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-22 07:09:15,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 07:09:15 BoogieIcfgContainer [2020-12-22 07:09:15,664 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-22 07:09:15,665 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-22 07:09:15,665 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-22 07:09:15,665 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-22 07:09:15,666 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:06" (3/4) ... [2020-12-22 07:09:15,668 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-22 07:09:15,862 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/systemc/token_ring.03.cil-1.c-witness.graphml [2020-12-22 07:09:15,862 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-22 07:09:15,864 INFO L168 Benchmark]: Toolchain (without parser) took 71676.66 ms. Allocated memory was 159.4 MB in the beginning and 6.6 GB in the end (delta: 6.4 GB). Free memory was 134.7 MB in the beginning and 5.4 GB in the end (delta: -5.3 GB). Peak memory consumption was 1.1 GB. Max. memory is 8.0 GB. [2020-12-22 07:09:15,864 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 159.4 MB. Free memory is still 131.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 07:09:15,865 INFO L168 Benchmark]: CACSL2BoogieTranslator took 437.61 ms. Allocated memory is still 159.4 MB. Free memory was 134.5 MB in the beginning and 119.8 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2020-12-22 07:09:15,865 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.34 ms. Allocated memory is still 159.4 MB. Free memory was 119.6 MB in the beginning and 115.8 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2020-12-22 07:09:15,866 INFO L168 Benchmark]: Boogie Preprocessor took 109.72 ms. Allocated memory is still 159.4 MB. Free memory was 115.8 MB in the beginning and 112.7 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:09:15,866 INFO L168 Benchmark]: RCFGBuilder took 1324.87 ms. Allocated memory is still 159.4 MB. Free memory was 112.7 MB in the beginning and 75.9 MB in the end (delta: 36.7 MB). Peak memory consumption was 36.3 MB. Max. memory is 8.0 GB. [2020-12-22 07:09:15,867 INFO L168 Benchmark]: TraceAbstraction took 69504.84 ms. Allocated memory was 159.4 MB in the beginning and 6.6 GB in the end (delta: 6.4 GB). Free memory was 75.4 MB in the beginning and 5.5 GB in the end (delta: -5.4 GB). Peak memory consumption was 1.0 GB. Max. memory is 8.0 GB. [2020-12-22 07:09:15,867 INFO L168 Benchmark]: Witness Printer took 197.16 ms. Allocated memory is still 6.6 GB. Free memory was 5.5 GB in the beginning and 5.4 GB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 8.0 GB. [2020-12-22 07:09:15,869 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.28 ms. Allocated memory is still 159.4 MB. Free memory is still 131.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 437.61 ms. Allocated memory is still 159.4 MB. Free memory was 134.5 MB in the beginning and 119.8 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 90.34 ms. Allocated memory is still 159.4 MB. Free memory was 119.6 MB in the beginning and 115.8 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 109.72 ms. Allocated memory is still 159.4 MB. Free memory was 115.8 MB in the beginning and 112.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1324.87 ms. Allocated memory is still 159.4 MB. Free memory was 112.7 MB in the beginning and 75.9 MB in the end (delta: 36.7 MB). Peak memory consumption was 36.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 69504.84 ms. Allocated memory was 159.4 MB in the beginning and 6.6 GB in the end (delta: 6.4 GB). Free memory was 75.4 MB in the beginning and 5.5 GB in the end (delta: -5.4 GB). Peak memory consumption was 1.0 GB. Max. memory is 8.0 GB. * Witness Printer took 197.16 ms. Allocated memory is still 6.6 GB. Free memory was 5.5 GB in the beginning and 5.4 GB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 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 t3_pc = 0; [L20] int m_st ; [L21] int t1_st ; [L22] int t2_st ; [L23] int t3_st ; [L24] int m_i ; [L25] int t1_i ; [L26] int t2_i ; [L27] int t3_i ; [L28] int M_E = 2; [L29] int T1_E = 2; [L30] int T2_E = 2; [L31] int T3_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L34] int E_2 = 2; [L35] int E_3 = 2; [L41] int token ; [L43] int local ; VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L727] int __retres1 ; [L640] m_i = 1 [L641] t1_i = 1 [L642] t2_i = 1 [L643] t3_i = 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L668] int kernel_st ; [L669] int tmp ; [L670] int tmp___0 ; [L674] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L296] COND TRUE m_i == 1 [L297] m_st = 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L301] COND TRUE t1_i == 1 [L302] t1_st = 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L306] COND TRUE t2_i == 1 [L307] t2_st = 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L311] COND TRUE t3_i == 1 [L312] t3_st = 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L433] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L438] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L443] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L448] COND FALSE !(T3_E == 0) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L453] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L458] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L463] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L468] COND FALSE !(E_3 == 0) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L212] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L222] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L224] return (__retres1); VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L533] tmp = is_master_triggered() [L535] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L228] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L231] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L241] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L243] return (__retres1); VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L541] tmp___0 = is_transmit1_triggered() [L543] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L247] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L250] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L260] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L262] return (__retres1); VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L549] tmp___1 = is_transmit2_triggered() [L551] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L266] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L269] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L279] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L281] return (__retres1); VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L557] tmp___2 = is_transmit3_triggered() [L559] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L481] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L486] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L491] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L496] COND FALSE !(T3_E == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L501] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L506] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L511] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L516] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L682] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L685] kernel_st = 1 [L352] int tmp ; VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L356] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L321] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L324] COND TRUE m_st == 0 [L325] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L347] return (__retres1); VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L359] tmp = exists_runnable_thread() [L361] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L366] COND TRUE m_st == 0 [L367] int tmp_ndt_1; [L368] tmp_ndt_1 = __VERIFIER_nondet_int() [L369] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L380] COND TRUE t1_st == 0 [L381] int tmp_ndt_2; [L382] tmp_ndt_2 = __VERIFIER_nondet_int() [L383] COND TRUE \read(tmp_ndt_2) [L385] t1_st = 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L104] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L115] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L117] t1_pc = 1 [L118] t1_st = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L394] COND TRUE t2_st == 0 [L395] int tmp_ndt_3; [L396] tmp_ndt_3 = __VERIFIER_nondet_int() [L397] COND TRUE \read(tmp_ndt_3) [L399] t2_st = 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L140] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L151] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L153] t2_pc = 1 [L154] t2_st = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L408] COND TRUE t3_st == 0 [L409] int tmp_ndt_4; [L410] tmp_ndt_4 = __VERIFIER_nondet_int() [L411] COND TRUE \read(tmp_ndt_4) [L413] t3_st = 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L176] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L187] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L189] t3_pc = 1 [L190] t3_st = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L356] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L321] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L324] COND TRUE m_st == 0 [L325] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L347] return (__retres1); VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L359] tmp = exists_runnable_thread() [L361] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L366] COND TRUE m_st == 0 [L367] int tmp_ndt_1; [L368] tmp_ndt_1 = __VERIFIER_nondet_int() [L369] COND TRUE \read(tmp_ndt_1) [L371] m_st = 1 [L46] int tmp_var = __VERIFIER_nondet_int(); [L48] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L59] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L62] token = __VERIFIER_nondet_int() [L63] local = token [L64] E_1 = 1 [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L212] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L222] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L224] return (__retres1); VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L533] tmp = is_master_triggered() [L535] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L228] int __retres1 ; VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L231] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L232] COND TRUE E_1 == 1 [L233] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L243] return (__retres1); VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L541] tmp___0 = is_transmit1_triggered() [L543] COND TRUE \read(tmp___0) [L544] t1_st = 0 VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L247] int __retres1 ; VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L250] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L251] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L260] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L262] return (__retres1); VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L549] tmp___1 = is_transmit2_triggered() [L551] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L266] int __retres1 ; VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L269] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L270] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L279] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L281] return (__retres1); VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L557] tmp___2 = is_transmit3_triggered() [L559] COND FALSE !(\read(tmp___2)) VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L66] E_1 = 2 [L67] m_pc = 1 [L68] m_st = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L380] COND TRUE t1_st == 0 [L381] int tmp_ndt_2; [L382] tmp_ndt_2 = __VERIFIER_nondet_int() [L383] COND TRUE \read(tmp_ndt_2) [L385] t1_st = 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L104] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L107] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L123] token += 1 [L124] E_2 = 1 [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L212] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L213] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L222] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L224] return (__retres1); VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L533] tmp = is_master_triggered() [L535] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L228] int __retres1 ; VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L231] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L232] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L241] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L243] return (__retres1); VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L541] tmp___0 = is_transmit1_triggered() [L543] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L247] int __retres1 ; VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L250] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L251] COND TRUE E_2 == 1 [L252] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L262] return (__retres1); VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L549] tmp___1 = is_transmit2_triggered() [L551] COND TRUE \read(tmp___1) [L552] t2_st = 0 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L266] int __retres1 ; VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L269] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L270] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L279] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L281] return (__retres1); VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L557] tmp___2 = is_transmit3_triggered() [L559] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L126] E_2 = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L115] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L117] t1_pc = 1 [L118] t1_st = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L394] COND TRUE t2_st == 0 [L395] int tmp_ndt_3; [L396] tmp_ndt_3 = __VERIFIER_nondet_int() [L397] COND TRUE \read(tmp_ndt_3) [L399] t2_st = 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L140] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L143] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L159] token += 1 [L160] E_3 = 1 [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L212] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L213] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L222] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L224] return (__retres1); VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L533] tmp = is_master_triggered() [L535] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L228] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L231] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L232] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L241] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L243] return (__retres1); VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L541] tmp___0 = is_transmit1_triggered() [L543] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L247] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L250] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L251] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L260] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L262] return (__retres1); VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L549] tmp___1 = is_transmit2_triggered() [L551] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L266] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L269] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L270] COND TRUE E_3 == 1 [L271] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L281] return (__retres1); VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L557] tmp___2 = is_transmit3_triggered() [L559] COND TRUE \read(tmp___2) [L560] t3_st = 0 VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L162] E_3 = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L151] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L153] t2_pc = 1 [L154] t2_st = 2 VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L408] COND TRUE t3_st == 0 [L409] int tmp_ndt_4; [L410] tmp_ndt_4 = __VERIFIER_nondet_int() [L411] COND TRUE \read(tmp_ndt_4) [L413] t3_st = 1 VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L176] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L179] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L195] token += 1 [L196] E_M = 1 [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L212] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L213] COND TRUE E_M == 1 [L214] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L224] return (__retres1); VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L533] tmp = is_master_triggered() [L535] COND TRUE \read(tmp) [L536] m_st = 0 VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L228] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L231] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L232] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L241] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L243] return (__retres1); VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L541] tmp___0 = is_transmit1_triggered() [L543] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L247] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L250] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L251] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L260] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L262] return (__retres1); VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L549] tmp___1 = is_transmit2_triggered() [L551] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L266] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L269] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L270] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L279] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L281] return (__retres1); VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L557] tmp___2 = is_transmit3_triggered() [L559] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L198] E_M = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L187] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L189] t3_pc = 1 [L190] t3_st = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L356] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L321] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L324] COND TRUE m_st == 0 [L325] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L347] return (__retres1); VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L359] tmp = exists_runnable_thread() [L361] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L366] COND TRUE m_st == 0 [L367] int tmp_ndt_1; [L368] tmp_ndt_1 = __VERIFIER_nondet_int() [L369] COND TRUE \read(tmp_ndt_1) [L371] m_st = 1 [L46] int tmp_var = __VERIFIER_nondet_int(); [L48] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L51] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L73] COND FALSE !(token != local + 3) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L78] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L79] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L84] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L85] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L86] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L12] reach_error() VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 316 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 69.1s, OverallIterations: 35, TraceHistogramMax: 3, AutomataDifference: 35.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 17417 SDtfs, 20944 SDslu, 17522 SDs, 0 SdLazy, 949 SolverSat, 346 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32320occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 29.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 50994 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 4069 NumberOfCodeBlocks, 4069 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3807 ConstructedInterpolants, 0 QuantifiedInterpolants, 1090171 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 449/449 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...