/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.04.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 06:05:26,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 06:05:26,426 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 06:05:26,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 06:05:26,441 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 06:05:26,442 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 06:05:26,443 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 06:05:26,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 06:05:26,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 06:05:26,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 06:05:26,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 06:05:26,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 06:05:26,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 06:05:26,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 06:05:26,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 06:05:26,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 06:05:26,455 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 06:05:26,456 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 06:05:26,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 06:05:26,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 06:05:26,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 06:05:26,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 06:05:26,463 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 06:05:26,464 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 06:05:26,466 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 06:05:26,467 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 06:05:26,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 06:05:26,468 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 06:05:26,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 06:05:26,469 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 06:05:26,470 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 06:05:26,470 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 06:05:26,474 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 06:05:26,475 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 06:05:26,479 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 06:05:26,479 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 06:05:26,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 06:05:26,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 06:05:26,480 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 06:05:26,484 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 06:05:26,485 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 06:05:26,488 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 06:05:26,508 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 06:05:26,509 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 06:05:26,509 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 06:05:26,510 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 06:05:26,510 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 06:05:26,510 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 06:05:26,510 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 06:05:26,510 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 06:05:26,511 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 06:05:26,511 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 06:05:26,511 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 06:05:26,511 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 06:05:26,511 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 06:05:26,512 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 06:05:26,512 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 06:05:26,513 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 06:05:26,513 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 06:05:26,513 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 06:05:26,513 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 06:05:26,514 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 06:05:26,514 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 06:05:26,514 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 06:05:26,514 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 06:05:26,514 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 06:05:26,515 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 06:05:26,515 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 06:05:26,515 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 06:05:26,515 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 06:05:26,515 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 06:05:26,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 06:05:26,516 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 06:05:26,516 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 06:05:26,516 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 06:05:26,516 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 06:05:26,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 06:05:26,517 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 06:05:26,517 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 06:05:26,517 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 06:05:26,784 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 06:05:26,800 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 06:05:26,804 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 06:05:26,805 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 06:05:26,805 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 06:05:26,806 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.04.cil-2.c [2019-11-24 06:05:26,873 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abf3bafba/a34efe5e48c84b27bc17e92e38101daa/FLAG118eaa43e [2019-11-24 06:05:27,409 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 06:05:27,410 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.04.cil-2.c [2019-11-24 06:05:27,425 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abf3bafba/a34efe5e48c84b27bc17e92e38101daa/FLAG118eaa43e [2019-11-24 06:05:27,736 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abf3bafba/a34efe5e48c84b27bc17e92e38101daa [2019-11-24 06:05:27,746 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 06:05:27,748 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 06:05:27,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 06:05:27,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 06:05:27,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 06:05:27,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:05:27" (1/1) ... [2019-11-24 06:05:27,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1260a1f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:27, skipping insertion in model container [2019-11-24 06:05:27,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:05:27" (1/1) ... [2019-11-24 06:05:27,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 06:05:27,817 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 06:05:28,075 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:05:28,081 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 06:05:28,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:05:28,260 INFO L208 MainTranslator]: Completed translation [2019-11-24 06:05:28,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:28 WrapperNode [2019-11-24 06:05:28,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 06:05:28,261 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 06:05:28,261 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 06:05:28,261 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 06:05:28,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:28" (1/1) ... [2019-11-24 06:05:28,285 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:28" (1/1) ... [2019-11-24 06:05:28,366 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 06:05:28,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 06:05:28,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 06:05:28,367 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 06:05:28,375 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:28" (1/1) ... [2019-11-24 06:05:28,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:28" (1/1) ... [2019-11-24 06:05:28,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:28" (1/1) ... [2019-11-24 06:05:28,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:28" (1/1) ... [2019-11-24 06:05:28,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:28" (1/1) ... [2019-11-24 06:05:28,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:28" (1/1) ... [2019-11-24 06:05:28,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:28" (1/1) ... [2019-11-24 06:05:28,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 06:05:28,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 06:05:28,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 06:05:28,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 06:05:28,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 06:05:28,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 06:05:28,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 06:05:31,255 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 06:05:31,256 INFO L284 CfgBuilder]: Removed 163 assume(true) statements. [2019-11-24 06:05:31,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:05:31 BoogieIcfgContainer [2019-11-24 06:05:31,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 06:05:31,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 06:05:31,258 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 06:05:31,261 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 06:05:31,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 06:05:27" (1/3) ... [2019-11-24 06:05:31,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f45e296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:05:31, skipping insertion in model container [2019-11-24 06:05:31,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:28" (2/3) ... [2019-11-24 06:05:31,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f45e296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:05:31, skipping insertion in model container [2019-11-24 06:05:31,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:05:31" (3/3) ... [2019-11-24 06:05:31,265 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.04.cil-2.c [2019-11-24 06:05:31,272 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 06:05:31,279 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-24 06:05:31,289 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-24 06:05:31,313 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 06:05:31,313 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 06:05:31,313 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 06:05:31,313 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 06:05:31,313 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 06:05:31,314 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 06:05:31,314 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 06:05:31,314 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 06:05:31,338 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states. [2019-11-24 06:05:31,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 06:05:31,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:31,348 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:31,348 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:31,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:31,353 INFO L82 PathProgramCache]: Analyzing trace with hash -592549844, now seen corresponding path program 1 times [2019-11-24 06:05:31,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:31,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294502708] [2019-11-24 06:05:31,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:31,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:31,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294502708] [2019-11-24 06:05:31,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:31,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:05:31,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061945261] [2019-11-24 06:05:31,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:31,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:31,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:31,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:31,561 INFO L87 Difference]: Start difference. First operand 203 states. Second operand 3 states. [2019-11-24 06:05:31,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:31,755 INFO L93 Difference]: Finished difference Result 570 states and 874 transitions. [2019-11-24 06:05:31,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:31,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-24 06:05:31,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:31,783 INFO L225 Difference]: With dead ends: 570 [2019-11-24 06:05:31,783 INFO L226 Difference]: Without dead ends: 365 [2019-11-24 06:05:31,790 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:31,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-11-24 06:05:31,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 347. [2019-11-24 06:05:31,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-11-24 06:05:31,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 518 transitions. [2019-11-24 06:05:31,858 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 518 transitions. Word has length 25 [2019-11-24 06:05:31,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:31,859 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 518 transitions. [2019-11-24 06:05:31,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:31,859 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 518 transitions. [2019-11-24 06:05:31,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 06:05:31,862 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:31,863 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:05:31,863 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:31,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:31,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1950082948, now seen corresponding path program 1 times [2019-11-24 06:05:31,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:31,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95360636] [2019-11-24 06:05:31,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:31,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 06:05:31,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95360636] [2019-11-24 06:05:31,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:31,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:05:31,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882000148] [2019-11-24 06:05:31,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:31,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:31,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:31,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:31,980 INFO L87 Difference]: Start difference. First operand 347 states and 518 transitions. Second operand 3 states. [2019-11-24 06:05:32,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:32,062 INFO L93 Difference]: Finished difference Result 961 states and 1433 transitions. [2019-11-24 06:05:32,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:32,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-24 06:05:32,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:32,066 INFO L225 Difference]: With dead ends: 961 [2019-11-24 06:05:32,066 INFO L226 Difference]: Without dead ends: 623 [2019-11-24 06:05:32,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:32,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-11-24 06:05:32,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 617. [2019-11-24 06:05:32,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-11-24 06:05:32,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 909 transitions. [2019-11-24 06:05:32,103 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 909 transitions. Word has length 50 [2019-11-24 06:05:32,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:32,104 INFO L462 AbstractCegarLoop]: Abstraction has 617 states and 909 transitions. [2019-11-24 06:05:32,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:32,104 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 909 transitions. [2019-11-24 06:05:32,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 06:05:32,139 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:32,139 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:05:32,140 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:32,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:32,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1025041602, now seen corresponding path program 1 times [2019-11-24 06:05:32,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:32,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470011044] [2019-11-24 06:05:32,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:32,196 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 06:05:32,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470011044] [2019-11-24 06:05:32,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:32,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:05:32,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128993251] [2019-11-24 06:05:32,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:32,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:32,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:32,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:32,199 INFO L87 Difference]: Start difference. First operand 617 states and 909 transitions. Second operand 3 states. [2019-11-24 06:05:32,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:32,305 INFO L93 Difference]: Finished difference Result 1719 states and 2531 transitions. [2019-11-24 06:05:32,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:32,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-24 06:05:32,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:32,317 INFO L225 Difference]: With dead ends: 1719 [2019-11-24 06:05:32,318 INFO L226 Difference]: Without dead ends: 1118 [2019-11-24 06:05:32,320 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:32,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2019-11-24 06:05:32,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1110. [2019-11-24 06:05:32,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110 states. [2019-11-24 06:05:32,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1612 transitions. [2019-11-24 06:05:32,372 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1612 transitions. Word has length 50 [2019-11-24 06:05:32,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:32,372 INFO L462 AbstractCegarLoop]: Abstraction has 1110 states and 1612 transitions. [2019-11-24 06:05:32,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:32,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1612 transitions. [2019-11-24 06:05:32,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 06:05:32,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:32,379 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:05:32,379 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:32,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:32,379 INFO L82 PathProgramCache]: Analyzing trace with hash -970205312, now seen corresponding path program 1 times [2019-11-24 06:05:32,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:32,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576269817] [2019-11-24 06:05:32,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:32,510 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:32,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576269817] [2019-11-24 06:05:32,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:32,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:32,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519406411] [2019-11-24 06:05:32,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:32,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:32,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:32,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:32,513 INFO L87 Difference]: Start difference. First operand 1110 states and 1612 transitions. Second operand 3 states. [2019-11-24 06:05:32,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:32,615 INFO L93 Difference]: Finished difference Result 3226 states and 4666 transitions. [2019-11-24 06:05:32,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:32,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-24 06:05:32,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:32,626 INFO L225 Difference]: With dead ends: 3226 [2019-11-24 06:05:32,626 INFO L226 Difference]: Without dead ends: 2121 [2019-11-24 06:05:32,628 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:32,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2019-11-24 06:05:32,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 2005. [2019-11-24 06:05:32,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2005 states. [2019-11-24 06:05:32,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 2869 transitions. [2019-11-24 06:05:32,693 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 2869 transitions. Word has length 50 [2019-11-24 06:05:32,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:32,693 INFO L462 AbstractCegarLoop]: Abstraction has 2005 states and 2869 transitions. [2019-11-24 06:05:32,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:32,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 2869 transitions. [2019-11-24 06:05:32,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 06:05:32,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:32,696 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:05:32,697 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:32,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:32,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1734367007, now seen corresponding path program 1 times [2019-11-24 06:05:32,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:32,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850758244] [2019-11-24 06:05:32,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:32,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:32,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850758244] [2019-11-24 06:05:32,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:32,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:32,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757328981] [2019-11-24 06:05:32,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:32,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:32,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:32,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:32,771 INFO L87 Difference]: Start difference. First operand 2005 states and 2869 transitions. Second operand 4 states. [2019-11-24 06:05:32,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:32,984 INFO L93 Difference]: Finished difference Result 4841 states and 7075 transitions. [2019-11-24 06:05:32,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:32,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-24 06:05:32,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:33,000 INFO L225 Difference]: With dead ends: 4841 [2019-11-24 06:05:33,001 INFO L226 Difference]: Without dead ends: 2853 [2019-11-24 06:05:33,004 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:33,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2019-11-24 06:05:33,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 2349. [2019-11-24 06:05:33,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2349 states. [2019-11-24 06:05:33,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2349 states to 2349 states and 3461 transitions. [2019-11-24 06:05:33,102 INFO L78 Accepts]: Start accepts. Automaton has 2349 states and 3461 transitions. Word has length 50 [2019-11-24 06:05:33,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:33,102 INFO L462 AbstractCegarLoop]: Abstraction has 2349 states and 3461 transitions. [2019-11-24 06:05:33,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:33,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 3461 transitions. [2019-11-24 06:05:33,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-24 06:05:33,108 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:33,108 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:05:33,109 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:33,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:33,109 INFO L82 PathProgramCache]: Analyzing trace with hash -735951900, now seen corresponding path program 1 times [2019-11-24 06:05:33,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:33,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852219531] [2019-11-24 06:05:33,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:33,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:33,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852219531] [2019-11-24 06:05:33,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:33,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:05:33,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248612489] [2019-11-24 06:05:33,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:33,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:33,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:33,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:33,231 INFO L87 Difference]: Start difference. First operand 2349 states and 3461 transitions. Second operand 3 states. [2019-11-24 06:05:33,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:33,397 INFO L93 Difference]: Finished difference Result 6634 states and 9774 transitions. [2019-11-24 06:05:33,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:33,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-24 06:05:33,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:33,416 INFO L225 Difference]: With dead ends: 6634 [2019-11-24 06:05:33,417 INFO L226 Difference]: Without dead ends: 4296 [2019-11-24 06:05:33,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:33,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2019-11-24 06:05:33,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 4260. [2019-11-24 06:05:33,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4260 states. [2019-11-24 06:05:33,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4260 states to 4260 states and 6194 transitions. [2019-11-24 06:05:33,584 INFO L78 Accepts]: Start accepts. Automaton has 4260 states and 6194 transitions. Word has length 69 [2019-11-24 06:05:33,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:33,586 INFO L462 AbstractCegarLoop]: Abstraction has 4260 states and 6194 transitions. [2019-11-24 06:05:33,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:33,587 INFO L276 IsEmpty]: Start isEmpty. Operand 4260 states and 6194 transitions. [2019-11-24 06:05:33,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-24 06:05:33,598 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:33,599 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:33,601 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:33,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:33,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1520147461, now seen corresponding path program 1 times [2019-11-24 06:05:33,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:33,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146585664] [2019-11-24 06:05:33,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:33,736 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:33,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146585664] [2019-11-24 06:05:33,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:33,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:33,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194913500] [2019-11-24 06:05:33,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:33,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:33,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:33,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:33,739 INFO L87 Difference]: Start difference. First operand 4260 states and 6194 transitions. Second operand 3 states. [2019-11-24 06:05:33,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:33,891 INFO L93 Difference]: Finished difference Result 6872 states and 9988 transitions. [2019-11-24 06:05:33,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:33,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-24 06:05:33,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:33,911 INFO L225 Difference]: With dead ends: 6872 [2019-11-24 06:05:33,912 INFO L226 Difference]: Without dead ends: 4516 [2019-11-24 06:05:33,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:33,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4516 states. [2019-11-24 06:05:34,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4516 to 4260. [2019-11-24 06:05:34,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4260 states. [2019-11-24 06:05:34,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4260 states to 4260 states and 6082 transitions. [2019-11-24 06:05:34,064 INFO L78 Accepts]: Start accepts. Automaton has 4260 states and 6082 transitions. Word has length 72 [2019-11-24 06:05:34,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:34,065 INFO L462 AbstractCegarLoop]: Abstraction has 4260 states and 6082 transitions. [2019-11-24 06:05:34,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:34,065 INFO L276 IsEmpty]: Start isEmpty. Operand 4260 states and 6082 transitions. [2019-11-24 06:05:34,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-24 06:05:34,073 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:34,074 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:34,074 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:34,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:34,075 INFO L82 PathProgramCache]: Analyzing trace with hash 152370170, now seen corresponding path program 1 times [2019-11-24 06:05:34,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:34,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731663743] [2019-11-24 06:05:34,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:34,238 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:34,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731663743] [2019-11-24 06:05:34,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:34,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:34,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527068522] [2019-11-24 06:05:34,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:34,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:34,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:34,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:34,240 INFO L87 Difference]: Start difference. First operand 4260 states and 6082 transitions. Second operand 4 states. [2019-11-24 06:05:34,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:34,486 INFO L93 Difference]: Finished difference Result 6708 states and 9576 transitions. [2019-11-24 06:05:34,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:34,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-24 06:05:34,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:34,506 INFO L225 Difference]: With dead ends: 6708 [2019-11-24 06:05:34,506 INFO L226 Difference]: Without dead ends: 4384 [2019-11-24 06:05:34,510 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:34,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4384 states. [2019-11-24 06:05:34,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4384 to 4260. [2019-11-24 06:05:34,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4260 states. [2019-11-24 06:05:34,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4260 states to 4260 states and 6010 transitions. [2019-11-24 06:05:34,658 INFO L78 Accepts]: Start accepts. Automaton has 4260 states and 6010 transitions. Word has length 72 [2019-11-24 06:05:34,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:34,658 INFO L462 AbstractCegarLoop]: Abstraction has 4260 states and 6010 transitions. [2019-11-24 06:05:34,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:34,659 INFO L276 IsEmpty]: Start isEmpty. Operand 4260 states and 6010 transitions. [2019-11-24 06:05:34,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-24 06:05:34,666 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:34,666 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:34,667 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:34,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:34,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1495302134, now seen corresponding path program 1 times [2019-11-24 06:05:34,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:34,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43396686] [2019-11-24 06:05:34,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:34,781 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 06:05:34,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43396686] [2019-11-24 06:05:34,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061246495] [2019-11-24 06:05:34,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:34,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-24 06:05:34,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:34,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:34,928 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:34,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:34,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:34,959 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:34,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:05:34,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [5] total 6 [2019-11-24 06:05:34,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804146018] [2019-11-24 06:05:34,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:34,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:34,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:34,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:34,961 INFO L87 Difference]: Start difference. First operand 4260 states and 6010 transitions. Second operand 3 states. [2019-11-24 06:05:35,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:35,359 INFO L93 Difference]: Finished difference Result 10420 states and 14754 transitions. [2019-11-24 06:05:35,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:35,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-24 06:05:35,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:35,407 INFO L225 Difference]: With dead ends: 10420 [2019-11-24 06:05:35,408 INFO L226 Difference]: Without dead ends: 6176 [2019-11-24 06:05:35,413 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:35,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6176 states. [2019-11-24 06:05:35,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6176 to 6172. [2019-11-24 06:05:35,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6172 states. [2019-11-24 06:05:35,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6172 states to 6172 states and 8694 transitions. [2019-11-24 06:05:35,677 INFO L78 Accepts]: Start accepts. Automaton has 6172 states and 8694 transitions. Word has length 73 [2019-11-24 06:05:35,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:35,679 INFO L462 AbstractCegarLoop]: Abstraction has 6172 states and 8694 transitions. [2019-11-24 06:05:35,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:35,679 INFO L276 IsEmpty]: Start isEmpty. Operand 6172 states and 8694 transitions. [2019-11-24 06:05:35,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-24 06:05:35,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:35,697 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:35,904 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:35,904 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:35,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:35,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1801956901, now seen corresponding path program 1 times [2019-11-24 06:05:35,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:35,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373518021] [2019-11-24 06:05:35,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:36,020 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:36,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373518021] [2019-11-24 06:05:36,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:36,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 06:05:36,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650308919] [2019-11-24 06:05:36,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 06:05:36,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:36,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 06:05:36,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 06:05:36,023 INFO L87 Difference]: Start difference. First operand 6172 states and 8694 transitions. Second operand 7 states. [2019-11-24 06:05:36,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:36,525 INFO L93 Difference]: Finished difference Result 11432 states and 16112 transitions. [2019-11-24 06:05:36,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 06:05:36,526 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-11-24 06:05:36,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:36,542 INFO L225 Difference]: With dead ends: 11432 [2019-11-24 06:05:36,543 INFO L226 Difference]: Without dead ends: 8052 [2019-11-24 06:05:36,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-11-24 06:05:36,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8052 states. [2019-11-24 06:05:36,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8052 to 7324. [2019-11-24 06:05:36,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7324 states. [2019-11-24 06:05:36,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7324 states to 7324 states and 10526 transitions. [2019-11-24 06:05:36,816 INFO L78 Accepts]: Start accepts. Automaton has 7324 states and 10526 transitions. Word has length 74 [2019-11-24 06:05:36,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:36,816 INFO L462 AbstractCegarLoop]: Abstraction has 7324 states and 10526 transitions. [2019-11-24 06:05:36,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 06:05:36,817 INFO L276 IsEmpty]: Start isEmpty. Operand 7324 states and 10526 transitions. [2019-11-24 06:05:36,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-24 06:05:36,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:36,829 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:36,829 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:36,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:36,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1693683734, now seen corresponding path program 1 times [2019-11-24 06:05:36,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:36,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296314105] [2019-11-24 06:05:36,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:36,884 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:36,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296314105] [2019-11-24 06:05:36,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:36,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 06:05:36,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158949708] [2019-11-24 06:05:36,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 06:05:36,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:36,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 06:05:36,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:05:36,887 INFO L87 Difference]: Start difference. First operand 7324 states and 10526 transitions. Second operand 5 states. [2019-11-24 06:05:37,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:37,232 INFO L93 Difference]: Finished difference Result 12352 states and 17636 transitions. [2019-11-24 06:05:37,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 06:05:37,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-11-24 06:05:37,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:37,248 INFO L225 Difference]: With dead ends: 12352 [2019-11-24 06:05:37,248 INFO L226 Difference]: Without dead ends: 7820 [2019-11-24 06:05:37,255 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 06:05:37,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7820 states. [2019-11-24 06:05:37,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7820 to 7348. [2019-11-24 06:05:37,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7348 states. [2019-11-24 06:05:37,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7348 states to 7348 states and 10526 transitions. [2019-11-24 06:05:37,488 INFO L78 Accepts]: Start accepts. Automaton has 7348 states and 10526 transitions. Word has length 75 [2019-11-24 06:05:37,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:37,489 INFO L462 AbstractCegarLoop]: Abstraction has 7348 states and 10526 transitions. [2019-11-24 06:05:37,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 06:05:37,489 INFO L276 IsEmpty]: Start isEmpty. Operand 7348 states and 10526 transitions. [2019-11-24 06:05:37,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-24 06:05:37,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:37,502 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:37,503 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:37,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:37,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1071796184, now seen corresponding path program 1 times [2019-11-24 06:05:37,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:37,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488617143] [2019-11-24 06:05:37,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:37,574 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:37,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488617143] [2019-11-24 06:05:37,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:37,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 06:05:37,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63880750] [2019-11-24 06:05:37,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 06:05:37,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:37,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 06:05:37,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:37,576 INFO L87 Difference]: Start difference. First operand 7348 states and 10526 transitions. Second operand 6 states. [2019-11-24 06:05:38,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:38,001 INFO L93 Difference]: Finished difference Result 12400 states and 17648 transitions. [2019-11-24 06:05:38,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 06:05:38,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-11-24 06:05:38,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:38,019 INFO L225 Difference]: With dead ends: 12400 [2019-11-24 06:05:38,020 INFO L226 Difference]: Without dead ends: 7844 [2019-11-24 06:05:38,026 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-24 06:05:38,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7844 states. [2019-11-24 06:05:38,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7844 to 7372. [2019-11-24 06:05:38,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7372 states. [2019-11-24 06:05:38,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7372 states to 7372 states and 10526 transitions. [2019-11-24 06:05:38,274 INFO L78 Accepts]: Start accepts. Automaton has 7372 states and 10526 transitions. Word has length 75 [2019-11-24 06:05:38,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:38,274 INFO L462 AbstractCegarLoop]: Abstraction has 7372 states and 10526 transitions. [2019-11-24 06:05:38,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 06:05:38,275 INFO L276 IsEmpty]: Start isEmpty. Operand 7372 states and 10526 transitions. [2019-11-24 06:05:38,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-24 06:05:38,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:38,286 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:38,286 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:38,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:38,287 INFO L82 PathProgramCache]: Analyzing trace with hash 38867524, now seen corresponding path program 1 times [2019-11-24 06:05:38,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:38,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373038929] [2019-11-24 06:05:38,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:38,335 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:38,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373038929] [2019-11-24 06:05:38,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:38,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:38,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300470790] [2019-11-24 06:05:38,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:38,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:38,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:38,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:38,340 INFO L87 Difference]: Start difference. First operand 7372 states and 10526 transitions. Second operand 3 states. [2019-11-24 06:05:38,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:38,594 INFO L93 Difference]: Finished difference Result 12436 states and 17842 transitions. [2019-11-24 06:05:38,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:38,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-11-24 06:05:38,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:38,613 INFO L225 Difference]: With dead ends: 12436 [2019-11-24 06:05:38,614 INFO L226 Difference]: Without dead ends: 7392 [2019-11-24 06:05:38,622 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:38,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7392 states. [2019-11-24 06:05:38,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7392 to 7292. [2019-11-24 06:05:38,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7292 states. [2019-11-24 06:05:38,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7292 states to 7292 states and 10190 transitions. [2019-11-24 06:05:38,891 INFO L78 Accepts]: Start accepts. Automaton has 7292 states and 10190 transitions. Word has length 76 [2019-11-24 06:05:38,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:38,891 INFO L462 AbstractCegarLoop]: Abstraction has 7292 states and 10190 transitions. [2019-11-24 06:05:38,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:38,891 INFO L276 IsEmpty]: Start isEmpty. Operand 7292 states and 10190 transitions. [2019-11-24 06:05:38,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-24 06:05:38,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:38,902 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:38,903 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:38,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:38,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1101484187, now seen corresponding path program 1 times [2019-11-24 06:05:38,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:38,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040415787] [2019-11-24 06:05:38,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:38,967 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 06:05:38,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040415787] [2019-11-24 06:05:38,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623215] [2019-11-24 06:05:38,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:39,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-24 06:05:39,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:39,082 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:39,083 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:39,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:39,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:39,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:39,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:05:39,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [5] total 6 [2019-11-24 06:05:39,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720303709] [2019-11-24 06:05:39,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:39,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:39,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:39,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:39,105 INFO L87 Difference]: Start difference. First operand 7292 states and 10190 transitions. Second operand 3 states. [2019-11-24 06:05:39,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:39,366 INFO L93 Difference]: Finished difference Result 17358 states and 24288 transitions. [2019-11-24 06:05:39,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:39,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-11-24 06:05:39,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:39,381 INFO L225 Difference]: With dead ends: 17358 [2019-11-24 06:05:39,381 INFO L226 Difference]: Without dead ends: 10082 [2019-11-24 06:05:39,389 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:39,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10082 states. [2019-11-24 06:05:39,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10082 to 10054. [2019-11-24 06:05:39,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10054 states. [2019-11-24 06:05:39,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10054 states to 10054 states and 13944 transitions. [2019-11-24 06:05:39,850 INFO L78 Accepts]: Start accepts. Automaton has 10054 states and 13944 transitions. Word has length 76 [2019-11-24 06:05:39,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:39,850 INFO L462 AbstractCegarLoop]: Abstraction has 10054 states and 13944 transitions. [2019-11-24 06:05:39,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:39,850 INFO L276 IsEmpty]: Start isEmpty. Operand 10054 states and 13944 transitions. [2019-11-24 06:05:39,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-24 06:05:39,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:39,878 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:40,083 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:40,083 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:40,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:40,084 INFO L82 PathProgramCache]: Analyzing trace with hash 968651120, now seen corresponding path program 1 times [2019-11-24 06:05:40,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:40,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247972226] [2019-11-24 06:05:40,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:40,152 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 06:05:40,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247972226] [2019-11-24 06:05:40,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305026998] [2019-11-24 06:05:40,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:40,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-24 06:05:40,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:40,263 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:40,263 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:40,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:40,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:40,276 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:40,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:05:40,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [5] total 6 [2019-11-24 06:05:40,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552877969] [2019-11-24 06:05:40,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:40,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:40,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:40,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:40,278 INFO L87 Difference]: Start difference. First operand 10054 states and 13944 transitions. Second operand 3 states. [2019-11-24 06:05:40,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:40,650 INFO L93 Difference]: Finished difference Result 24471 states and 33958 transitions. [2019-11-24 06:05:40,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:40,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-11-24 06:05:40,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:40,735 INFO L225 Difference]: With dead ends: 24471 [2019-11-24 06:05:40,736 INFO L226 Difference]: Without dead ends: 14433 [2019-11-24 06:05:40,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:40,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14433 states. [2019-11-24 06:05:41,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14433 to 14429. [2019-11-24 06:05:41,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14429 states. [2019-11-24 06:05:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14429 states to 14429 states and 19812 transitions. [2019-11-24 06:05:41,227 INFO L78 Accepts]: Start accepts. Automaton has 14429 states and 19812 transitions. Word has length 79 [2019-11-24 06:05:41,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:41,227 INFO L462 AbstractCegarLoop]: Abstraction has 14429 states and 19812 transitions. [2019-11-24 06:05:41,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:41,227 INFO L276 IsEmpty]: Start isEmpty. Operand 14429 states and 19812 transitions. [2019-11-24 06:05:41,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-24 06:05:41,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:41,244 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:41,450 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:41,452 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:41,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:41,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1427433273, now seen corresponding path program 1 times [2019-11-24 06:05:41,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:41,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049491442] [2019-11-24 06:05:41,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:41,544 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:41,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049491442] [2019-11-24 06:05:41,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:41,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-24 06:05:41,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983136473] [2019-11-24 06:05:41,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 06:05:41,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:41,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 06:05:41,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-24 06:05:41,546 INFO L87 Difference]: Start difference. First operand 14429 states and 19812 transitions. Second operand 8 states. [2019-11-24 06:05:42,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:42,128 INFO L93 Difference]: Finished difference Result 19547 states and 26654 transitions. [2019-11-24 06:05:42,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-24 06:05:42,129 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2019-11-24 06:05:42,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:42,145 INFO L225 Difference]: With dead ends: 19547 [2019-11-24 06:05:42,145 INFO L226 Difference]: Without dead ends: 15539 [2019-11-24 06:05:42,153 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-11-24 06:05:42,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15539 states. [2019-11-24 06:05:42,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15539 to 14559. [2019-11-24 06:05:42,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14559 states. [2019-11-24 06:05:42,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14559 states to 14559 states and 19974 transitions. [2019-11-24 06:05:42,495 INFO L78 Accepts]: Start accepts. Automaton has 14559 states and 19974 transitions. Word has length 80 [2019-11-24 06:05:42,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:42,496 INFO L462 AbstractCegarLoop]: Abstraction has 14559 states and 19974 transitions. [2019-11-24 06:05:42,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 06:05:42,496 INFO L276 IsEmpty]: Start isEmpty. Operand 14559 states and 19974 transitions. [2019-11-24 06:05:42,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-24 06:05:42,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:42,509 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:42,510 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:42,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:42,510 INFO L82 PathProgramCache]: Analyzing trace with hash 62558194, now seen corresponding path program 1 times [2019-11-24 06:05:42,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:42,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501770025] [2019-11-24 06:05:42,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:42,577 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 06:05:42,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501770025] [2019-11-24 06:05:42,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377486565] [2019-11-24 06:05:42,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:42,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-24 06:05:42,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:42,697 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:42,697 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:42,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:42,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:42,718 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:42,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:05:42,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [5] total 6 [2019-11-24 06:05:42,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942900082] [2019-11-24 06:05:42,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:42,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:42,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:42,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:42,722 INFO L87 Difference]: Start difference. First operand 14559 states and 19974 transitions. Second operand 3 states. [2019-11-24 06:05:43,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:43,342 INFO L93 Difference]: Finished difference Result 40149 states and 54853 transitions. [2019-11-24 06:05:43,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:43,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-24 06:05:43,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:43,365 INFO L225 Difference]: With dead ends: 40149 [2019-11-24 06:05:43,365 INFO L226 Difference]: Without dead ends: 25606 [2019-11-24 06:05:43,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:43,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25606 states. [2019-11-24 06:05:44,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25606 to 25548. [2019-11-24 06:05:44,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25548 states. [2019-11-24 06:05:44,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25548 states to 25548 states and 34569 transitions. [2019-11-24 06:05:44,700 INFO L78 Accepts]: Start accepts. Automaton has 25548 states and 34569 transitions. Word has length 82 [2019-11-24 06:05:44,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:44,701 INFO L462 AbstractCegarLoop]: Abstraction has 25548 states and 34569 transitions. [2019-11-24 06:05:44,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:44,701 INFO L276 IsEmpty]: Start isEmpty. Operand 25548 states and 34569 transitions. [2019-11-24 06:05:44,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-24 06:05:44,716 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:44,717 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:44,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:44,920 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:44,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:44,921 INFO L82 PathProgramCache]: Analyzing trace with hash -898112068, now seen corresponding path program 1 times [2019-11-24 06:05:44,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:44,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384661657] [2019-11-24 06:05:44,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:44,977 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:44,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384661657] [2019-11-24 06:05:44,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:44,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:44,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251103789] [2019-11-24 06:05:44,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:44,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:44,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:44,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:44,979 INFO L87 Difference]: Start difference. First operand 25548 states and 34569 transitions. Second operand 4 states. [2019-11-24 06:05:45,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:45,653 INFO L93 Difference]: Finished difference Result 51728 states and 69950 transitions. [2019-11-24 06:05:45,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:45,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-24 06:05:45,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:45,678 INFO L225 Difference]: With dead ends: 51728 [2019-11-24 06:05:45,678 INFO L226 Difference]: Without dead ends: 26196 [2019-11-24 06:05:45,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:45,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26196 states. [2019-11-24 06:05:46,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26196 to 25548. [2019-11-24 06:05:46,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25548 states. [2019-11-24 06:05:46,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25548 states to 25548 states and 34191 transitions. [2019-11-24 06:05:46,391 INFO L78 Accepts]: Start accepts. Automaton has 25548 states and 34191 transitions. Word has length 85 [2019-11-24 06:05:46,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:46,391 INFO L462 AbstractCegarLoop]: Abstraction has 25548 states and 34191 transitions. [2019-11-24 06:05:46,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:46,391 INFO L276 IsEmpty]: Start isEmpty. Operand 25548 states and 34191 transitions. [2019-11-24 06:05:46,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-24 06:05:46,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:46,408 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:46,409 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:46,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:46,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1806460251, now seen corresponding path program 1 times [2019-11-24 06:05:46,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:46,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074245487] [2019-11-24 06:05:46,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:46,456 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:46,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074245487] [2019-11-24 06:05:46,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:46,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:46,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442053265] [2019-11-24 06:05:46,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:46,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:46,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:46,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:46,460 INFO L87 Difference]: Start difference. First operand 25548 states and 34191 transitions. Second operand 3 states. [2019-11-24 06:05:47,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:47,074 INFO L93 Difference]: Finished difference Result 45200 states and 60558 transitions. [2019-11-24 06:05:47,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:47,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-24 06:05:47,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:47,092 INFO L225 Difference]: With dead ends: 45200 [2019-11-24 06:05:47,093 INFO L226 Difference]: Without dead ends: 19668 [2019-11-24 06:05:47,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:47,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19668 states. [2019-11-24 06:05:47,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19668 to 19449. [2019-11-24 06:05:47,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19449 states. [2019-11-24 06:05:47,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19449 states to 19449 states and 25464 transitions. [2019-11-24 06:05:47,494 INFO L78 Accepts]: Start accepts. Automaton has 19449 states and 25464 transitions. Word has length 85 [2019-11-24 06:05:47,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:47,494 INFO L462 AbstractCegarLoop]: Abstraction has 19449 states and 25464 transitions. [2019-11-24 06:05:47,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:47,494 INFO L276 IsEmpty]: Start isEmpty. Operand 19449 states and 25464 transitions. [2019-11-24 06:05:47,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-24 06:05:47,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:47,510 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:05:47,511 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:47,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:47,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1199176721, now seen corresponding path program 1 times [2019-11-24 06:05:47,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:47,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152928193] [2019-11-24 06:05:47,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:47,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152928193] [2019-11-24 06:05:47,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:47,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:47,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289910426] [2019-11-24 06:05:47,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:47,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:47,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:47,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:47,564 INFO L87 Difference]: Start difference. First operand 19449 states and 25464 transitions. Second operand 4 states. [2019-11-24 06:05:48,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:48,302 INFO L93 Difference]: Finished difference Result 42008 states and 55607 transitions. [2019-11-24 06:05:48,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:48,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-24 06:05:48,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:48,327 INFO L225 Difference]: With dead ends: 42008 [2019-11-24 06:05:48,327 INFO L226 Difference]: Without dead ends: 28627 [2019-11-24 06:05:48,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:48,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28627 states. [2019-11-24 06:05:48,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28627 to 20922. [2019-11-24 06:05:48,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20922 states. [2019-11-24 06:05:48,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20922 states to 20922 states and 27676 transitions. [2019-11-24 06:05:48,823 INFO L78 Accepts]: Start accepts. Automaton has 20922 states and 27676 transitions. Word has length 85 [2019-11-24 06:05:48,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:48,823 INFO L462 AbstractCegarLoop]: Abstraction has 20922 states and 27676 transitions. [2019-11-24 06:05:48,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:48,823 INFO L276 IsEmpty]: Start isEmpty. Operand 20922 states and 27676 transitions. [2019-11-24 06:05:48,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-24 06:05:48,835 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:48,835 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:48,835 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:48,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:48,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1456949349, now seen corresponding path program 1 times [2019-11-24 06:05:48,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:48,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010346435] [2019-11-24 06:05:48,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:48,895 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 06:05:48,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010346435] [2019-11-24 06:05:48,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883749940] [2019-11-24 06:05:48,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:48,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-24 06:05:49,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:49,050 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:49,050 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:49,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:49,090 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:49,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-24 06:05:49,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 5] total 11 [2019-11-24 06:05:49,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985545760] [2019-11-24 06:05:49,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 06:05:49,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:49,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 06:05:49,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-11-24 06:05:49,095 INFO L87 Difference]: Start difference. First operand 20922 states and 27676 transitions. Second operand 6 states. [2019-11-24 06:05:49,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:49,999 INFO L93 Difference]: Finished difference Result 54768 states and 71891 transitions. [2019-11-24 06:05:49,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 06:05:49,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-11-24 06:05:49,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:50,022 INFO L225 Difference]: With dead ends: 54768 [2019-11-24 06:05:50,022 INFO L226 Difference]: Without dead ends: 24700 [2019-11-24 06:05:50,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-11-24 06:05:50,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24700 states. [2019-11-24 06:05:50,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24700 to 22779. [2019-11-24 06:05:50,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22779 states. [2019-11-24 06:05:50,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22779 states to 22779 states and 29223 transitions. [2019-11-24 06:05:50,599 INFO L78 Accepts]: Start accepts. Automaton has 22779 states and 29223 transitions. Word has length 86 [2019-11-24 06:05:50,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:50,599 INFO L462 AbstractCegarLoop]: Abstraction has 22779 states and 29223 transitions. [2019-11-24 06:05:50,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 06:05:50,599 INFO L276 IsEmpty]: Start isEmpty. Operand 22779 states and 29223 transitions. [2019-11-24 06:05:50,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-24 06:05:50,614 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:50,615 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:05:50,815 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:50,816 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:50,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:50,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1624521191, now seen corresponding path program 1 times [2019-11-24 06:05:50,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:50,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329989648] [2019-11-24 06:05:50,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:50,868 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:05:50,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329989648] [2019-11-24 06:05:50,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:50,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:05:50,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400781756] [2019-11-24 06:05:50,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:50,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:50,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:50,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:50,870 INFO L87 Difference]: Start difference. First operand 22779 states and 29223 transitions. Second operand 3 states. [2019-11-24 06:05:51,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:51,775 INFO L93 Difference]: Finished difference Result 40558 states and 52360 transitions. [2019-11-24 06:05:51,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:51,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-24 06:05:51,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:51,798 INFO L225 Difference]: With dead ends: 40558 [2019-11-24 06:05:51,799 INFO L226 Difference]: Without dead ends: 22779 [2019-11-24 06:05:51,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:51,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22779 states. [2019-11-24 06:05:52,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22779 to 22779. [2019-11-24 06:05:52,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22779 states. [2019-11-24 06:05:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22779 states to 22779 states and 28656 transitions. [2019-11-24 06:05:52,359 INFO L78 Accepts]: Start accepts. Automaton has 22779 states and 28656 transitions. Word has length 86 [2019-11-24 06:05:52,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:52,360 INFO L462 AbstractCegarLoop]: Abstraction has 22779 states and 28656 transitions. [2019-11-24 06:05:52,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:52,360 INFO L276 IsEmpty]: Start isEmpty. Operand 22779 states and 28656 transitions. [2019-11-24 06:05:52,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-24 06:05:52,371 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:52,371 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:05:52,371 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:52,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:52,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1461586631, now seen corresponding path program 1 times [2019-11-24 06:05:52,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:52,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33778687] [2019-11-24 06:05:52,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:52,412 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:52,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33778687] [2019-11-24 06:05:52,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:52,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:52,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884412045] [2019-11-24 06:05:52,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:52,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:52,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:52,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:52,414 INFO L87 Difference]: Start difference. First operand 22779 states and 28656 transitions. Second operand 3 states. [2019-11-24 06:05:53,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:53,235 INFO L93 Difference]: Finished difference Result 40611 states and 51279 transitions. [2019-11-24 06:05:53,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:53,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-24 06:05:53,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:53,253 INFO L225 Difference]: With dead ends: 40611 [2019-11-24 06:05:53,254 INFO L226 Difference]: Without dead ends: 22832 [2019-11-24 06:05:53,265 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:53,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22832 states. [2019-11-24 06:05:53,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22832 to 22667. [2019-11-24 06:05:53,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22667 states. [2019-11-24 06:05:53,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22667 states to 22667 states and 27703 transitions. [2019-11-24 06:05:53,831 INFO L78 Accepts]: Start accepts. Automaton has 22667 states and 27703 transitions. Word has length 86 [2019-11-24 06:05:53,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:53,831 INFO L462 AbstractCegarLoop]: Abstraction has 22667 states and 27703 transitions. [2019-11-24 06:05:53,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:53,831 INFO L276 IsEmpty]: Start isEmpty. Operand 22667 states and 27703 transitions. [2019-11-24 06:05:53,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-24 06:05:53,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:53,843 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:05:53,843 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:53,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:53,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1042181405, now seen corresponding path program 1 times [2019-11-24 06:05:53,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:53,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346478780] [2019-11-24 06:05:53,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:53,931 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:53,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346478780] [2019-11-24 06:05:53,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:53,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:53,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768288167] [2019-11-24 06:05:53,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:53,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:53,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:53,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:53,933 INFO L87 Difference]: Start difference. First operand 22667 states and 27703 transitions. Second operand 4 states. [2019-11-24 06:05:54,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:54,944 INFO L93 Difference]: Finished difference Result 40967 states and 50308 transitions. [2019-11-24 06:05:54,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:54,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-24 06:05:54,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:54,964 INFO L225 Difference]: With dead ends: 40967 [2019-11-24 06:05:54,964 INFO L226 Difference]: Without dead ends: 23329 [2019-11-24 06:05:54,974 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:54,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23329 states. [2019-11-24 06:05:55,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23329 to 17914. [2019-11-24 06:05:55,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17914 states. [2019-11-24 06:05:55,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17914 states to 17914 states and 21607 transitions. [2019-11-24 06:05:55,470 INFO L78 Accepts]: Start accepts. Automaton has 17914 states and 21607 transitions. Word has length 88 [2019-11-24 06:05:55,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:55,470 INFO L462 AbstractCegarLoop]: Abstraction has 17914 states and 21607 transitions. [2019-11-24 06:05:55,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:55,470 INFO L276 IsEmpty]: Start isEmpty. Operand 17914 states and 21607 transitions. [2019-11-24 06:05:55,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-24 06:05:55,481 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:55,481 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-24 06:05:55,481 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:55,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:55,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1093961478, now seen corresponding path program 1 times [2019-11-24 06:05:55,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:55,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816559569] [2019-11-24 06:05:55,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:55,525 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:55,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816559569] [2019-11-24 06:05:55,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:55,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:55,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996552275] [2019-11-24 06:05:55,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:55,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:55,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:55,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:55,527 INFO L87 Difference]: Start difference. First operand 17914 states and 21607 transitions. Second operand 4 states. [2019-11-24 06:05:56,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:56,310 INFO L93 Difference]: Finished difference Result 40506 states and 49510 transitions. [2019-11-24 06:05:56,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:56,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-24 06:05:56,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:56,333 INFO L225 Difference]: With dead ends: 40506 [2019-11-24 06:05:56,333 INFO L226 Difference]: Without dead ends: 25627 [2019-11-24 06:05:56,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:56,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25627 states. [2019-11-24 06:05:57,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25627 to 18854. [2019-11-24 06:05:57,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18854 states. [2019-11-24 06:05:57,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18854 states to 18854 states and 22999 transitions. [2019-11-24 06:05:57,024 INFO L78 Accepts]: Start accepts. Automaton has 18854 states and 22999 transitions. Word has length 107 [2019-11-24 06:05:57,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:57,024 INFO L462 AbstractCegarLoop]: Abstraction has 18854 states and 22999 transitions. [2019-11-24 06:05:57,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:57,025 INFO L276 IsEmpty]: Start isEmpty. Operand 18854 states and 22999 transitions. [2019-11-24 06:05:57,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-24 06:05:57,033 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:57,033 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:05:57,033 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:57,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:57,033 INFO L82 PathProgramCache]: Analyzing trace with hash 818371595, now seen corresponding path program 1 times [2019-11-24 06:05:57,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:57,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593255437] [2019-11-24 06:05:57,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:57,079 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:05:57,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593255437] [2019-11-24 06:05:57,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:57,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:05:57,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824232455] [2019-11-24 06:05:57,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:57,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:57,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:57,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:57,081 INFO L87 Difference]: Start difference. First operand 18854 states and 22999 transitions. Second operand 3 states. [2019-11-24 06:05:57,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:57,670 INFO L93 Difference]: Finished difference Result 34696 states and 42431 transitions. [2019-11-24 06:05:57,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:57,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-11-24 06:05:57,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:57,688 INFO L225 Difference]: With dead ends: 34696 [2019-11-24 06:05:57,688 INFO L226 Difference]: Without dead ends: 18854 [2019-11-24 06:05:57,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:57,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18854 states. [2019-11-24 06:05:58,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18854 to 18854. [2019-11-24 06:05:58,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18854 states. [2019-11-24 06:05:58,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18854 states to 18854 states and 22483 transitions. [2019-11-24 06:05:58,248 INFO L78 Accepts]: Start accepts. Automaton has 18854 states and 22483 transitions. Word has length 109 [2019-11-24 06:05:58,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:58,249 INFO L462 AbstractCegarLoop]: Abstraction has 18854 states and 22483 transitions. [2019-11-24 06:05:58,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:58,249 INFO L276 IsEmpty]: Start isEmpty. Operand 18854 states and 22483 transitions. [2019-11-24 06:05:58,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-24 06:05:58,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:58,258 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:05:58,259 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:58,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:58,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1844791238, now seen corresponding path program 1 times [2019-11-24 06:05:58,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:58,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64891044] [2019-11-24 06:05:58,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:58,324 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:58,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64891044] [2019-11-24 06:05:58,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:58,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:58,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001621836] [2019-11-24 06:05:58,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:58,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:58,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:58,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:58,326 INFO L87 Difference]: Start difference. First operand 18854 states and 22483 transitions. Second operand 4 states. [2019-11-24 06:05:59,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:59,374 INFO L93 Difference]: Finished difference Result 33820 states and 40748 transitions. [2019-11-24 06:05:59,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:59,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-11-24 06:05:59,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:59,390 INFO L225 Difference]: With dead ends: 33820 [2019-11-24 06:05:59,390 INFO L226 Difference]: Without dead ends: 17978 [2019-11-24 06:05:59,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:59,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17978 states. [2019-11-24 06:05:59,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17978 to 14311. [2019-11-24 06:05:59,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14311 states. [2019-11-24 06:05:59,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14311 states to 14311 states and 16951 transitions. [2019-11-24 06:05:59,846 INFO L78 Accepts]: Start accepts. Automaton has 14311 states and 16951 transitions. Word has length 112 [2019-11-24 06:05:59,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:59,847 INFO L462 AbstractCegarLoop]: Abstraction has 14311 states and 16951 transitions. [2019-11-24 06:05:59,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:59,847 INFO L276 IsEmpty]: Start isEmpty. Operand 14311 states and 16951 transitions. [2019-11-24 06:05:59,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-24 06:05:59,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:59,855 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:05:59,855 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:59,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:59,855 INFO L82 PathProgramCache]: Analyzing trace with hash 2000001884, now seen corresponding path program 1 times [2019-11-24 06:05:59,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:59,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712693911] [2019-11-24 06:05:59,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:59,909 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:59,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712693911] [2019-11-24 06:05:59,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:59,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:59,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081189043] [2019-11-24 06:05:59,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:59,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:59,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:59,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:59,912 INFO L87 Difference]: Start difference. First operand 14311 states and 16951 transitions. Second operand 4 states. [2019-11-24 06:06:00,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:00,575 INFO L93 Difference]: Finished difference Result 32102 states and 38602 transitions. [2019-11-24 06:06:00,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:06:00,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-11-24 06:06:00,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:00,592 INFO L225 Difference]: With dead ends: 32102 [2019-11-24 06:06:00,593 INFO L226 Difference]: Without dead ends: 19483 [2019-11-24 06:06:00,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:06:00,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19483 states. [2019-11-24 06:06:01,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19483 to 14894. [2019-11-24 06:06:01,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14894 states. [2019-11-24 06:06:01,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14894 states to 14894 states and 17767 transitions. [2019-11-24 06:06:01,250 INFO L78 Accepts]: Start accepts. Automaton has 14894 states and 17767 transitions. Word has length 131 [2019-11-24 06:06:01,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:01,250 INFO L462 AbstractCegarLoop]: Abstraction has 14894 states and 17767 transitions. [2019-11-24 06:06:01,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:06:01,250 INFO L276 IsEmpty]: Start isEmpty. Operand 14894 states and 17767 transitions. [2019-11-24 06:06:01,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-24 06:06:01,259 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:01,259 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-11-24 06:06:01,260 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:01,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:01,260 INFO L82 PathProgramCache]: Analyzing trace with hash -329818335, now seen corresponding path program 1 times [2019-11-24 06:06:01,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:01,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698892701] [2019-11-24 06:06:01,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:01,312 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:06:01,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698892701] [2019-11-24 06:06:01,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:01,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:06:01,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144307681] [2019-11-24 06:06:01,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:01,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:01,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:01,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:01,314 INFO L87 Difference]: Start difference. First operand 14894 states and 17767 transitions. Second operand 3 states. [2019-11-24 06:06:01,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:01,828 INFO L93 Difference]: Finished difference Result 28096 states and 33618 transitions. [2019-11-24 06:06:01,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:01,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-11-24 06:06:01,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:01,842 INFO L225 Difference]: With dead ends: 28096 [2019-11-24 06:06:01,842 INFO L226 Difference]: Without dead ends: 14894 [2019-11-24 06:06:01,851 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:01,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14894 states. [2019-11-24 06:06:02,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14894 to 14894. [2019-11-24 06:06:02,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14894 states. [2019-11-24 06:06:02,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14894 states to 14894 states and 17335 transitions. [2019-11-24 06:06:02,351 INFO L78 Accepts]: Start accepts. Automaton has 14894 states and 17335 transitions. Word has length 134 [2019-11-24 06:06:02,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:02,352 INFO L462 AbstractCegarLoop]: Abstraction has 14894 states and 17335 transitions. [2019-11-24 06:06:02,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:02,352 INFO L276 IsEmpty]: Start isEmpty. Operand 14894 states and 17335 transitions. [2019-11-24 06:06:02,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-24 06:06:02,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:02,362 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-11-24 06:06:02,363 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:02,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:02,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1638899454, now seen corresponding path program 1 times [2019-11-24 06:06:02,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:02,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489058717] [2019-11-24 06:06:02,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:02,411 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:02,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489058717] [2019-11-24 06:06:02,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:02,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:06:02,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654333629] [2019-11-24 06:06:02,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:02,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:02,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:02,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:02,412 INFO L87 Difference]: Start difference. First operand 14894 states and 17335 transitions. Second operand 3 states. [2019-11-24 06:06:02,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:02,964 INFO L93 Difference]: Finished difference Result 28104 states and 32762 transitions. [2019-11-24 06:06:02,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:02,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-11-24 06:06:02,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:02,977 INFO L225 Difference]: With dead ends: 28104 [2019-11-24 06:06:02,977 INFO L226 Difference]: Without dead ends: 14902 [2019-11-24 06:06:02,986 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:02,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14902 states. [2019-11-24 06:06:03,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14902 to 14834. [2019-11-24 06:06:03,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14834 states. [2019-11-24 06:06:03,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14834 states to 14834 states and 16635 transitions. [2019-11-24 06:06:03,723 INFO L78 Accepts]: Start accepts. Automaton has 14834 states and 16635 transitions. Word has length 134 [2019-11-24 06:06:03,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:03,723 INFO L462 AbstractCegarLoop]: Abstraction has 14834 states and 16635 transitions. [2019-11-24 06:06:03,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:03,724 INFO L276 IsEmpty]: Start isEmpty. Operand 14834 states and 16635 transitions. [2019-11-24 06:06:03,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-24 06:06:03,731 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:03,731 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-11-24 06:06:03,731 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:03,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:03,732 INFO L82 PathProgramCache]: Analyzing trace with hash -300153336, now seen corresponding path program 1 times [2019-11-24 06:06:03,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:03,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837136277] [2019-11-24 06:06:03,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:03,785 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:03,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837136277] [2019-11-24 06:06:03,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:03,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:06:03,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25399253] [2019-11-24 06:06:03,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:06:03,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:03,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:06:03,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:06:03,788 INFO L87 Difference]: Start difference. First operand 14834 states and 16635 transitions. Second operand 4 states. [2019-11-24 06:06:04,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:04,567 INFO L93 Difference]: Finished difference Result 26168 states and 29374 transitions. [2019-11-24 06:06:04,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:06:04,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-11-24 06:06:04,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:04,578 INFO L225 Difference]: With dead ends: 26168 [2019-11-24 06:06:04,579 INFO L226 Difference]: Without dead ends: 13057 [2019-11-24 06:06:04,587 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:06:04,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13057 states. [2019-11-24 06:06:04,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13057 to 10929. [2019-11-24 06:06:04,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10929 states. [2019-11-24 06:06:04,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10929 states to 10929 states and 12045 transitions. [2019-11-24 06:06:04,975 INFO L78 Accepts]: Start accepts. Automaton has 10929 states and 12045 transitions. Word has length 138 [2019-11-24 06:06:04,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:04,975 INFO L462 AbstractCegarLoop]: Abstraction has 10929 states and 12045 transitions. [2019-11-24 06:06:04,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:06:04,975 INFO L276 IsEmpty]: Start isEmpty. Operand 10929 states and 12045 transitions. [2019-11-24 06:06:04,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-24 06:06:04,981 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:04,981 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:06:04,981 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:04,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:04,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1836825310, now seen corresponding path program 1 times [2019-11-24 06:06:04,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:04,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849352163] [2019-11-24 06:06:04,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:05,199 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:06:05,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849352163] [2019-11-24 06:06:05,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:05,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 06:06:05,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786585643] [2019-11-24 06:06:05,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 06:06:05,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:05,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 06:06:05,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-24 06:06:05,201 INFO L87 Difference]: Start difference. First operand 10929 states and 12045 transitions. Second operand 7 states. [2019-11-24 06:06:06,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:06,936 INFO L93 Difference]: Finished difference Result 44526 states and 48715 transitions. [2019-11-24 06:06:06,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 06:06:06,937 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 165 [2019-11-24 06:06:06,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:06,969 INFO L225 Difference]: With dead ends: 44526 [2019-11-24 06:06:06,969 INFO L226 Difference]: Without dead ends: 40594 [2019-11-24 06:06:06,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-24 06:06:07,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40594 states. [2019-11-24 06:06:07,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40594 to 20854. [2019-11-24 06:06:07,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20854 states. [2019-11-24 06:06:07,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20854 states to 20854 states and 22790 transitions. [2019-11-24 06:06:07,897 INFO L78 Accepts]: Start accepts. Automaton has 20854 states and 22790 transitions. Word has length 165 [2019-11-24 06:06:07,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:07,897 INFO L462 AbstractCegarLoop]: Abstraction has 20854 states and 22790 transitions. [2019-11-24 06:06:07,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 06:06:07,898 INFO L276 IsEmpty]: Start isEmpty. Operand 20854 states and 22790 transitions. [2019-11-24 06:06:07,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-24 06:06:07,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:07,906 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:06:07,906 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:07,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:07,906 INFO L82 PathProgramCache]: Analyzing trace with hash 30204056, now seen corresponding path program 1 times [2019-11-24 06:06:07,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:07,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034340249] [2019-11-24 06:06:07,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-24 06:06:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-24 06:06:08,079 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-24 06:06:08,079 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-24 06:06:08,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 06:06:08 BoogieIcfgContainer [2019-11-24 06:06:08,253 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 06:06:08,256 INFO L168 Benchmark]: Toolchain (without parser) took 40506.77 ms. Allocated memory was 145.2 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 101.4 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-11-24 06:06:08,256 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 145.2 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-24 06:06:08,257 INFO L168 Benchmark]: CACSL2BoogieTranslator took 511.24 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.2 MB in the beginning and 177.0 MB in the end (delta: -75.8 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. [2019-11-24 06:06:08,257 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.04 ms. Allocated memory is still 202.4 MB. Free memory was 177.0 MB in the beginning and 171.8 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. [2019-11-24 06:06:08,258 INFO L168 Benchmark]: Boogie Preprocessor took 103.34 ms. Allocated memory is still 202.4 MB. Free memory was 171.8 MB in the beginning and 166.9 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2019-11-24 06:06:08,258 INFO L168 Benchmark]: RCFGBuilder took 2786.88 ms. Allocated memory was 202.4 MB in the beginning and 248.0 MB in the end (delta: 45.6 MB). Free memory was 166.9 MB in the beginning and 148.8 MB in the end (delta: 18.1 MB). Peak memory consumption was 121.1 MB. Max. memory is 7.1 GB. [2019-11-24 06:06:08,259 INFO L168 Benchmark]: TraceAbstraction took 36995.09 ms. Allocated memory was 248.0 MB in the beginning and 2.8 GB in the end (delta: 2.5 GB). Free memory was 148.8 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-11-24 06:06:08,262 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 145.2 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 511.24 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.2 MB in the beginning and 177.0 MB in the end (delta: -75.8 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 105.04 ms. Allocated memory is still 202.4 MB. Free memory was 177.0 MB in the beginning and 171.8 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 103.34 ms. Allocated memory is still 202.4 MB. Free memory was 171.8 MB in the beginning and 166.9 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2786.88 ms. Allocated memory was 202.4 MB in the beginning and 248.0 MB in the end (delta: 45.6 MB). Free memory was 166.9 MB in the beginning and 148.8 MB in the end (delta: 18.1 MB). Peak memory consumption was 121.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 36995.09 ms. Allocated memory was 248.0 MB in the beginning and 2.8 GB in the end (delta: 2.5 GB). Free memory was 148.8 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int t2_pc = 0; [L17] int t3_pc = 0; [L18] int t4_pc = 0; [L19] int m_st ; [L20] int t1_st ; [L21] int t2_st ; [L22] int t3_st ; [L23] int t4_st ; [L24] int m_i ; [L25] int t1_i ; [L26] int t2_i ; [L27] int t3_i ; [L28] int t4_i ; [L29] int M_E = 2; [L30] int T1_E = 2; [L31] int T2_E = 2; [L32] int T3_E = 2; [L33] int T4_E = 2; [L34] int E_M = 2; [L35] int E_1 = 2; [L36] int E_2 = 2; [L37] int E_3 = 2; [L38] int E_4 = 2; [L45] int token ; [L47] int local ; [L850] int __retres1 ; [L762] m_i = 1 [L763] t1_i = 1 [L764] t2_i = 1 [L765] t3_i = 1 [L766] t4_i = 1 [L791] int kernel_st ; [L792] int tmp ; [L793] int tmp___0 ; [L797] kernel_st = 0 [L355] COND TRUE m_i == 1 [L356] m_st = 0 [L360] COND TRUE t1_i == 1 [L361] t1_st = 0 [L365] COND TRUE t2_i == 1 [L366] t2_st = 0 [L370] COND TRUE t3_i == 1 [L371] t3_st = 0 [L375] COND TRUE t4_i == 1 [L376] t4_st = 0 [L516] COND FALSE !(M_E == 0) [L521] COND FALSE !(T1_E == 0) [L526] COND FALSE !(T2_E == 0) [L531] COND FALSE !(T3_E == 0) [L536] COND FALSE !(T4_E == 0) [L541] COND FALSE !(E_M == 0) [L546] COND FALSE !(E_1 == 0) [L551] COND FALSE !(E_2 == 0) [L556] COND FALSE !(E_3 == 0) [L561] COND FALSE !(E_4 == 0) [L629] int tmp ; [L630] int tmp___0 ; [L631] int tmp___1 ; [L632] int tmp___2 ; [L633] int tmp___3 ; [L249] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L252] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L262] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L264] return (__retres1); [L637] tmp = is_master_triggered() [L639] COND FALSE !(\read(tmp)) [L268] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L271] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L281] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L283] return (__retres1); [L645] tmp___0 = is_transmit1_triggered() [L647] COND FALSE !(\read(tmp___0)) [L287] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L290] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L300] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L302] return (__retres1); [L653] tmp___1 = is_transmit2_triggered() [L655] COND FALSE !(\read(tmp___1)) [L306] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L309] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L319] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L321] return (__retres1); [L661] tmp___2 = is_transmit3_triggered() [L663] COND FALSE !(\read(tmp___2)) [L325] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L328] COND FALSE !(t4_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L338] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L340] return (__retres1); [L669] tmp___3 = is_transmit4_triggered() [L671] COND FALSE !(\read(tmp___3)) [L574] COND FALSE !(M_E == 1) [L579] COND FALSE !(T1_E == 1) [L584] COND FALSE !(T2_E == 1) [L589] COND FALSE !(T3_E == 1) [L594] COND FALSE !(T4_E == 1) [L599] COND FALSE !(E_M == 1) [L604] COND FALSE !(E_1 == 1) [L609] COND FALSE !(E_2 == 1) [L614] COND FALSE !(E_3 == 1) [L619] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L805] COND TRUE 1 [L808] kernel_st = 1 [L421] int tmp ; VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L425] COND TRUE 1 [L385] int __retres1 ; [L388] COND TRUE m_st == 0 [L389] __retres1 = 1 [L416] return (__retres1); [L428] tmp = exists_runnable_thread() [L430] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L435] COND TRUE m_st == 0 [L436] int tmp_ndt_1; [L437] tmp_ndt_1 = __VERIFIER_nondet_int() [L438] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L449] COND TRUE t1_st == 0 [L450] int tmp_ndt_2; [L451] tmp_ndt_2 = __VERIFIER_nondet_int() [L452] COND TRUE \read(tmp_ndt_2) [L454] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L108] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L119] COND TRUE 1 [L121] t1_pc = 1 [L122] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L463] COND TRUE t2_st == 0 [L464] int tmp_ndt_3; [L465] tmp_ndt_3 = __VERIFIER_nondet_int() [L466] COND TRUE \read(tmp_ndt_3) [L468] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L144] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L155] COND TRUE 1 [L157] t2_pc = 1 [L158] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L477] COND TRUE t3_st == 0 [L478] int tmp_ndt_4; [L479] tmp_ndt_4 = __VERIFIER_nondet_int() [L480] COND TRUE \read(tmp_ndt_4) [L482] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L180] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L191] COND TRUE 1 [L193] t3_pc = 1 [L194] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L491] COND TRUE t4_st == 0 [L492] int tmp_ndt_5; [L493] tmp_ndt_5 = __VERIFIER_nondet_int() [L494] COND TRUE \read(tmp_ndt_5) [L496] t4_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=1, token=0] [L216] COND TRUE t4_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=0, t4_st=1, token=0] [L227] COND TRUE 1 [L229] t4_pc = 1 [L230] t4_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L425] COND TRUE 1 [L385] int __retres1 ; [L388] COND TRUE m_st == 0 [L389] __retres1 = 1 [L416] return (__retres1); [L428] tmp = exists_runnable_thread() [L430] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L435] COND TRUE m_st == 0 [L436] int tmp_ndt_1; [L437] tmp_ndt_1 = __VERIFIER_nondet_int() [L438] COND TRUE \read(tmp_ndt_1) [L440] m_st = 1 [L50] int tmp_var = __VERIFIER_nondet_int(); [L52] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L63] COND TRUE 1 [L66] token = __VERIFIER_nondet_int() [L67] local = token [L68] E_1 = 1 [L629] int tmp ; [L630] int tmp___0 ; [L631] int tmp___1 ; [L632] int tmp___2 ; [L633] int tmp___3 ; [L249] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-4] [L252] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-4] [L262] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-4] [L264] return (__retres1); [L637] tmp = is_master_triggered() [L639] COND FALSE !(\read(tmp)) [L268] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-4] [L271] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-4] [L272] COND TRUE E_1 == 1 [L273] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-4] [L283] return (__retres1); [L645] tmp___0 = is_transmit1_triggered() [L647] COND TRUE \read(tmp___0) [L648] t1_st = 0 [L287] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-4] [L290] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-4] [L291] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-4] [L300] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-4] [L302] return (__retres1); [L653] tmp___1 = is_transmit2_triggered() [L655] COND FALSE !(\read(tmp___1)) [L306] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-4] [L309] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-4] [L310] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-4] [L319] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-4] [L321] return (__retres1); [L661] tmp___2 = is_transmit3_triggered() [L663] COND FALSE !(\read(tmp___2)) [L325] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-4] [L328] COND TRUE t4_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-4] [L329] COND FALSE !(E_4 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-4] [L338] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-4] [L340] return (__retres1); [L669] tmp___3 = is_transmit4_triggered() [L671] COND FALSE !(\read(tmp___3)) [L70] E_1 = 2 [L71] m_pc = 1 [L72] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-4] [L449] COND TRUE t1_st == 0 [L450] int tmp_ndt_2; [L451] tmp_ndt_2 = __VERIFIER_nondet_int() [L452] COND TRUE \read(tmp_ndt_2) [L454] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-4] [L108] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-4] [L111] COND TRUE t1_pc == 1 [L127] token += 1 [L128] E_2 = 1 [L629] int tmp ; [L630] int tmp___0 ; [L631] int tmp___1 ; [L632] int tmp___2 ; [L633] int tmp___3 ; [L249] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-3] [L252] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-3] [L253] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-3] [L262] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-3] [L264] return (__retres1); [L637] tmp = is_master_triggered() [L639] COND FALSE !(\read(tmp)) [L268] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-3] [L271] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-3] [L272] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-3] [L281] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-3] [L283] return (__retres1); [L645] tmp___0 = is_transmit1_triggered() [L647] COND FALSE !(\read(tmp___0)) [L287] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-3] [L290] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-3] [L291] COND TRUE E_2 == 1 [L292] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-3] [L302] return (__retres1); [L653] tmp___1 = is_transmit2_triggered() [L655] COND TRUE \read(tmp___1) [L656] t2_st = 0 [L306] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-3] [L309] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-3] [L310] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-3] [L319] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-3] [L321] return (__retres1); [L661] tmp___2 = is_transmit3_triggered() [L663] COND FALSE !(\read(tmp___2)) [L325] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-3] [L328] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-3] [L329] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-3] [L338] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-3] [L340] return (__retres1); [L669] tmp___3 = is_transmit4_triggered() [L671] COND FALSE !(\read(tmp___3)) [L130] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-3] [L119] COND TRUE 1 [L121] t1_pc = 1 [L122] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-3] [L463] COND TRUE t2_st == 0 [L464] int tmp_ndt_3; [L465] tmp_ndt_3 = __VERIFIER_nondet_int() [L466] COND TRUE \read(tmp_ndt_3) [L468] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-3] [L144] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-3] [L147] COND TRUE t2_pc == 1 [L163] token += 1 [L164] E_3 = 1 [L629] int tmp ; [L630] int tmp___0 ; [L631] int tmp___1 ; [L632] int tmp___2 ; [L633] int tmp___3 ; [L249] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-2] [L252] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-2] [L253] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-2] [L262] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-2] [L264] return (__retres1); [L637] tmp = is_master_triggered() [L639] COND FALSE !(\read(tmp)) [L268] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-2] [L271] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-2] [L272] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-2] [L281] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-2] [L283] return (__retres1); [L645] tmp___0 = is_transmit1_triggered() [L647] COND FALSE !(\read(tmp___0)) [L287] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-2] [L290] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-2] [L291] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-2] [L300] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-2] [L302] return (__retres1); [L653] tmp___1 = is_transmit2_triggered() [L655] COND FALSE !(\read(tmp___1)) [L306] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-2] [L309] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-2] [L310] COND TRUE E_3 == 1 [L311] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-2] [L321] return (__retres1); [L661] tmp___2 = is_transmit3_triggered() [L663] COND TRUE \read(tmp___2) [L664] t3_st = 0 [L325] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-2] [L328] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-2] [L329] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-2] [L338] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-2] [L340] return (__retres1); [L669] tmp___3 = is_transmit4_triggered() [L671] COND FALSE !(\read(tmp___3)) [L166] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-2] [L155] COND TRUE 1 [L157] t2_pc = 1 [L158] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-2] [L477] COND TRUE t3_st == 0 [L478] int tmp_ndt_4; [L479] tmp_ndt_4 = __VERIFIER_nondet_int() [L480] COND TRUE \read(tmp_ndt_4) [L482] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-2] [L180] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-2] [L183] COND TRUE t3_pc == 1 [L199] token += 1 [L200] E_4 = 1 [L629] int tmp ; [L630] int tmp___0 ; [L631] int tmp___1 ; [L632] int tmp___2 ; [L633] int tmp___3 ; [L249] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-1] [L252] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-1] [L253] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-1] [L262] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-1] [L264] return (__retres1); [L637] tmp = is_master_triggered() [L639] COND FALSE !(\read(tmp)) [L268] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-1] [L271] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-1] [L272] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-1] [L281] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-1] [L283] return (__retres1); [L645] tmp___0 = is_transmit1_triggered() [L647] COND FALSE !(\read(tmp___0)) [L287] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-1] [L290] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-1] [L291] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-1] [L300] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-1] [L302] return (__retres1); [L653] tmp___1 = is_transmit2_triggered() [L655] COND FALSE !(\read(tmp___1)) [L306] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-1] [L309] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-1] [L310] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-1] [L319] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-1] [L321] return (__retres1); [L661] tmp___2 = is_transmit3_triggered() [L663] COND FALSE !(\read(tmp___2)) [L325] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-1] [L328] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-1] [L329] COND TRUE E_4 == 1 [L330] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=-1] [L340] return (__retres1); [L669] tmp___3 = is_transmit4_triggered() [L671] COND TRUE \read(tmp___3) [L672] t4_st = 0 [L202] E_4 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, token=-1] [L191] COND TRUE 1 [L193] t3_pc = 1 [L194] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, token=-1] [L491] COND TRUE t4_st == 0 [L492] int tmp_ndt_5; [L493] tmp_ndt_5 = __VERIFIER_nondet_int() [L494] COND TRUE \read(tmp_ndt_5) [L496] t4_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=-1] [L216] COND FALSE !(t4_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=-1] [L219] COND TRUE t4_pc == 1 [L235] token += 1 [L236] E_M = 1 [L629] int tmp ; [L630] int tmp___0 ; [L631] int tmp___1 ; [L632] int tmp___2 ; [L633] int tmp___3 ; [L249] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=-4, 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=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=0] [L252] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=-4, 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=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=0] [L253] COND TRUE E_M == 1 [L254] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=-4, 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=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=0] [L264] return (__retres1); [L637] tmp = is_master_triggered() [L639] COND TRUE \read(tmp) [L640] m_st = 0 [L268] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=0] [L271] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=0] [L272] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=0] [L281] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=0] [L283] return (__retres1); [L645] tmp___0 = is_transmit1_triggered() [L647] COND FALSE !(\read(tmp___0)) [L287] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=0] [L290] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=0] [L291] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=0] [L300] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=0] [L302] return (__retres1); [L653] tmp___1 = is_transmit2_triggered() [L655] COND FALSE !(\read(tmp___1)) [L306] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=0] [L309] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=0] [L310] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=0] [L319] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=0] [L321] return (__retres1); [L661] tmp___2 = is_transmit3_triggered() [L663] COND FALSE !(\read(tmp___2)) [L325] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=0] [L328] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=0] [L329] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=0] [L338] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=0] [L340] return (__retres1); [L669] tmp___3 = is_transmit4_triggered() [L671] COND FALSE !(\read(tmp___3)) [L238] E_M = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=0] [L227] COND TRUE 1 [L229] t4_pc = 1 [L230] t4_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L425] COND TRUE 1 [L385] int __retres1 ; [L388] COND TRUE m_st == 0 [L389] __retres1 = 1 [L416] return (__retres1); [L428] tmp = exists_runnable_thread() [L430] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L435] COND TRUE m_st == 0 [L436] int tmp_ndt_1; [L437] tmp_ndt_1 = __VERIFIER_nondet_int() [L438] COND TRUE \read(tmp_ndt_1) [L440] m_st = 1 [L50] int tmp_var = __VERIFIER_nondet_int(); [L52] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L55] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L77] COND FALSE !(token != local + 4) [L82] COND TRUE tmp_var <= 5 [L83] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L88] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L89] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L90] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L10] __VERIFIER_error() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=-4, 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, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 203 locations, 2 error locations. Result: UNSAFE, OverallTime: 36.9s, OverallIterations: 33, TraceHistogramMax: 3, AutomataDifference: 18.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11991 SDtfs, 9567 SDslu, 13721 SDs, 0 SdLazy, 1379 SolverSat, 325 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 955 GetRequests, 856 SyntacticMatches, 6 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25548occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.2s AutomataMinimizationTime, 32 MinimizatonAttempts, 56952 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 3323 NumberOfCodeBlocks, 3323 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 3509 ConstructedInterpolants, 0 QuantifiedInterpolants, 776375 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1854 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 42 InterpolantComputations, 36 PerfectInterpolantSequences, 552/563 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...