/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.02.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 06:05:15,285 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 06:05:15,287 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 06:05:15,306 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 06:05:15,306 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 06:05:15,308 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 06:05:15,310 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 06:05:15,320 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 06:05:15,324 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 06:05:15,327 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 06:05:15,330 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 06:05:15,332 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 06:05:15,332 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 06:05:15,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 06:05:15,337 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 06:05:15,338 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 06:05:15,340 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 06:05:15,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 06:05:15,343 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 06:05:15,348 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 06:05:15,353 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 06:05:15,357 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 06:05:15,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 06:05:15,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 06:05:15,361 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 06:05:15,361 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 06:05:15,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 06:05:15,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 06:05:15,365 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 06:05:15,366 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 06:05:15,367 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 06:05:15,368 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 06:05:15,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 06:05:15,370 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 06:05:15,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 06:05:15,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 06:05:15,373 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 06:05:15,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 06:05:15,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 06:05:15,374 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 06:05:15,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 06:05:15,376 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:15,391 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 06:05:15,391 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 06:05:15,392 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 06:05:15,392 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 06:05:15,392 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 06:05:15,393 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 06:05:15,393 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 06:05:15,393 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 06:05:15,393 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 06:05:15,393 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 06:05:15,394 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 06:05:15,397 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 06:05:15,397 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 06:05:15,397 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 06:05:15,398 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 06:05:15,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 06:05:15,399 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 06:05:15,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 06:05:15,399 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 06:05:15,399 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 06:05:15,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 06:05:15,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 06:05:15,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 06:05:15,400 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 06:05:15,400 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 06:05:15,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 06:05:15,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 06:05:15,401 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 06:05:15,401 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 06:05:15,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 06:05:15,401 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 06:05:15,402 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 06:05:15,402 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 06:05:15,402 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 06:05:15,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 06:05:15,402 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 06:05:15,403 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 06:05:15,403 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 06:05:15,713 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 06:05:15,727 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 06:05:15,731 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 06:05:15,733 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 06:05:15,733 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 06:05:15,734 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.02.cil-1.c [2019-11-24 06:05:15,793 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/658e64623/dccc5ea220024d0ab6313c9839c27df4/FLAGcebea1f25 [2019-11-24 06:05:16,262 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 06:05:16,263 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-1.c [2019-11-24 06:05:16,274 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/658e64623/dccc5ea220024d0ab6313c9839c27df4/FLAGcebea1f25 [2019-11-24 06:05:16,630 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/658e64623/dccc5ea220024d0ab6313c9839c27df4 [2019-11-24 06:05:16,640 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 06:05:16,642 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 06:05:16,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 06:05:16,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 06:05:16,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 06:05:16,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:05:16" (1/1) ... [2019-11-24 06:05:16,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b57d1a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:16, skipping insertion in model container [2019-11-24 06:05:16,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:05:16" (1/1) ... [2019-11-24 06:05:16,659 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 06:05:16,708 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 06:05:16,937 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:05:16,944 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 06:05:17,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:05:17,097 INFO L208 MainTranslator]: Completed translation [2019-11-24 06:05:17,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:17 WrapperNode [2019-11-24 06:05:17,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 06:05:17,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 06:05:17,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 06:05:17,098 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 06:05:17,107 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:17" (1/1) ... [2019-11-24 06:05:17,114 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:17" (1/1) ... [2019-11-24 06:05:17,156 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 06:05:17,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 06:05:17,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 06:05:17,157 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 06:05:17,165 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:17" (1/1) ... [2019-11-24 06:05:17,165 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:17" (1/1) ... [2019-11-24 06:05:17,169 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:17" (1/1) ... [2019-11-24 06:05:17,169 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:17" (1/1) ... [2019-11-24 06:05:17,188 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:17" (1/1) ... [2019-11-24 06:05:17,212 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:17" (1/1) ... [2019-11-24 06:05:17,221 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:17" (1/1) ... [2019-11-24 06:05:17,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 06:05:17,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 06:05:17,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 06:05:17,228 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 06:05:17,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:17" (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:17,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 06:05:17,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 06:05:18,958 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 06:05:18,959 INFO L284 CfgBuilder]: Removed 103 assume(true) statements. [2019-11-24 06:05:18,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:05:18 BoogieIcfgContainer [2019-11-24 06:05:18,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 06:05:18,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 06:05:18,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 06:05:18,966 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 06:05:18,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 06:05:16" (1/3) ... [2019-11-24 06:05:18,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269eeb8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:05:18, skipping insertion in model container [2019-11-24 06:05:18,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:17" (2/3) ... [2019-11-24 06:05:18,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269eeb8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:05:18, skipping insertion in model container [2019-11-24 06:05:18,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:05:18" (3/3) ... [2019-11-24 06:05:18,970 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2019-11-24 06:05:18,980 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 06:05:18,990 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-24 06:05:19,002 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-24 06:05:19,032 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 06:05:19,032 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 06:05:19,032 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 06:05:19,032 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 06:05:19,032 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 06:05:19,033 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 06:05:19,033 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 06:05:19,033 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 06:05:19,048 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2019-11-24 06:05:19,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 06:05:19,053 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:19,054 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:19,055 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:19,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:19,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1367945884, now seen corresponding path program 1 times [2019-11-24 06:05:19,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:19,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432102648] [2019-11-24 06:05:19,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:19,232 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:19,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432102648] [2019-11-24 06:05:19,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:19,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:05:19,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364280972] [2019-11-24 06:05:19,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:19,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:19,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:19,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:19,262 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 3 states. [2019-11-24 06:05:19,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:19,418 INFO L93 Difference]: Finished difference Result 276 states and 424 transitions. [2019-11-24 06:05:19,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:19,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 06:05:19,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:19,439 INFO L225 Difference]: With dead ends: 276 [2019-11-24 06:05:19,440 INFO L226 Difference]: Without dead ends: 174 [2019-11-24 06:05:19,446 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:19,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-24 06:05:19,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 164. [2019-11-24 06:05:19,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-24 06:05:19,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 241 transitions. [2019-11-24 06:05:19,529 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 241 transitions. Word has length 19 [2019-11-24 06:05:19,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:19,529 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 241 transitions. [2019-11-24 06:05:19,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:19,530 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 241 transitions. [2019-11-24 06:05:19,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 06:05:19,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:19,535 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] [2019-11-24 06:05:19,535 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:19,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:19,535 INFO L82 PathProgramCache]: Analyzing trace with hash 2096870180, now seen corresponding path program 1 times [2019-11-24 06:05:19,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:19,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319242428] [2019-11-24 06:05:19,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:19,623 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:19,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319242428] [2019-11-24 06:05:19,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:19,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:05:19,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871603387] [2019-11-24 06:05:19,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:19,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:19,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:19,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:19,628 INFO L87 Difference]: Start difference. First operand 164 states and 241 transitions. Second operand 3 states. [2019-11-24 06:05:19,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:19,705 INFO L93 Difference]: Finished difference Result 444 states and 652 transitions. [2019-11-24 06:05:19,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:19,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-24 06:05:19,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:19,710 INFO L225 Difference]: With dead ends: 444 [2019-11-24 06:05:19,710 INFO L226 Difference]: Without dead ends: 285 [2019-11-24 06:05:19,712 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:19,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-24 06:05:19,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 281. [2019-11-24 06:05:19,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-11-24 06:05:19,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 404 transitions. [2019-11-24 06:05:19,736 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 404 transitions. Word has length 36 [2019-11-24 06:05:19,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:19,736 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 404 transitions. [2019-11-24 06:05:19,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:19,736 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 404 transitions. [2019-11-24 06:05:19,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 06:05:19,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:19,739 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] [2019-11-24 06:05:19,739 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:19,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:19,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1279122493, now seen corresponding path program 1 times [2019-11-24 06:05:19,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:19,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202968528] [2019-11-24 06:05:19,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:19,851 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:19,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202968528] [2019-11-24 06:05:19,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:19,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:19,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081250013] [2019-11-24 06:05:19,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:19,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:19,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:19,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:19,854 INFO L87 Difference]: Start difference. First operand 281 states and 404 transitions. Second operand 3 states. [2019-11-24 06:05:19,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:19,926 INFO L93 Difference]: Finished difference Result 775 states and 1112 transitions. [2019-11-24 06:05:19,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:19,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-24 06:05:19,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:19,955 INFO L225 Difference]: With dead ends: 775 [2019-11-24 06:05:19,960 INFO L226 Difference]: Without dead ends: 502 [2019-11-24 06:05:19,962 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:19,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-11-24 06:05:19,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 488. [2019-11-24 06:05:19,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-11-24 06:05:19,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 687 transitions. [2019-11-24 06:05:19,990 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 687 transitions. Word has length 36 [2019-11-24 06:05:19,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:19,991 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 687 transitions. [2019-11-24 06:05:19,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:19,991 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 687 transitions. [2019-11-24 06:05:19,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 06:05:19,993 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:19,994 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] [2019-11-24 06:05:19,994 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:19,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:19,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1736520068, now seen corresponding path program 1 times [2019-11-24 06:05:19,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:19,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445979210] [2019-11-24 06:05:19,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:20,084 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:20,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445979210] [2019-11-24 06:05:20,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:20,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 06:05:20,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532507669] [2019-11-24 06:05:20,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 06:05:20,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:20,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 06:05:20,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:20,088 INFO L87 Difference]: Start difference. First operand 488 states and 687 transitions. Second operand 6 states. [2019-11-24 06:05:20,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:20,230 INFO L93 Difference]: Finished difference Result 939 states and 1363 transitions. [2019-11-24 06:05:20,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 06:05:20,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-11-24 06:05:20,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:20,235 INFO L225 Difference]: With dead ends: 939 [2019-11-24 06:05:20,235 INFO L226 Difference]: Without dead ends: 663 [2019-11-24 06:05:20,237 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-24 06:05:20,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-11-24 06:05:20,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 578. [2019-11-24 06:05:20,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-11-24 06:05:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 827 transitions. [2019-11-24 06:05:20,264 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 827 transitions. Word has length 36 [2019-11-24 06:05:20,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:20,265 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 827 transitions. [2019-11-24 06:05:20,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 06:05:20,265 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 827 transitions. [2019-11-24 06:05:20,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-24 06:05:20,273 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:20,274 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] [2019-11-24 06:05:20,274 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:20,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:20,275 INFO L82 PathProgramCache]: Analyzing trace with hash 398861694, now seen corresponding path program 1 times [2019-11-24 06:05:20,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:20,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932440406] [2019-11-24 06:05:20,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:20,385 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:20,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932440406] [2019-11-24 06:05:20,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:20,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:20,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452531970] [2019-11-24 06:05:20,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:20,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:20,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:20,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:20,388 INFO L87 Difference]: Start difference. First operand 578 states and 827 transitions. Second operand 3 states. [2019-11-24 06:05:20,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:20,443 INFO L93 Difference]: Finished difference Result 980 states and 1410 transitions. [2019-11-24 06:05:20,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:20,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-24 06:05:20,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:20,447 INFO L225 Difference]: With dead ends: 980 [2019-11-24 06:05:20,447 INFO L226 Difference]: Without dead ends: 614 [2019-11-24 06:05:20,448 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:20,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-11-24 06:05:20,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 578. [2019-11-24 06:05:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-11-24 06:05:20,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 803 transitions. [2019-11-24 06:05:20,470 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 803 transitions. Word has length 52 [2019-11-24 06:05:20,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:20,471 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 803 transitions. [2019-11-24 06:05:20,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:20,471 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 803 transitions. [2019-11-24 06:05:20,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-24 06:05:20,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:20,473 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] [2019-11-24 06:05:20,473 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:20,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:20,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1372350653, now seen corresponding path program 1 times [2019-11-24 06:05:20,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:20,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91907729] [2019-11-24 06:05:20,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:20,580 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:20,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91907729] [2019-11-24 06:05:20,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:20,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:20,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613993286] [2019-11-24 06:05:20,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:20,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:20,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:20,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:20,584 INFO L87 Difference]: Start difference. First operand 578 states and 803 transitions. Second operand 4 states. [2019-11-24 06:05:20,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:20,642 INFO L93 Difference]: Finished difference Result 953 states and 1333 transitions. [2019-11-24 06:05:20,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:20,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-24 06:05:20,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:20,646 INFO L225 Difference]: With dead ends: 953 [2019-11-24 06:05:20,646 INFO L226 Difference]: Without dead ends: 595 [2019-11-24 06:05:20,648 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:20,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-11-24 06:05:20,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 578. [2019-11-24 06:05:20,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-11-24 06:05:20,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 789 transitions. [2019-11-24 06:05:20,675 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 789 transitions. Word has length 52 [2019-11-24 06:05:20,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:20,676 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 789 transitions. [2019-11-24 06:05:20,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:20,676 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 789 transitions. [2019-11-24 06:05:20,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-24 06:05:20,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:20,679 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] [2019-11-24 06:05:20,679 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:20,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:20,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1602334248, now seen corresponding path program 1 times [2019-11-24 06:05:20,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:20,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974191616] [2019-11-24 06:05:20,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:20,836 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:20,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974191616] [2019-11-24 06:05:20,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483458620] [2019-11-24 06:05:20,837 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:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:20,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-24 06:05:20,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:20,969 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:20,970 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:20,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:20,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:20,992 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:20,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:05:20,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [5] total 6 [2019-11-24 06:05:20,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151094244] [2019-11-24 06:05:20,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:20,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:20,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:20,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:20,996 INFO L87 Difference]: Start difference. First operand 578 states and 789 transitions. Second operand 3 states. [2019-11-24 06:05:21,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:21,069 INFO L93 Difference]: Finished difference Result 1337 states and 1828 transitions. [2019-11-24 06:05:21,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:21,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-24 06:05:21,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:21,074 INFO L225 Difference]: With dead ends: 1337 [2019-11-24 06:05:21,074 INFO L226 Difference]: Without dead ends: 769 [2019-11-24 06:05:21,075 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:21,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2019-11-24 06:05:21,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 767. [2019-11-24 06:05:21,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-11-24 06:05:21,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1036 transitions. [2019-11-24 06:05:21,107 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1036 transitions. Word has length 53 [2019-11-24 06:05:21,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:21,108 INFO L462 AbstractCegarLoop]: Abstraction has 767 states and 1036 transitions. [2019-11-24 06:05:21,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:21,108 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1036 transitions. [2019-11-24 06:05:21,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-24 06:05:21,110 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:21,110 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] [2019-11-24 06:05:21,313 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:21,314 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:21,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:21,315 INFO L82 PathProgramCache]: Analyzing trace with hash 818560986, now seen corresponding path program 1 times [2019-11-24 06:05:21,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:21,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877628319] [2019-11-24 06:05:21,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:21,401 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:21,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877628319] [2019-11-24 06:05:21,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632996413] [2019-11-24 06:05:21,403 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:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:21,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-24 06:05:21,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:21,493 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:21,493 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:21,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:21,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:21,503 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:21,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:05:21,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [6] total 7 [2019-11-24 06:05:21,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103492485] [2019-11-24 06:05:21,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:21,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:21,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:21,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-24 06:05:21,506 INFO L87 Difference]: Start difference. First operand 767 states and 1036 transitions. Second operand 3 states. [2019-11-24 06:05:21,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:21,622 INFO L93 Difference]: Finished difference Result 2139 states and 2876 transitions. [2019-11-24 06:05:21,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:21,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-24 06:05:21,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:21,633 INFO L225 Difference]: With dead ends: 2139 [2019-11-24 06:05:21,633 INFO L226 Difference]: Without dead ends: 1382 [2019-11-24 06:05:21,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-24 06:05:21,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2019-11-24 06:05:21,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1380. [2019-11-24 06:05:21,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1380 states. [2019-11-24 06:05:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 1831 transitions. [2019-11-24 06:05:21,702 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 1831 transitions. Word has length 54 [2019-11-24 06:05:21,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:21,703 INFO L462 AbstractCegarLoop]: Abstraction has 1380 states and 1831 transitions. [2019-11-24 06:05:21,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:21,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1831 transitions. [2019-11-24 06:05:21,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-24 06:05:21,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:21,706 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] [2019-11-24 06:05:21,909 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:21,910 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:21,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:21,910 INFO L82 PathProgramCache]: Analyzing trace with hash -332096680, now seen corresponding path program 1 times [2019-11-24 06:05:21,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:21,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068229957] [2019-11-24 06:05:21,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:21,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068229957] [2019-11-24 06:05:21,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012492864] [2019-11-24 06:05:21,985 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:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:22,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-24 06:05:22,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:22,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:22,096 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:22,097 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:22,120 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:22,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:05:22,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [5] total 10 [2019-11-24 06:05:22,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460682413] [2019-11-24 06:05:22,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 06:05:22,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:22,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 06:05:22,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-24 06:05:22,123 INFO L87 Difference]: Start difference. First operand 1380 states and 1831 transitions. Second operand 8 states. [2019-11-24 06:05:22,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:22,607 INFO L93 Difference]: Finished difference Result 3198 states and 4343 transitions. [2019-11-24 06:05:22,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-24 06:05:22,608 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-11-24 06:05:22,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:22,618 INFO L225 Difference]: With dead ends: 3198 [2019-11-24 06:05:22,618 INFO L226 Difference]: Without dead ends: 1828 [2019-11-24 06:05:22,622 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2019-11-24 06:05:22,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1828 states. [2019-11-24 06:05:22,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1828 to 1185. [2019-11-24 06:05:22,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-11-24 06:05:22,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1611 transitions. [2019-11-24 06:05:22,808 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1611 transitions. Word has length 55 [2019-11-24 06:05:22,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:22,808 INFO L462 AbstractCegarLoop]: Abstraction has 1185 states and 1611 transitions. [2019-11-24 06:05:22,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 06:05:22,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1611 transitions. [2019-11-24 06:05:22,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-24 06:05:22,811 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:22,812 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] [2019-11-24 06:05:23,025 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:23,026 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:23,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:23,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1576068559, now seen corresponding path program 1 times [2019-11-24 06:05:23,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:23,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285347650] [2019-11-24 06:05:23,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:23,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:23,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285347650] [2019-11-24 06:05:23,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363926712] [2019-11-24 06:05:23,142 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:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:23,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-24 06:05:23,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:23,246 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:23,246 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:23,282 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:23,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:05:23,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [5] total 8 [2019-11-24 06:05:23,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625048979] [2019-11-24 06:05:23,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 06:05:23,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:23,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 06:05:23,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-24 06:05:23,285 INFO L87 Difference]: Start difference. First operand 1185 states and 1611 transitions. Second operand 5 states. [2019-11-24 06:05:23,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:23,368 INFO L93 Difference]: Finished difference Result 2234 states and 3033 transitions. [2019-11-24 06:05:23,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:23,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-11-24 06:05:23,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:23,376 INFO L225 Difference]: With dead ends: 2234 [2019-11-24 06:05:23,376 INFO L226 Difference]: Without dead ends: 1239 [2019-11-24 06:05:23,380 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-24 06:05:23,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2019-11-24 06:05:23,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1185. [2019-11-24 06:05:23,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-11-24 06:05:23,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1575 transitions. [2019-11-24 06:05:23,442 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1575 transitions. Word has length 57 [2019-11-24 06:05:23,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:23,443 INFO L462 AbstractCegarLoop]: Abstraction has 1185 states and 1575 transitions. [2019-11-24 06:05:23,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 06:05:23,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1575 transitions. [2019-11-24 06:05:23,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-24 06:05:23,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:23,446 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] [2019-11-24 06:05:23,649 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:23,649 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:23,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:23,649 INFO L82 PathProgramCache]: Analyzing trace with hash -435716848, now seen corresponding path program 1 times [2019-11-24 06:05:23,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:23,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76891011] [2019-11-24 06:05:23,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:23,695 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:23,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76891011] [2019-11-24 06:05:23,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:23,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:23,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139771955] [2019-11-24 06:05:23,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:23,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:23,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:23,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:23,697 INFO L87 Difference]: Start difference. First operand 1185 states and 1575 transitions. Second operand 3 states. [2019-11-24 06:05:23,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:23,769 INFO L93 Difference]: Finished difference Result 2187 states and 2905 transitions. [2019-11-24 06:05:23,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:23,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-24 06:05:23,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:23,775 INFO L225 Difference]: With dead ends: 2187 [2019-11-24 06:05:23,775 INFO L226 Difference]: Without dead ends: 1192 [2019-11-24 06:05:23,777 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:23,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2019-11-24 06:05:23,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1175. [2019-11-24 06:05:23,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1175 states. [2019-11-24 06:05:23,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1489 transitions. [2019-11-24 06:05:23,873 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1489 transitions. Word has length 57 [2019-11-24 06:05:23,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:23,875 INFO L462 AbstractCegarLoop]: Abstraction has 1175 states and 1489 transitions. [2019-11-24 06:05:23,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:23,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1489 transitions. [2019-11-24 06:05:23,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-24 06:05:23,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:23,877 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] [2019-11-24 06:05:23,878 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:23,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:23,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1661764445, now seen corresponding path program 1 times [2019-11-24 06:05:23,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:23,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183199513] [2019-11-24 06:05:23,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:23,946 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:23,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183199513] [2019-11-24 06:05:23,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572712472] [2019-11-24 06:05:23,947 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:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:24,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-24 06:05:24,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:24,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:24,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:24,091 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:24,091 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:24,124 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:24,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:05:24,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 4] imperfect sequences [5] total 11 [2019-11-24 06:05:24,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355509633] [2019-11-24 06:05:24,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 06:05:24,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:24,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 06:05:24,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-24 06:05:24,131 INFO L87 Difference]: Start difference. First operand 1175 states and 1489 transitions. Second operand 9 states. [2019-11-24 06:05:24,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:24,848 INFO L93 Difference]: Finished difference Result 2628 states and 3355 transitions. [2019-11-24 06:05:24,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-24 06:05:24,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-11-24 06:05:24,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:24,859 INFO L225 Difference]: With dead ends: 2628 [2019-11-24 06:05:24,860 INFO L226 Difference]: Without dead ends: 1648 [2019-11-24 06:05:24,863 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=240, Invalid=690, Unknown=0, NotChecked=0, Total=930 [2019-11-24 06:05:24,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2019-11-24 06:05:24,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1015. [2019-11-24 06:05:24,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-11-24 06:05:24,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1306 transitions. [2019-11-24 06:05:24,955 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1306 transitions. Word has length 58 [2019-11-24 06:05:24,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:24,955 INFO L462 AbstractCegarLoop]: Abstraction has 1015 states and 1306 transitions. [2019-11-24 06:05:24,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 06:05:24,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1306 transitions. [2019-11-24 06:05:24,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-24 06:05:24,962 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:24,962 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:25,176 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:25,176 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:25,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:25,177 INFO L82 PathProgramCache]: Analyzing trace with hash 828149154, now seen corresponding path program 1 times [2019-11-24 06:05:25,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:25,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326591951] [2019-11-24 06:05:25,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:25,295 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:25,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326591951] [2019-11-24 06:05:25,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:25,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:25,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262397511] [2019-11-24 06:05:25,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:25,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:25,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:25,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:25,299 INFO L87 Difference]: Start difference. First operand 1015 states and 1306 transitions. Second operand 4 states. [2019-11-24 06:05:25,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:25,450 INFO L93 Difference]: Finished difference Result 2170 states and 2801 transitions. [2019-11-24 06:05:25,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:25,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-24 06:05:25,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:25,459 INFO L225 Difference]: With dead ends: 2170 [2019-11-24 06:05:25,460 INFO L226 Difference]: Without dead ends: 1329 [2019-11-24 06:05:25,462 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:25,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2019-11-24 06:05:25,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1022. [2019-11-24 06:05:25,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1022 states. [2019-11-24 06:05:25,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1321 transitions. [2019-11-24 06:05:25,546 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1321 transitions. Word has length 59 [2019-11-24 06:05:25,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:25,546 INFO L462 AbstractCegarLoop]: Abstraction has 1022 states and 1321 transitions. [2019-11-24 06:05:25,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:25,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1321 transitions. [2019-11-24 06:05:25,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-24 06:05:25,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:25,559 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:25,559 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:25,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:25,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1005755077, now seen corresponding path program 1 times [2019-11-24 06:05:25,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:25,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575261829] [2019-11-24 06:05:25,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:25,604 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:25,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575261829] [2019-11-24 06:05:25,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:25,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:25,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413956264] [2019-11-24 06:05:25,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:25,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:25,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:25,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:25,607 INFO L87 Difference]: Start difference. First operand 1022 states and 1321 transitions. Second operand 3 states. [2019-11-24 06:05:25,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:25,715 INFO L93 Difference]: Finished difference Result 2371 states and 3084 transitions. [2019-11-24 06:05:25,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:25,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-24 06:05:25,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:25,722 INFO L225 Difference]: With dead ends: 2371 [2019-11-24 06:05:25,722 INFO L226 Difference]: Without dead ends: 1360 [2019-11-24 06:05:25,724 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:25,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2019-11-24 06:05:25,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1223. [2019-11-24 06:05:25,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-11-24 06:05:25,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1586 transitions. [2019-11-24 06:05:25,803 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1586 transitions. Word has length 59 [2019-11-24 06:05:25,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:25,804 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 1586 transitions. [2019-11-24 06:05:25,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:25,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1586 transitions. [2019-11-24 06:05:25,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-24 06:05:25,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:25,807 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:25,807 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:25,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:25,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1891214234, now seen corresponding path program 1 times [2019-11-24 06:05:25,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:25,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817958149] [2019-11-24 06:05:25,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:25,866 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:25,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817958149] [2019-11-24 06:05:25,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:25,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:25,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473604644] [2019-11-24 06:05:25,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:25,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:25,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:25,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:25,868 INFO L87 Difference]: Start difference. First operand 1223 states and 1586 transitions. Second operand 3 states. [2019-11-24 06:05:25,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:25,948 INFO L93 Difference]: Finished difference Result 1791 states and 2337 transitions. [2019-11-24 06:05:25,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:25,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-24 06:05:25,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:25,952 INFO L225 Difference]: With dead ends: 1791 [2019-11-24 06:05:25,952 INFO L226 Difference]: Without dead ends: 813 [2019-11-24 06:05:25,954 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:25,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2019-11-24 06:05:26,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 791. [2019-11-24 06:05:26,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2019-11-24 06:05:26,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 986 transitions. [2019-11-24 06:05:26,028 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 986 transitions. Word has length 60 [2019-11-24 06:05:26,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:26,029 INFO L462 AbstractCegarLoop]: Abstraction has 791 states and 986 transitions. [2019-11-24 06:05:26,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:26,029 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 986 transitions. [2019-11-24 06:05:26,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-24 06:05:26,031 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:26,031 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:26,031 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:26,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:26,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1115558533, now seen corresponding path program 1 times [2019-11-24 06:05:26,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:26,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060928001] [2019-11-24 06:05:26,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:26,089 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:05:26,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060928001] [2019-11-24 06:05:26,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:26,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:05:26,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275617747] [2019-11-24 06:05:26,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:26,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:26,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:26,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:26,091 INFO L87 Difference]: Start difference. First operand 791 states and 986 transitions. Second operand 3 states. [2019-11-24 06:05:26,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:26,163 INFO L93 Difference]: Finished difference Result 1329 states and 1660 transitions. [2019-11-24 06:05:26,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:26,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-24 06:05:26,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:26,167 INFO L225 Difference]: With dead ends: 1329 [2019-11-24 06:05:26,167 INFO L226 Difference]: Without dead ends: 791 [2019-11-24 06:05:26,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:26,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2019-11-24 06:05:26,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 791. [2019-11-24 06:05:26,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2019-11-24 06:05:26,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 970 transitions. [2019-11-24 06:05:26,222 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 970 transitions. Word has length 60 [2019-11-24 06:05:26,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:26,223 INFO L462 AbstractCegarLoop]: Abstraction has 791 states and 970 transitions. [2019-11-24 06:05:26,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:26,223 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 970 transitions. [2019-11-24 06:05:26,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-24 06:05:26,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:26,225 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] [2019-11-24 06:05:26,225 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:26,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:26,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1418414809, now seen corresponding path program 1 times [2019-11-24 06:05:26,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:26,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829698882] [2019-11-24 06:05:26,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:26,299 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:26,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829698882] [2019-11-24 06:05:26,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788170203] [2019-11-24 06:05:26,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:26,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-24 06:05:26,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:26,415 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:26,416 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:26,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:26,466 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:26,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-24 06:05:26,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 5] total 12 [2019-11-24 06:05:26,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156932419] [2019-11-24 06:05:26,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 06:05:26,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:26,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 06:05:26,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-11-24 06:05:26,468 INFO L87 Difference]: Start difference. First operand 791 states and 970 transitions. Second operand 6 states. [2019-11-24 06:05:26,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:26,613 INFO L93 Difference]: Finished difference Result 1842 states and 2229 transitions. [2019-11-24 06:05:26,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 06:05:26,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-11-24 06:05:26,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:26,617 INFO L225 Difference]: With dead ends: 1842 [2019-11-24 06:05:26,617 INFO L226 Difference]: Without dead ends: 854 [2019-11-24 06:05:26,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-11-24 06:05:26,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-11-24 06:05:26,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 755. [2019-11-24 06:05:26,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-11-24 06:05:26,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 887 transitions. [2019-11-24 06:05:26,664 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 887 transitions. Word has length 61 [2019-11-24 06:05:26,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:26,664 INFO L462 AbstractCegarLoop]: Abstraction has 755 states and 887 transitions. [2019-11-24 06:05:26,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 06:05:26,664 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 887 transitions. [2019-11-24 06:05:26,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-24 06:05:26,666 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:26,666 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:26,870 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:26,871 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:26,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:26,871 INFO L82 PathProgramCache]: Analyzing trace with hash -695276464, now seen corresponding path program 1 times [2019-11-24 06:05:26,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:26,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830826966] [2019-11-24 06:05:26,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:26,931 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:26,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830826966] [2019-11-24 06:05:26,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:26,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 06:05:26,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124099384] [2019-11-24 06:05:26,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 06:05:26,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:26,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 06:05:26,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:05:26,934 INFO L87 Difference]: Start difference. First operand 755 states and 887 transitions. Second operand 5 states. [2019-11-24 06:05:27,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:27,103 INFO L93 Difference]: Finished difference Result 1797 states and 2100 transitions. [2019-11-24 06:05:27,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 06:05:27,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-11-24 06:05:27,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:27,109 INFO L225 Difference]: With dead ends: 1797 [2019-11-24 06:05:27,109 INFO L226 Difference]: Without dead ends: 1201 [2019-11-24 06:05:27,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:05:27,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2019-11-24 06:05:27,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 909. [2019-11-24 06:05:27,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-11-24 06:05:27,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1057 transitions. [2019-11-24 06:05:27,212 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1057 transitions. Word has length 62 [2019-11-24 06:05:27,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:27,212 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1057 transitions. [2019-11-24 06:05:27,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 06:05:27,213 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1057 transitions. [2019-11-24 06:05:27,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-24 06:05:27,215 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:27,215 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:27,215 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:27,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:27,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1572410586, now seen corresponding path program 1 times [2019-11-24 06:05:27,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:27,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243968530] [2019-11-24 06:05:27,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:27,335 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:05:27,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243968530] [2019-11-24 06:05:27,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:27,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 06:05:27,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555621581] [2019-11-24 06:05:27,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 06:05:27,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:27,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 06:05:27,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:05:27,338 INFO L87 Difference]: Start difference. First operand 909 states and 1057 transitions. Second operand 5 states. [2019-11-24 06:05:27,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:27,522 INFO L93 Difference]: Finished difference Result 2761 states and 3223 transitions. [2019-11-24 06:05:27,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 06:05:27,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-11-24 06:05:27,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:27,533 INFO L225 Difference]: With dead ends: 2761 [2019-11-24 06:05:27,533 INFO L226 Difference]: Without dead ends: 2246 [2019-11-24 06:05:27,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:05:27,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2019-11-24 06:05:27,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 1372. [2019-11-24 06:05:27,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-11-24 06:05:27,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1604 transitions. [2019-11-24 06:05:27,641 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1604 transitions. Word has length 79 [2019-11-24 06:05:27,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:27,641 INFO L462 AbstractCegarLoop]: Abstraction has 1372 states and 1604 transitions. [2019-11-24 06:05:27,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 06:05:27,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1604 transitions. [2019-11-24 06:05:27,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-24 06:05:27,644 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:27,644 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2019-11-24 06:05:27,644 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:27,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:27,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1075955253, now seen corresponding path program 1 times [2019-11-24 06:05:27,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:27,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575498854] [2019-11-24 06:05:27,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:27,677 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-24 06:05:27,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575498854] [2019-11-24 06:05:27,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:27,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:27,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649545584] [2019-11-24 06:05:27,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:27,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:27,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:27,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:27,680 INFO L87 Difference]: Start difference. First operand 1372 states and 1604 transitions. Second operand 4 states. [2019-11-24 06:05:27,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:27,842 INFO L93 Difference]: Finished difference Result 3058 states and 3580 transitions. [2019-11-24 06:05:27,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:27,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-24 06:05:27,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:27,851 INFO L225 Difference]: With dead ends: 3058 [2019-11-24 06:05:27,851 INFO L226 Difference]: Without dead ends: 1744 [2019-11-24 06:05:27,853 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:27,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2019-11-24 06:05:27,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1336. [2019-11-24 06:05:27,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1336 states. [2019-11-24 06:05:27,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1550 transitions. [2019-11-24 06:05:27,987 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1550 transitions. Word has length 84 [2019-11-24 06:05:27,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:27,987 INFO L462 AbstractCegarLoop]: Abstraction has 1336 states and 1550 transitions. [2019-11-24 06:05:27,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:27,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1550 transitions. [2019-11-24 06:05:27,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-24 06:05:27,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:27,990 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:27,990 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:27,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:27,990 INFO L82 PathProgramCache]: Analyzing trace with hash 890157323, now seen corresponding path program 1 times [2019-11-24 06:05:27,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:27,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492034681] [2019-11-24 06:05:27,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:28,077 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-24 06:05:28,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492034681] [2019-11-24 06:05:28,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:28,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 06:05:28,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190730154] [2019-11-24 06:05:28,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 06:05:28,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:28,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 06:05:28,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:05:28,082 INFO L87 Difference]: Start difference. First operand 1336 states and 1550 transitions. Second operand 5 states. [2019-11-24 06:05:28,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:28,207 INFO L93 Difference]: Finished difference Result 1777 states and 2041 transitions. [2019-11-24 06:05:28,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 06:05:28,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-11-24 06:05:28,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:28,208 INFO L225 Difference]: With dead ends: 1777 [2019-11-24 06:05:28,208 INFO L226 Difference]: Without dead ends: 0 [2019-11-24 06:05:28,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:05:28,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-24 06:05:28,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-24 06:05:28,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-24 06:05:28,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-24 06:05:28,211 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2019-11-24 06:05:28,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:28,212 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-24 06:05:28,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 06:05:28,212 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-24 06:05:28,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-24 06:05:28,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-24 06:05:28,388 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 125 [2019-11-24 06:05:28,743 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 124 [2019-11-24 06:05:29,078 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 184 [2019-11-24 06:05:29,458 WARN L192 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 279 DAG size of output: 214 [2019-11-24 06:05:30,070 WARN L192 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 359 DAG size of output: 312 [2019-11-24 06:05:30,520 WARN L192 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 369 DAG size of output: 293 [2019-11-24 06:05:30,926 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-24 06:05:31,864 WARN L192 SmtUtils]: Spent 936.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 66 [2019-11-24 06:05:32,235 WARN L192 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-11-24 06:05:32,643 WARN L192 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-11-24 06:05:32,819 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-24 06:05:33,272 WARN L192 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 49 [2019-11-24 06:05:33,972 WARN L192 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 55 [2019-11-24 06:05:34,988 WARN L192 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 112 DAG size of output: 60 [2019-11-24 06:05:35,173 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-11-24 06:05:36,413 WARN L192 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 179 DAG size of output: 62 [2019-11-24 06:05:36,800 WARN L192 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-11-24 06:05:39,521 WARN L192 SmtUtils]: Spent 2.72 s on a formula simplification. DAG size of input: 197 DAG size of output: 82 [2019-11-24 06:05:39,908 WARN L192 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-11-24 06:05:40,398 WARN L192 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 50 [2019-11-24 06:05:40,851 WARN L192 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 49 [2019-11-24 06:05:41,050 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 40 [2019-11-24 06:05:41,313 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 41 [2019-11-24 06:05:44,556 WARN L192 SmtUtils]: Spent 3.20 s on a formula simplification. DAG size of input: 286 DAG size of output: 82 [2019-11-24 06:05:47,292 WARN L192 SmtUtils]: Spent 2.73 s on a formula simplification. DAG size of input: 261 DAG size of output: 87 [2019-11-24 06:05:47,456 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-11-24 06:05:47,893 WARN L192 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-11-24 06:05:48,068 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-24 06:05:48,176 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 37 [2019-11-24 06:05:48,563 WARN L192 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-11-24 06:05:48,741 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-24 06:05:48,916 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-24 06:05:49,449 WARN L192 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 52 [2019-11-24 06:05:49,703 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 47 [2019-11-24 06:05:49,708 INFO L440 ceAbstractionStarter]: At program point L205(lines 193 207) the Hoare annotation is: (and (<= ~m_pc~0 0) (<= 2 ~E_M~0) (= ~E_1~0 2) (<= ~t1_pc~0 0) (<= 2 ~E_2~0) (<= ~token~0 ~local~0) (= 0 ~t1_st~0) (<= ~local~0 ~token~0) (= 0 ~t2_pc~0) (= 0 ~t2_st~0)) [2019-11-24 06:05:49,708 INFO L440 ceAbstractionStarter]: At program point L205-1(lines 193 207) the Hoare annotation is: (let ((.cse2 (= 1 ~t1_pc~0)) (.cse15 (= 0 ~t2_st~0)) (.cse14 (= 0 ~t2_pc~0)) (.cse11 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse3 (= 1 ~t2_pc~0)) (.cse12 (<= ~t1_pc~0 0)) (.cse6 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse13 (= 0 ~t1_st~0)) (.cse8 (not (= ~m_st~0 0))) (.cse0 (<= 2 ~t2_st~0)) (.cse1 (<= 2 ~E_M~0)) (.cse4 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse5 (<= 2 ~E_2~0)) (.cse7 (<= ~token~0 ~local~0)) (.cse9 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse10 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_eval_~tmp~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse11 .cse12 .cse5 .cse7 .cse13 .cse8 .cse9 .cse10 .cse14 .cse15) (and .cse1 .cse2 .cse11 .cse5 .cse7 .cse8 .cse9 .cse10 .cse15 .cse14) (and .cse11 .cse3 .cse12 .cse6 .cse13 .cse8 .cse0 .cse1 .cse4 .cse5 .cse7 .cse9 .cse10))) [2019-11-24 06:05:49,709 INFO L440 ceAbstractionStarter]: At program point L205-2(lines 193 207) the Hoare annotation is: (let ((.cse9 (= ~m_pc~0 1)) (.cse3 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse7 (= 0 ~t2_st~0)) (.cse8 (= 0 ~t2_pc~0)) (.cse0 (<= ~m_pc~0 0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (= 1 ~t1_pc~0)) (.cse4 (= ~E_1~0 2)) (.cse10 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse11 (= 1 ~t2_pc~0)) (.cse5 (not (= ~m_st~0 0))) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (<= 2 ~t2_st~0) .cse1 .cse9 .cse2 .cse4 .cse10 .cse11 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2) (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0) .cse5 .cse6) (let ((.cse12 (+ ~local~0 1))) (and .cse1 .cse9 .cse2 .cse4 .cse10 (<= ~token~0 .cse12) .cse11 (<= .cse12 ~token~0) .cse5 .cse6)) (and .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse10 .cse11 .cse5 .cse6))) [2019-11-24 06:05:49,709 INFO L440 ceAbstractionStarter]: At program point L205-3(lines 193 207) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse1 (not (= 0 ~t2_st~0))) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (= ~E_1~0 2)) (.cse4 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse5 (= 1 ~t2_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse8 (<= 2 ~t1_st~0)) (.cse10 (not (= ~m_st~0 0))) (.cse11 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (let ((.cse9 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= .cse9 ~token~0) (<= ~token~0 .cse9))) (and (<= ~m_pc~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11))) [2019-11-24 06:05:49,710 INFO L440 ceAbstractionStarter]: At program point L205-4(lines 193 207) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse13 (<= 2 ~t1_st~0)) (.cse6 (<= 2 ~t2_st~0)) (.cse9 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse16 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse8 (= ~E_1~0 2)) (.cse2 (= 1 ~t2_pc~0)) (.cse10 (<= 2 ~E_2~0)) (.cse4 (not (= ~m_st~0 0))) (.cse11 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ULTIMATE.start_eval_~tmp~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~token~0 ~local~0) .cse11 (<= ~local~0 ~token~0)) (let ((.cse12 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse12) .cse13 .cse4 .cse5 .cse7 .cse8 .cse10 (<= .cse12 ~token~0) .cse14 .cse11)) (let ((.cse15 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 (<= .cse15 ~token~0) (<= ~token~0 .cse15))) (and .cse6 .cse16 .cse7 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse14 .cse13 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse11) (and .cse16 .cse7 .cse1 .cse8 .cse2 .cse10 .cse4 .cse11 .cse5))) [2019-11-24 06:05:49,710 INFO L444 ceAbstractionStarter]: For program point L40(lines 40 48) no Hoare annotation was computed. [2019-11-24 06:05:49,711 INFO L440 ceAbstractionStarter]: At program point L205-5(lines 193 207) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse13 (<= 2 ~t1_st~0)) (.cse6 (<= 2 ~t2_st~0)) (.cse9 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse15 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse8 (= ~E_1~0 2)) (.cse2 (= 1 ~t2_pc~0)) (.cse10 (<= 2 ~E_2~0)) (.cse4 (not (= ~m_st~0 0))) (.cse11 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ULTIMATE.start_eval_~tmp~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~token~0 ~local~0) .cse11 (<= ~local~0 ~token~0)) (let ((.cse12 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse12) .cse2 .cse13 .cse4 .cse5 .cse7 .cse8 .cse10 (<= .cse12 ~token~0) .cse14 .cse11)) (and .cse15 .cse6 .cse7 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse14 .cse13 .cse5) (let ((.cse16 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 (<= .cse16 ~token~0) (<= ~token~0 .cse16))) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse11) (and .cse15 .cse7 .cse1 .cse8 .cse2 .cse10 .cse4 .cse11 .cse5))) [2019-11-24 06:05:49,711 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 184) no Hoare annotation was computed. [2019-11-24 06:05:49,711 INFO L444 ceAbstractionStarter]: For program point L175-2(lines 175 184) no Hoare annotation was computed. [2019-11-24 06:05:49,711 INFO L444 ceAbstractionStarter]: For program point L175-3(lines 175 184) no Hoare annotation was computed. [2019-11-24 06:05:49,711 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2019-11-24 06:05:49,711 INFO L444 ceAbstractionStarter]: For program point L175-5(lines 175 184) no Hoare annotation was computed. [2019-11-24 06:05:49,711 INFO L444 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2019-11-24 06:05:49,711 INFO L444 ceAbstractionStarter]: For program point L175-6(lines 175 184) no Hoare annotation was computed. [2019-11-24 06:05:49,712 INFO L444 ceAbstractionStarter]: For program point L175-8(lines 175 184) no Hoare annotation was computed. [2019-11-24 06:05:49,712 INFO L444 ceAbstractionStarter]: For program point L175-9(lines 175 184) no Hoare annotation was computed. [2019-11-24 06:05:49,712 INFO L444 ceAbstractionStarter]: For program point L175-11(lines 175 184) no Hoare annotation was computed. [2019-11-24 06:05:49,712 INFO L444 ceAbstractionStarter]: For program point L175-12(lines 175 184) no Hoare annotation was computed. [2019-11-24 06:05:49,712 INFO L444 ceAbstractionStarter]: For program point L175-14(lines 175 184) no Hoare annotation was computed. [2019-11-24 06:05:49,712 INFO L444 ceAbstractionStarter]: For program point L175-15(lines 175 184) no Hoare annotation was computed. [2019-11-24 06:05:49,712 INFO L444 ceAbstractionStarter]: For program point L175-17(lines 175 184) no Hoare annotation was computed. [2019-11-24 06:05:49,712 INFO L444 ceAbstractionStarter]: For program point L176(lines 176 181) no Hoare annotation was computed. [2019-11-24 06:05:49,712 INFO L444 ceAbstractionStarter]: For program point L176-1(lines 176 181) no Hoare annotation was computed. [2019-11-24 06:05:49,713 INFO L444 ceAbstractionStarter]: For program point L176-2(lines 176 181) no Hoare annotation was computed. [2019-11-24 06:05:49,713 INFO L444 ceAbstractionStarter]: For program point L176-3(lines 176 181) no Hoare annotation was computed. [2019-11-24 06:05:49,713 INFO L440 ceAbstractionStarter]: At program point L44(lines 39 78) the Hoare annotation is: (let ((.cse0 (+ ~local~0 2))) (and (= ~m_pc~0 1) (= 1 ~t1_pc~0) (= 1 ~t2_pc~0) (<= 2 ~t1_st~0) (not (= ~m_st~0 0)) (<= 2 ~t2_st~0) (<= 2 ~E_M~0) (= ~E_1~0 2) (not (= ULTIMATE.start_eval_~tmp~0 0)) (<= 2 ~E_2~0) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= .cse0 ~token~0) (<= ~token~0 .cse0))) [2019-11-24 06:05:49,713 INFO L444 ceAbstractionStarter]: For program point L176-4(lines 176 181) no Hoare annotation was computed. [2019-11-24 06:05:49,713 INFO L444 ceAbstractionStarter]: For program point L176-5(lines 176 181) no Hoare annotation was computed. [2019-11-24 06:05:49,714 INFO L440 ceAbstractionStarter]: At program point L309(lines 271 323) the Hoare annotation is: (let ((.cse25 (+ ~local~0 1)) (.cse7 (= 0 ~t2_st~0))) (let ((.cse0 (<= ~m_pc~0 0)) (.cse3 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse11 (<= ~t1_pc~0 0)) (.cse23 (<= 2 ~m_st~0)) (.cse13 (= 0 ~t1_st~0)) (.cse8 (= 0 ~t2_pc~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse16 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse14 (<= ~local~0 ~token~0)) (.cse9 (<= 2 ~t2_st~0)) (.cse18 (not .cse7)) (.cse22 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (<= 2 ~E_M~0)) (.cse17 (= ~m_pc~0 1)) (.cse2 (= 1 ~t1_pc~0)) (.cse4 (= ~E_1~0 2)) (.cse19 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse20 (<= ~token~0 .cse25)) (.cse10 (= 1 ~t2_pc~0)) (.cse5 (<= 2 ~E_2~0)) (.cse21 (<= .cse25 ~token~0)) (.cse6 (<= 2 ~t1_st~0)) (.cse15 (not (= ~m_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse10 .cse11 .cse5 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse4 .cse10 .cse5 .cse15 .cse16) (and .cse1 .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse16 .cse7 .cse8) (and .cse9 .cse1 .cse17 .cse18 .cse2 .cse4 .cse10 .cse5 .cse12 .cse15 .cse14) (and .cse0 .cse1 .cse4 .cse11 .cse5 .cse13 .cse15 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse19 .cse10 .cse5 .cse15) (and .cse0 .cse1 .cse18 .cse2 .cse4 .cse10 .cse5 .cse15) (and .cse1 .cse17 .cse18 .cse2 .cse4 .cse20 .cse10 .cse5 .cse21 .cse6 .cse15) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse10 .cse11 .cse5 .cse13 .cse15) (and .cse0 .cse1 .cse4 .cse11 .cse5 .cse12 .cse13 .cse14 .cse7 .cse8) (and .cse1 .cse17 .cse2 .cse4 .cse20 .cse10 .cse5 .cse21 .cse22 .cse6 .cse15 .cse16) (and .cse17 .cse2 .cse3 .cse13 .cse15 .cse7 .cse8 .cse1 .cse4 .cse5 .cse12 .cse16 .cse14) (and .cse9 .cse0 .cse1 .cse18 .cse2 .cse4 .cse10 .cse5 .cse6) (and .cse1 .cse17 .cse2 .cse3 .cse4 .cse5 .cse23 .cse12 .cse16 .cse14 .cse7 .cse8) (and .cse9 .cse1 .cse17 .cse18 .cse2 .cse4 .cse10 .cse5 .cse6 .cse15) (and .cse17 .cse3 .cse10 .cse11 .cse23 .cse13 .cse9 .cse1 .cse4 .cse5 .cse12 .cse16 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse7 .cse8) (and .cse17 .cse3 .cse11 .cse23 .cse13 .cse8 .cse7 .cse1 .cse4 .cse5 .cse12 .cse16 .cse14) (let ((.cse24 (+ ~local~0 2))) (and .cse9 .cse1 .cse17 .cse18 .cse2 .cse4 .cse10 .cse5 .cse22 .cse6 (<= .cse24 ~token~0) (<= ~token~0 .cse24))) (and .cse1 .cse17 .cse2 .cse4 .cse19 .cse20 .cse10 .cse5 .cse21 .cse6 .cse15)))) [2019-11-24 06:05:49,714 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2019-11-24 06:05:49,714 INFO L444 ceAbstractionStarter]: For program point L276-1(lines 271 323) no Hoare annotation was computed. [2019-11-24 06:05:49,714 INFO L444 ceAbstractionStarter]: For program point L575(lines 575 579) no Hoare annotation was computed. [2019-11-24 06:05:49,714 INFO L440 ceAbstractionStarter]: At program point L543-1(lines 368 580) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse15 (<= 2 ~t1_st~0)) (.cse6 (<= 2 ~t2_st~0)) (.cse9 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse16 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse11 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse17 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse8 (= ~E_1~0 2)) (.cse2 (= 1 ~t2_pc~0)) (.cse10 (<= 2 ~E_2~0)) (.cse4 (not (= ~m_st~0 0))) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ULTIMATE.start_eval_~tmp~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (let ((.cse14 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse14) .cse2 .cse15 .cse4 .cse5 .cse7 .cse8 .cse10 (<= .cse14 ~token~0) .cse16 .cse12)) (and .cse17 .cse6 .cse7 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse16 .cse15 .cse5) (let ((.cse18 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 (<= .cse18 ~token~0) (<= ~token~0 .cse18))) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse12) (and .cse7 .cse17 .cse8 (<= ~t1_pc~0 0) .cse10 .cse11 (= 0 ~t1_st~0) .cse13 (= 0 ~t2_pc~0) (= 0 ~t2_st~0)) (and .cse17 .cse7 .cse1 .cse8 .cse2 .cse10 .cse4 .cse12 .cse5))) [2019-11-24 06:05:49,715 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 319) no Hoare annotation was computed. [2019-11-24 06:05:49,715 INFO L440 ceAbstractionStarter]: At program point L281(lines 271 323) the Hoare annotation is: (let ((.cse25 (+ ~local~0 1)) (.cse7 (= 0 ~t2_st~0))) (let ((.cse11 (not .cse7)) (.cse19 (<= ~token~0 .cse25)) (.cse20 (<= .cse25 ~token~0)) (.cse21 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (<= 2 ~t2_st~0)) (.cse12 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse13 (= 1 ~t2_pc~0)) (.cse6 (<= 2 ~t1_st~0)) (.cse24 (<= 2 ~m_st~0)) (.cse0 (<= ~m_pc~0 0)) (.cse15 (<= ~t1_pc~0 0)) (.cse10 (= ~m_pc~0 1)) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse17 (= 0 ~t1_st~0)) (.cse14 (not (= ~m_st~0 0))) (.cse8 (= 0 ~t2_pc~0)) (.cse1 (<= 2 ~E_M~0)) (.cse4 (= ~E_1~0 2)) (.cse5 (<= 2 ~E_2~0)) (.cse16 (<= ~token~0 ~local~0)) (.cse23 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse18 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse1 .cse10 .cse2 .cse4 .cse11 .cse12 .cse13 .cse5 .cse6 .cse14) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse13 .cse15 .cse5 .cse16 .cse17 .cse18) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse13 .cse19 .cse5 .cse20 .cse6 .cse14) (and .cse9 .cse1 .cse10 .cse2 .cse4 .cse11 .cse12 .cse13 .cse5 .cse16 .cse14 .cse18) (let ((.cse22 (+ ~local~0 2))) (and .cse9 .cse1 .cse10 .cse2 .cse4 .cse12 .cse13 .cse5 .cse21 .cse6 (<= .cse22 ~token~0) (<= ~token~0 .cse22))) (and .cse0 .cse1 .cse3 .cse4 .cse15 .cse5 .cse16 .cse17 .cse18 .cse8 .cse7) (and .cse10 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse23 .cse8 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse13 .cse5 .cse14) (and .cse10 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse16 .cse23 .cse18 .cse8 .cse7) (and .cse1 .cse10 .cse2 .cse4 .cse11 .cse12 .cse19 .cse13 .cse5 .cse20 .cse6 .cse14) (and .cse1 .cse10 .cse2 .cse4 .cse12 .cse13 .cse19 .cse5 .cse20 .cse21 .cse6 .cse14) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse13 .cse15 .cse5 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse14 .cse8 .cse7) (and .cse10 .cse3 .cse13 .cse15 .cse24 .cse17 .cse9 .cse1 .cse4 .cse5 .cse16 .cse23 .cse18) (and .cse9 .cse0 .cse1 .cse2 .cse4 .cse12 .cse13 .cse5 .cse6) (and .cse10 .cse3 .cse15 .cse24 .cse17 .cse8 .cse7 .cse1 .cse4 .cse5 .cse16 .cse23 .cse18) (and .cse0 .cse1 .cse3 .cse4 .cse15 .cse5 .cse17 .cse14 .cse8 .cse7) (and .cse10 .cse2 .cse3 .cse17 .cse14 .cse8 .cse7 .cse1 .cse4 .cse5 .cse16 .cse23 .cse18)))) [2019-11-24 06:05:49,715 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 92) no Hoare annotation was computed. [2019-11-24 06:05:49,715 INFO L447 ceAbstractionStarter]: At program point L581(lines 528 586) the Hoare annotation is: true [2019-11-24 06:05:49,715 INFO L447 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-24 06:05:49,715 INFO L444 ceAbstractionStarter]: For program point L284(lines 284 291) no Hoare annotation was computed. [2019-11-24 06:05:49,716 INFO L440 ceAbstractionStarter]: At program point L186(lines 174 188) the Hoare annotation is: (and (<= ~m_pc~0 0) (<= 2 ~E_M~0) (= ~E_1~0 2) (<= ~t1_pc~0 0) (<= 2 ~E_2~0) (<= ~token~0 ~local~0) (= 0 ~t1_st~0) (<= ~local~0 ~token~0) (= 0 ~t2_pc~0) (= 0 ~t2_st~0)) [2019-11-24 06:05:49,716 INFO L440 ceAbstractionStarter]: At program point L186-1(lines 174 188) the Hoare annotation is: (let ((.cse0 (<= 2 ~t2_st~0)) (.cse3 (= 1 ~t2_pc~0)) (.cse11 (<= ~t1_pc~0 0)) (.cse12 (= 0 ~t1_st~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (= 1 ~t1_pc~0)) (.cse10 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse4 (<= 2 ~E_2~0)) (.cse5 (<= ~token~0 ~local~0)) (.cse6 (<= 2 ~t1_st~0)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse9 (<= ~local~0 ~token~0)) (.cse14 (= 0 ~t2_st~0)) (.cse13 (= 0 ~t2_pc~0))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_eval_~tmp~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse8 .cse9) (and .cse1 .cse10 .cse11 .cse4 .cse5 .cse12 .cse7 .cse8 .cse9 .cse13 .cse14) (and .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse13))) [2019-11-24 06:05:49,716 INFO L440 ceAbstractionStarter]: At program point L186-2(lines 174 188) the Hoare annotation is: (let ((.cse1 (= ~m_pc~0 1)) (.cse11 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse7 (not (= 0 ~t1_st~0))) (.cse12 (= 0 ~t2_st~0)) (.cse13 (= 0 ~t2_pc~0)) (.cse10 (<= ~m_pc~0 0)) (.cse0 (<= 2 ~E_M~0)) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (= ~E_1~0 2)) (.cse4 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse6 (= 1 ~t2_pc~0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (let ((.cse5 (+ ~local~0 1))) (and (<= 2 ~t2_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse5) .cse6 .cse7 (<= .cse5 ~token~0) .cse8 .cse9)) (and .cse10 .cse0 .cse2 .cse11 .cse3 .cse8 .cse9 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse7 .cse8 .cse9 .cse12 .cse13) (and .cse10 .cse0 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9))) [2019-11-24 06:05:49,716 INFO L444 ceAbstractionStarter]: For program point L120(lines 120 128) no Hoare annotation was computed. [2019-11-24 06:05:49,717 INFO L440 ceAbstractionStarter]: At program point L87(lines 87 91) the Hoare annotation is: (let ((.cse10 (= 1 ~t1_pc~0)) (.cse18 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse9 (= ~m_pc~0 1)) (.cse14 (<= 2 ~m_st~0)) (.cse7 (= 0 ~t2_pc~0)) (.cse8 (= 0 ~t2_st~0)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (not (= ~m_st~0 0))) (.cse15 (<= 2 ~t2_st~0)) (.cse0 (<= ~m_pc~0 0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse3 (= ~E_1~0 2)) (.cse13 (= 1 ~t2_pc~0)) (.cse4 (<= ~t1_pc~0 0)) (.cse11 (not (= 0 ~t1_st~0))) (.cse5 (<= 2 ~E_2~0)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse2 .cse10 .cse3 .cse11 .cse5 .cse6 .cse12 .cse8 .cse7) (and .cse9 .cse2 .cse13 .cse4 .cse11 .cse14 .cse15 .cse1 .cse3 .cse5 .cse16 .cse12 .cse17) (and .cse0 .cse1 .cse10 .cse2 .cse3 .cse5 .cse6 .cse8 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse16 .cse17 .cse7 .cse8) (and .cse0 .cse1 .cse10 .cse3 .cse18 .cse13 .cse5 .cse6) (and .cse15 .cse1 .cse9 .cse10 .cse3 .cse18 .cse13 .cse5 .cse11 .cse16 .cse6 .cse17) (and .cse9 .cse2 .cse4 .cse11 .cse14 .cse7 .cse8 .cse1 .cse3 .cse5 .cse16 .cse12 .cse17) (and .cse15 .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6) (and .cse15 .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse11 .cse5 .cse16 .cse17))) [2019-11-24 06:05:49,717 INFO L440 ceAbstractionStarter]: At program point L186-3(lines 174 188) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse1 (not (= 0 ~t2_st~0))) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (= ~E_1~0 2)) (.cse4 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse5 (= 1 ~t2_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse8 (<= 2 ~t1_st~0)) (.cse10 (not (= ~m_st~0 0))) (.cse11 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (let ((.cse9 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= .cse9 ~token~0) (<= ~token~0 .cse9))) (and (<= ~m_pc~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11))) [2019-11-24 06:05:49,717 INFO L440 ceAbstractionStarter]: At program point L186-4(lines 174 188) the Hoare annotation is: (let ((.cse0 (<= 2 ~t2_st~0)) (.cse2 (= ~m_pc~0 1)) (.cse7 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse8 (<= 2 ~t1_st~0)) (.cse13 (<= ~m_pc~0 0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= 1 ~t1_pc~0)) (.cse4 (= ~E_1~0 2)) (.cse5 (= 1 ~t2_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse9 (not (= ~m_st~0 0))) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (= ULTIMATE.start_eval_~tmp~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse12 (+ ~local~0 1))) (and .cse2 .cse3 .cse5 (<= ~token~0 .cse12) .cse8 .cse9 .cse11 .cse1 .cse4 .cse6 (<= .cse12 ~token~0) .cse7 .cse10)) (and .cse0 .cse13 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse9 .cse10 .cse11) (let ((.cse14 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= .cse14 ~token~0) .cse11 (<= ~token~0 .cse14))) (and .cse13 .cse1 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11))) [2019-11-24 06:05:49,718 INFO L440 ceAbstractionStarter]: At program point L186-5(lines 174 188) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse13 (<= 2 ~t1_st~0)) (.cse6 (<= 2 ~t2_st~0)) (.cse9 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse15 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse8 (= ~E_1~0 2)) (.cse2 (= 1 ~t2_pc~0)) (.cse10 (<= 2 ~E_2~0)) (.cse4 (not (= ~m_st~0 0))) (.cse11 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ULTIMATE.start_eval_~tmp~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~token~0 ~local~0) .cse11 (<= ~local~0 ~token~0)) (let ((.cse12 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse12) .cse2 .cse13 .cse4 .cse5 .cse7 .cse8 .cse10 (<= .cse12 ~token~0) .cse14 .cse11)) (and .cse15 .cse6 .cse7 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse14 .cse13 .cse5) (let ((.cse16 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 (<= .cse16 ~token~0) (<= ~token~0 .cse16))) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse11) (and .cse15 .cse7 .cse1 .cse8 .cse2 .cse10 .cse4 .cse11 .cse5))) [2019-11-24 06:05:49,718 INFO L444 ceAbstractionStarter]: For program point L156(lines 156 165) no Hoare annotation was computed. [2019-11-24 06:05:49,718 INFO L440 ceAbstractionStarter]: At program point L123(lines 123 127) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_M~0)) (.cse1 (not (= 0 ~t2_st~0))) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (= ~E_1~0 2)) (.cse4 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse5 (= 1 ~t2_pc~0)) (.cse6 (<= 2 ~E_2~0))) (or (and (<= ~m_pc~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_st~0 0))) (let ((.cse7 (+ ~local~0 1))) (and .cse0 (= ~m_pc~0 1) .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse7) .cse5 .cse6 (<= .cse7 ~token~0) (<= 2 ~t1_st~0))))) [2019-11-24 06:05:49,718 INFO L444 ceAbstractionStarter]: For program point L156-2(lines 156 165) no Hoare annotation was computed. [2019-11-24 06:05:49,718 INFO L444 ceAbstractionStarter]: For program point L156-3(lines 156 165) no Hoare annotation was computed. [2019-11-24 06:05:49,718 INFO L444 ceAbstractionStarter]: For program point L156-5(lines 156 165) no Hoare annotation was computed. [2019-11-24 06:05:49,718 INFO L444 ceAbstractionStarter]: For program point L156-6(lines 156 165) no Hoare annotation was computed. [2019-11-24 06:05:49,718 INFO L444 ceAbstractionStarter]: For program point L156-8(lines 156 165) no Hoare annotation was computed. [2019-11-24 06:05:49,719 INFO L444 ceAbstractionStarter]: For program point L156-9(lines 156 165) no Hoare annotation was computed. [2019-11-24 06:05:49,719 INFO L444 ceAbstractionStarter]: For program point L156-11(lines 156 165) no Hoare annotation was computed. [2019-11-24 06:05:49,719 INFO L444 ceAbstractionStarter]: For program point L156-12(lines 156 165) no Hoare annotation was computed. [2019-11-24 06:05:49,719 INFO L444 ceAbstractionStarter]: For program point L156-14(lines 156 165) no Hoare annotation was computed. [2019-11-24 06:05:49,719 INFO L444 ceAbstractionStarter]: For program point L156-15(lines 156 165) no Hoare annotation was computed. [2019-11-24 06:05:49,719 INFO L444 ceAbstractionStarter]: For program point L156-17(lines 156 165) no Hoare annotation was computed. [2019-11-24 06:05:49,719 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-24 06:05:49,719 INFO L444 ceAbstractionStarter]: For program point L157(lines 157 162) no Hoare annotation was computed. [2019-11-24 06:05:49,719 INFO L444 ceAbstractionStarter]: For program point L157-1(lines 157 162) no Hoare annotation was computed. [2019-11-24 06:05:49,719 INFO L444 ceAbstractionStarter]: For program point L157-2(lines 157 162) no Hoare annotation was computed. [2019-11-24 06:05:49,720 INFO L444 ceAbstractionStarter]: For program point L157-3(lines 157 162) no Hoare annotation was computed. [2019-11-24 06:05:49,720 INFO L444 ceAbstractionStarter]: For program point L157-4(lines 157 162) no Hoare annotation was computed. [2019-11-24 06:05:49,720 INFO L444 ceAbstractionStarter]: For program point L157-5(lines 157 162) no Hoare annotation was computed. [2019-11-24 06:05:49,720 INFO L440 ceAbstractionStarter]: At program point L324(lines 265 329) the Hoare annotation is: (let ((.cse10 (<= ~m_pc~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse0 (<= 2 ~t2_st~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (= ~m_pc~0 1)) (.cse3 (= 1 ~t1_pc~0)) (.cse4 (= ~E_1~0 2)) (.cse5 (= 1 ~t2_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse9 (= ULTIMATE.start_eval_~tmp~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9) (let ((.cse11 (+ ~local~0 1))) (and .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse11) .cse5 .cse6 (<= .cse11 ~token~0) .cse7 .cse8 .cse9)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~token~0 ~local~0) .cse8 (<= ~local~0 ~token~0) .cse9) (let ((.cse12 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse7 (<= .cse12 ~token~0) .cse9 (<= ~token~0 .cse12))))) [2019-11-24 06:05:49,720 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 203) no Hoare annotation was computed. [2019-11-24 06:05:49,720 INFO L444 ceAbstractionStarter]: For program point L194-2(lines 194 203) no Hoare annotation was computed. [2019-11-24 06:05:49,720 INFO L444 ceAbstractionStarter]: For program point L194-3(lines 194 203) no Hoare annotation was computed. [2019-11-24 06:05:49,721 INFO L440 ceAbstractionStarter]: At program point L95-1(lines 83 114) the Hoare annotation is: (let ((.cse12 (<= ~m_pc~0 0)) (.cse2 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse14 (not (= ~m_st~0 0))) (.cse10 (= 0 ~t2_st~0)) (.cse11 (= 0 ~t2_pc~0)) (.cse17 (<= 2 ~t2_st~0)) (.cse1 (<= 2 ~E_M~0)) (.cse0 (= ~m_pc~0 1)) (.cse3 (= ~E_1~0 2)) (.cse13 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse15 (= 1 ~t2_pc~0)) (.cse5 (<= 2 ~E_2~0)) (.cse4 (not (= 0 ~t1_st~0))) (.cse7 (<= ~token~0 ~local~0)) (.cse6 (<= 2 ~m_st~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse12 .cse2 .cse3 .cse13 .cse5 .cse14 .cse10 .cse11) (and .cse1 .cse12 .cse3 .cse13 .cse15 .cse5 .cse14 .cse8) (let ((.cse16 (+ ~local~0 1))) (and .cse1 .cse0 .cse3 .cse13 (<= ~token~0 .cse16) .cse15 .cse5 (<= .cse16 ~token~0) .cse14 .cse8)) (and .cse17 .cse1 .cse12 .cse3 .cse13 .cse15 .cse5 .cse14) (and .cse17 .cse1 .cse12 .cse3 .cse13 .cse15 .cse4 .cse5) (and .cse1 .cse12 .cse2 .cse3 .cse13 .cse4 .cse5 .cse10 .cse11) (and .cse17 .cse1 .cse0 .cse3 .cse13 .cse15 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2) .cse5 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0) .cse14 .cse8) (and .cse1 .cse0 (= 1 ~t1_pc~0) .cse2 .cse3 .cse5 .cse14 .cse8 .cse10 .cse11) (and .cse17 .cse1 .cse0 .cse3 .cse13 .cse15 .cse5 .cse4 .cse7 .cse6 .cse9 .cse8))) [2019-11-24 06:05:49,721 INFO L444 ceAbstractionStarter]: For program point L194-5(lines 194 203) no Hoare annotation was computed. [2019-11-24 06:05:49,721 INFO L444 ceAbstractionStarter]: For program point L194-6(lines 194 203) no Hoare annotation was computed. [2019-11-24 06:05:49,721 INFO L444 ceAbstractionStarter]: For program point L194-8(lines 194 203) no Hoare annotation was computed. [2019-11-24 06:05:49,721 INFO L444 ceAbstractionStarter]: For program point L194-9(lines 194 203) no Hoare annotation was computed. [2019-11-24 06:05:49,721 INFO L444 ceAbstractionStarter]: For program point L194-11(lines 194 203) no Hoare annotation was computed. [2019-11-24 06:05:49,721 INFO L444 ceAbstractionStarter]: For program point L194-12(lines 194 203) no Hoare annotation was computed. [2019-11-24 06:05:49,721 INFO L444 ceAbstractionStarter]: For program point L194-14(lines 194 203) no Hoare annotation was computed. [2019-11-24 06:05:49,721 INFO L444 ceAbstractionStarter]: For program point L194-15(lines 194 203) no Hoare annotation was computed. [2019-11-24 06:05:49,722 INFO L444 ceAbstractionStarter]: For program point L194-17(lines 194 203) no Hoare annotation was computed. [2019-11-24 06:05:49,722 INFO L444 ceAbstractionStarter]: For program point L195(lines 195 200) no Hoare annotation was computed. [2019-11-24 06:05:49,722 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 195 200) no Hoare annotation was computed. [2019-11-24 06:05:49,722 INFO L444 ceAbstractionStarter]: For program point L195-2(lines 195 200) no Hoare annotation was computed. [2019-11-24 06:05:49,722 INFO L444 ceAbstractionStarter]: For program point L195-3(lines 195 200) no Hoare annotation was computed. [2019-11-24 06:05:49,722 INFO L444 ceAbstractionStarter]: For program point L195-4(lines 195 200) no Hoare annotation was computed. [2019-11-24 06:05:49,722 INFO L444 ceAbstractionStarter]: For program point L195-5(lines 195 200) no Hoare annotation was computed. [2019-11-24 06:05:49,722 INFO L440 ceAbstractionStarter]: At program point L295(lines 271 323) the Hoare annotation is: (let ((.cse2 (<= 2 ~t2_st~0)) (.cse20 (<= 2 ~m_st~0)) (.cse18 (<= ~token~0 ~local~0)) (.cse13 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse19 (<= ~local~0 ~token~0)) (.cse0 (<= ~m_pc~0 0)) (.cse3 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse6 (<= ~t1_pc~0 0)) (.cse8 (= 0 ~t1_st~0)) (.cse15 (= 0 ~t2_pc~0)) (.cse14 (= 0 ~t2_st~0)) (.cse1 (<= 2 ~E_M~0)) (.cse10 (= ~m_pc~0 1)) (.cse11 (= 1 ~t1_pc~0)) (.cse4 (= ~E_1~0 2)) (.cse16 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse5 (= 1 ~t2_pc~0)) (.cse7 (<= 2 ~E_2~0)) (.cse12 (<= 2 ~t1_st~0)) (.cse9 (not (= ~m_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse10 .cse11 .cse3 .cse4 .cse7 .cse12 .cse9 .cse13 .cse14 .cse15) (let ((.cse17 (+ ~local~0 2))) (and .cse2 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse12 (<= .cse17 ~token~0) (<= ~token~0 .cse17))) (and .cse0 .cse1 .cse11 .cse3 .cse4 .cse16 .cse7 .cse12 .cse14 .cse15) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse18 .cse8 .cse19 .cse15 .cse14) (and .cse0 .cse1 .cse11 .cse4 .cse16 .cse5 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse19) (and .cse10 .cse11 .cse3 .cse8 .cse9 .cse14 .cse15 .cse1 .cse4 .cse7 .cse18 .cse13 .cse19) (and .cse1 .cse10 .cse11 .cse3 .cse4 .cse7 .cse20 .cse18 .cse13 .cse19 .cse14 .cse15) (and .cse2 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse18 .cse9 .cse19) (and .cse10 .cse3 .cse5 .cse6 .cse20 .cse8 .cse2 .cse1 .cse4 .cse7 .cse18 .cse13 .cse19) (and .cse2 .cse0 .cse1 .cse11 .cse4 .cse16 .cse5 .cse7 .cse12) (and .cse2 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse12 .cse9) (and .cse10 .cse3 .cse6 .cse20 .cse8 .cse15 .cse14 .cse1 .cse4 .cse7 .cse18 .cse13 .cse19) (and .cse0 .cse1 .cse11 .cse3 .cse4 .cse16 .cse7 .cse9 .cse14 .cse15) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse15 .cse14) (let ((.cse21 (+ ~local~0 1))) (and .cse1 .cse10 .cse11 .cse4 .cse16 (<= ~token~0 .cse21) .cse5 .cse7 (<= .cse21 ~token~0) .cse12 .cse9)))) [2019-11-24 06:05:49,723 INFO L440 ceAbstractionStarter]: At program point L131-1(lines 119 150) the Hoare annotation is: (let ((.cse6 (<= 2 ~t1_st~0)) (.cse1 (= ~m_pc~0 1)) (.cse2 (= 1 ~t1_pc~0)) (.cse4 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse17 (<= 2 ~m_st~0)) (.cse9 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~E_M~0)) (.cse10 (<= ~m_pc~0 0)) (.cse15 (not (= 0 ~t2_st~0))) (.cse3 (= ~E_1~0 2)) (.cse14 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse16 (<= ~t1_pc~0 0)) (.cse5 (<= 2 ~E_2~0)) (.cse12 (= 0 ~t1_st~0)) (.cse8 (not (= ~m_st~0 0)))) (or (let ((.cse7 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse6 (<= .cse7 ~token~0) (<= ~token~0 .cse7))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5 .cse8) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse12 .cse8 .cse9 .cse13) (and .cse1 .cse0 .cse14 .cse15 .cse3 .cse16 .cse5 .cse17 .cse11 .cse12 .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse11 .cse17 .cse9 .cse13) (and .cse0 .cse10 .cse15 .cse3 .cse14 .cse16 .cse5 .cse11 .cse12 .cse13) (and .cse0 .cse10 .cse15 .cse3 .cse14 .cse16 .cse5 .cse12 .cse8))) [2019-11-24 06:05:49,723 INFO L440 ceAbstractionStarter]: At program point L65(lines 39 78) the Hoare annotation is: (let ((.cse12 (= 1 ~t1_pc~0)) (.cse5 (= 1 ~t2_pc~0)) (.cse14 (<= 2 ~t1_st~0)) (.cse0 (<= 2 ~t2_st~0)) (.cse13 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse1 (<= ~m_pc~0 0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse4 (= ~E_1~0 2)) (.cse6 (<= ~t1_pc~0 0)) (.cse7 (<= 2 ~E_2~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse9 (= 0 ~t1_st~0)) (.cse10 (not (= ~m_st~0 0))) (.cse11 (<= ~local~0 ~token~0)) (.cse16 (= 0 ~t2_pc~0)) (.cse15 (= 0 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse13 .cse5 .cse7 .cse14 .cse10) (and .cse1 .cse2 .cse12 .cse3 .cse4 .cse7 .cse14 .cse10 .cse15 .cse16) (let ((.cse17 (+ ~local~0 2))) (and (= ~m_pc~0 1) .cse12 .cse5 .cse14 .cse10 .cse0 .cse2 .cse4 .cse13 .cse7 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= .cse17 ~token~0) (<= ~token~0 .cse17))) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse16 .cse15))) [2019-11-24 06:05:49,723 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-24 06:05:49,724 INFO L440 ceAbstractionStarter]: At program point L562(lines 562 571) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse13 (<= 2 ~t1_st~0)) (.cse6 (<= 2 ~t2_st~0)) (.cse9 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse15 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse8 (= ~E_1~0 2)) (.cse2 (= 1 ~t2_pc~0)) (.cse10 (<= 2 ~E_2~0)) (.cse4 (not (= ~m_st~0 0))) (.cse11 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ULTIMATE.start_eval_~tmp~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~token~0 ~local~0) .cse11 (<= ~local~0 ~token~0)) (let ((.cse12 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse12) .cse2 .cse13 .cse4 .cse5 .cse7 .cse8 .cse10 (<= .cse12 ~token~0) .cse14 .cse11)) (and .cse15 .cse6 .cse7 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse14 .cse13 .cse5) (let ((.cse16 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 (<= .cse16 ~token~0) (<= ~token~0 .cse16))) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse11) (and .cse15 .cse7 .cse1 .cse8 .cse2 .cse10 .cse4 .cse11 .cse5))) [2019-11-24 06:05:49,724 INFO L440 ceAbstractionStarter]: At program point L562-1(lines 562 571) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse13 (<= 2 ~t1_st~0)) (.cse6 (<= 2 ~t2_st~0)) (.cse9 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse15 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse8 (= ~E_1~0 2)) (.cse2 (= 1 ~t2_pc~0)) (.cse10 (<= 2 ~E_2~0)) (.cse4 (not (= ~m_st~0 0))) (.cse11 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ULTIMATE.start_eval_~tmp~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~token~0 ~local~0) .cse11 (<= ~local~0 ~token~0)) (let ((.cse12 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse12) .cse2 .cse13 .cse4 .cse5 .cse7 .cse8 .cse10 (<= .cse12 ~token~0) .cse14 .cse11)) (and .cse15 .cse6 .cse7 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse14 .cse13 .cse5) (let ((.cse16 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 (<= .cse16 ~token~0) (<= ~token~0 .cse16))) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse11) (and .cse15 .cse7 .cse1 .cse8 .cse2 .cse10 .cse4 .cse11 .cse5))) [2019-11-24 06:05:49,724 INFO L444 ceAbstractionStarter]: For program point L298(lines 298 305) no Hoare annotation was computed. [2019-11-24 06:05:49,724 INFO L440 ceAbstractionStarter]: At program point L167(lines 155 169) the Hoare annotation is: (and (<= ~m_pc~0 0) (<= 2 ~E_M~0) (= ~E_1~0 2) (<= ~t1_pc~0 0) (<= 2 ~E_2~0) (<= ~token~0 ~local~0) (= 0 ~t1_st~0) (<= ~local~0 ~token~0) (= 0 ~t2_pc~0) (= 0 ~t2_st~0)) [2019-11-24 06:05:49,724 INFO L440 ceAbstractionStarter]: At program point L167-1(lines 155 169) the Hoare annotation is: (let ((.cse0 (<= 2 ~t2_st~0)) (.cse3 (= 1 ~t2_pc~0)) (.cse11 (<= ~t1_pc~0 0)) (.cse12 (= 0 ~t1_st~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (= 1 ~t1_pc~0)) (.cse10 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse4 (<= 2 ~E_2~0)) (.cse5 (<= ~token~0 ~local~0)) (.cse6 (<= 2 ~t1_st~0)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse9 (<= ~local~0 ~token~0)) (.cse14 (= 0 ~t2_st~0)) (.cse13 (= 0 ~t2_pc~0))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_eval_~tmp~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse8 .cse9) (and .cse1 .cse10 .cse11 .cse4 .cse5 .cse12 .cse7 .cse8 .cse9 .cse13 .cse14) (and .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse13))) [2019-11-24 06:05:49,725 INFO L440 ceAbstractionStarter]: At program point L167-2(lines 155 169) the Hoare annotation is: (let ((.cse1 (= ~m_pc~0 1)) (.cse11 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse7 (not (= 0 ~t1_st~0))) (.cse12 (= 0 ~t2_st~0)) (.cse13 (= 0 ~t2_pc~0)) (.cse10 (<= ~m_pc~0 0)) (.cse0 (<= 2 ~E_M~0)) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (= ~E_1~0 2)) (.cse4 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse6 (= 1 ~t2_pc~0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (let ((.cse5 (+ ~local~0 1))) (and (<= 2 ~t2_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse5) .cse6 .cse7 (<= .cse5 ~token~0) .cse8 .cse9)) (and .cse10 .cse0 .cse2 .cse11 .cse3 .cse8 .cse9 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse7 .cse8 .cse9 .cse12 .cse13) (and .cse10 .cse0 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9))) [2019-11-24 06:05:49,725 INFO L440 ceAbstractionStarter]: At program point L167-3(lines 155 169) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse8 (<= 2 ~t1_st~0)) (.cse1 (not (= 0 ~t2_st~0))) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (= ~E_1~0 2)) (.cse4 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse5 (= 1 ~t2_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (not (= ~m_st~0 0))) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (let ((.cse9 (+ ~local~0 2))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~E_M~0 1))) .cse8 (<= .cse9 ~token~0) (<= ~token~0 .cse9))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7 .cse10) (and (<= ~m_pc~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10))) [2019-11-24 06:05:49,725 INFO L440 ceAbstractionStarter]: At program point L167-4(lines 155 169) the Hoare annotation is: (let ((.cse0 (<= 2 ~t2_st~0)) (.cse2 (= ~m_pc~0 1)) (.cse7 (<= 2 ~t1_st~0)) (.cse12 (<= ~m_pc~0 0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= 1 ~t1_pc~0)) (.cse4 (= ~E_1~0 2)) (.cse5 (= 1 ~t2_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse10 (= ULTIMATE.start_eval_~tmp~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~local~0 1))) (and .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse11) .cse5 .cse6 (<= .cse11 ~token~0) .cse7 .cse8 .cse9 .cse10)) (and .cse0 .cse12 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8 .cse9 .cse10) (let ((.cse13 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse7 (<= .cse13 ~token~0) .cse10 (<= ~token~0 .cse13))) (and .cse12 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10))) [2019-11-24 06:05:49,725 INFO L440 ceAbstractionStarter]: At program point L167-5(lines 155 169) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse13 (<= 2 ~t1_st~0)) (.cse6 (<= 2 ~t2_st~0)) (.cse9 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse15 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse8 (= ~E_1~0 2)) (.cse2 (= 1 ~t2_pc~0)) (.cse10 (<= 2 ~E_2~0)) (.cse4 (not (= ~m_st~0 0))) (.cse11 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ULTIMATE.start_eval_~tmp~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~token~0 ~local~0) .cse11 (<= ~local~0 ~token~0)) (let ((.cse12 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse12) .cse2 .cse13 .cse4 .cse5 .cse7 .cse8 .cse10 (<= .cse12 ~token~0) .cse14 .cse11)) (and .cse15 .cse6 .cse7 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse14 .cse13 .cse5) (let ((.cse16 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 (<= .cse16 ~token~0) (<= ~token~0 .cse16))) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse11) (and .cse15 .cse7 .cse1 .cse8 .cse2 .cse10 .cse4 .cse11 .cse5))) [2019-11-24 06:05:49,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 06:05:49 BoogieIcfgContainer [2019-11-24 06:05:49,824 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 06:05:49,826 INFO L168 Benchmark]: Toolchain (without parser) took 33184.27 ms. Allocated memory was 138.4 MB in the beginning and 693.6 MB in the end (delta: 555.2 MB). Free memory was 102.6 MB in the beginning and 291.2 MB in the end (delta: -188.6 MB). Peak memory consumption was 539.5 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:49,826 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-11-24 06:05:49,827 INFO L168 Benchmark]: CACSL2BoogieTranslator took 454.58 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 102.4 MB in the beginning and 178.9 MB in the end (delta: -76.5 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:49,827 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.72 ms. Allocated memory is still 202.9 MB. Free memory was 178.9 MB in the beginning and 175.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:49,828 INFO L168 Benchmark]: Boogie Preprocessor took 70.69 ms. Allocated memory is still 202.9 MB. Free memory was 175.5 MB in the beginning and 172.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:49,828 INFO L168 Benchmark]: RCFGBuilder took 1732.68 ms. Allocated memory was 202.9 MB in the beginning and 235.9 MB in the end (delta: 33.0 MB). Free memory was 172.9 MB in the beginning and 145.4 MB in the end (delta: 27.4 MB). Peak memory consumption was 88.4 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:49,829 INFO L168 Benchmark]: TraceAbstraction took 30862.44 ms. Allocated memory was 235.9 MB in the beginning and 693.6 MB in the end (delta: 457.7 MB). Free memory was 145.4 MB in the beginning and 291.2 MB in the end (delta: -145.8 MB). Peak memory consumption was 484.9 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:49,831 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.17 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 454.58 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 102.4 MB in the beginning and 178.9 MB in the end (delta: -76.5 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.72 ms. Allocated memory is still 202.9 MB. Free memory was 178.9 MB in the beginning and 175.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 70.69 ms. Allocated memory is still 202.9 MB. Free memory was 175.5 MB in the beginning and 172.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1732.68 ms. Allocated memory was 202.9 MB in the beginning and 235.9 MB in the end (delta: 33.0 MB). Free memory was 172.9 MB in the beginning and 145.4 MB in the end (delta: 27.4 MB). Peak memory consumption was 88.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30862.44 ms. Allocated memory was 235.9 MB in the beginning and 693.6 MB in the end (delta: 457.7 MB). Free memory was 145.4 MB in the beginning and 291.2 MB in the end (delta: -145.8 MB). Peak memory consumption was 484.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((((((m_pc <= 0 && 2 <= E_M) && E_1 == 2) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && local <= token) && 0 == t2_pc) && 0 == t2_st - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && !(m_st == 0)) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token) || ((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && __retres1 == 0)) || (((((((((((m_pc <= 0 && 2 <= t2_st) && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 0 <= __retres1) && 2 <= E_2) && __retres1 <= 0) && __retres1 == 0) && 2 <= t1_st) && tmp == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 <= token) && token <= local + 2)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && __retres1 == 0)) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0) && tmp == 0) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: (((((((((((((((((((m_pc == 1 && 2 <= E_M) && tmp == 1) && E_1 == 2) && !(0 == t1_st)) && 2 <= E_2) && 2 <= m_st) && token <= local) && __retres1 == 0) && local <= token) && 0 == t2_st) && 0 == t2_pc) || ((((((((2 <= E_M && m_pc <= 0) && tmp == 1) && E_1 == 2) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && 0 == t2_st) && 0 == t2_pc)) || (((((((2 <= E_M && m_pc <= 0) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0)) || (((((((((2 <= E_M && m_pc == 1) && E_1 == 2) && !(tmp == 0)) && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && !(m_st == 0)) && __retres1 == 0)) || (((((((2 <= t2_st && 2 <= E_M) && m_pc <= 0) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0))) || (((((((2 <= t2_st && 2 <= E_M) && m_pc <= 0) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && !(0 == t1_st)) && 2 <= E_2)) || ((((((((2 <= E_M && m_pc <= 0) && tmp == 1) && E_1 == 2) && !(tmp == 0)) && !(0 == t1_st)) && 2 <= E_2) && 0 == t2_st) && 0 == t2_pc)) || ((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 0 <= __retres1) && 2 <= E_2) && __retres1 <= 0) && !(m_st == 0)) && __retres1 == 0)) || (((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && 0 == t2_pc)) || (((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && !(0 == t1_st)) && token <= local) && 2 <= m_st) && local <= token) && __retres1 == 0) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && !(m_st == 0)) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && token <= local + 1) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && __retres1 == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 <= token) && token <= local + 2)) || (((((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 0 <= __retres1) && 2 <= E_2) && __retres1 <= 0) && __retres1 == 0) && 2 <= t1_st) && tmp == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && __retres1 == 0)) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0) && tmp == 0) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && !(m_st == 0)) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token) || ((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && __retres1 == 0)) || (((((((((((m_pc <= 0 && 2 <= t2_st) && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 0 <= __retres1) && 2 <= E_2) && __retres1 <= 0) && __retres1 == 0) && 2 <= t1_st) && tmp == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 <= token) && token <= local + 2)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && __retres1 == 0)) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0) && tmp == 0) - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: ((((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && !(m_st == 0)) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token) || ((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && __retres1 == 0)) || (((((((((((m_pc <= 0 && 2 <= t2_st) && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 0 <= __retres1) && 2 <= E_2) && __retres1 <= 0) && __retres1 == 0) && 2 <= t1_st) && tmp == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 <= token) && token <= local + 2)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && __retres1 == 0)) || (((((((((2 <= E_M && m_pc <= 0) && E_1 == 2) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && local <= token) && 0 == t2_pc) && 0 == t2_st)) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0) && tmp == 0) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0) && tmp == 0) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && token <= local + 1) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && __retres1 == 0)) || (((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && tmp == 0)) || (((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && token <= local) && local <= token) && !(m_st == 0)) && __retres1 == 0) && tmp == 0)) || (((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && local + 2 <= token) && tmp == 0) && token <= local + 2)) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0) && tmp == 0) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && tmp == 1) && E_1 == 2) && 1 == t2_pc) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && !(m_st == 0)) && local <= token) || (((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st) && !(m_st == 0))) || (((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && 2 <= E_2) && 2 <= t1_st) && !(m_st == 0)) && 0 == t2_st) && 0 == t2_pc)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t1_st) && !(m_st == 0)) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && !(tmp == 0)) && 2 <= E_2) && __retres1 == 0) && local + 2 <= token) && token <= local + 2)) || (((((((((((m_pc <= 0 && 2 <= E_M) && tmp == 1) && E_1 == 2) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && !(m_st == 0)) && local <= token) && 0 == t2_pc) && 0 == t2_st) - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: ((((((((((((((((m_pc <= 0 && 2 <= E_M) && tmp == 1) && E_1 == 2) && t1_pc <= 0) && 2 <= E_2) && !(m_st == 0)) && 0 == t2_pc) && 0 == t2_st) || ((((((((((2 <= E_M && m_pc == 1) && tmp == 1) && 1 == t1_pc) && E_1 == 2) && !(0 == t1_st)) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && 0 == t2_pc)) || ((((((((((((m_pc == 1 && tmp == 1) && 1 == t2_pc) && t1_pc <= 0) && !(0 == t1_st)) && 2 <= m_st) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && 2 <= E_2) && !(m_st == 0)) && 0 == t2_st) && 0 == t2_pc)) || ((((((((((m_pc <= 0 && 2 <= E_M) && tmp == 1) && E_1 == 2) && t1_pc <= 0) && !(0 == t1_st)) && 2 <= E_2) && token <= local) && local <= token) && 0 == t2_pc) && 0 == t2_st)) || (((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0))) || (((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && !(0 == t1_st)) && token <= local) && !(m_st == 0)) && local <= token)) || ((((((((((((m_pc == 1 && tmp == 1) && t1_pc <= 0) && !(0 == t1_st)) && 2 <= m_st) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || ((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && tmp == 1) && E_1 == 2) && 1 == t2_pc) && t1_pc <= 0) && 2 <= E_2) && !(m_st == 0))) || ((((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && tmp == 1) && E_1 == 2) && 1 == t2_pc) && t1_pc <= 0) && !(0 == t1_st)) && 2 <= E_2) && token <= local) && local <= token) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((m_pc == 1 && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2) || ((((((((m_pc <= 0 && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0)) || ((((((((((m_pc == 1 && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2) || ((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 2 <= E_2) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0)) || ((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0))) || ((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 2 <= E_2) && 2 <= t1_st)) || ((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 0 == t1_st) && !(m_st == 0)) && __retres1 == 0) && local <= token)) || (((((((((((m_pc == 1 && 2 <= E_M) && tmp == 1) && !(0 == t2_st)) && E_1 == 2) && t1_pc <= 0) && 2 <= E_2) && 2 <= m_st) && token <= local) && 0 == t1_st) && __retres1 == 0) && local <= token)) || ((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 2 <= m_st) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && m_pc <= 0) && !(0 == t2_st)) && E_1 == 2) && tmp == 1) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && local <= token)) || ((((((((2 <= E_M && m_pc <= 0) && !(0 == t2_st)) && E_1 == 2) && tmp == 1) && t1_pc <= 0) && 2 <= E_2) && 0 == t1_st) && !(m_st == 0)) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && token <= local + 1) && 1 == t2_pc) && !(0 == t1_st)) && local + 1 <= token) && !(m_st == 0)) && __retres1 == 0) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && 0 == t2_pc)) || (((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && !(0 == t1_st)) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && 0 == t2_pc)) || (((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && !(m_st == 0)) && __retres1 == 0) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && 2 <= E_2) && 2 <= t1_st) && 0 == t2_st) && 0 == t2_pc) || ((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(0 == t2_st)) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st) && !(m_st == 0))) || ((((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && tmp == 1) && E_1 == 2) && 1 == t2_pc) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && local <= token)) || ((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && 1 == t2_pc) && token <= local + 1) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st) && !(m_st == 0))) || (((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(0 == t2_st)) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && token <= local) && !(m_st == 0)) && local <= token)) || (((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || ((((((((((m_pc <= 0 && 2 <= E_M) && tmp == 1) && E_1 == 2) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && local <= token) && 0 == t2_pc) && 0 == t2_st)) || ((((((((((m_pc == 1 && 2 <= E_M) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && 2 <= E_2) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_pc) && 0 == t2_st)) || (((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0))) || (((((((((((m_pc == 1 && 2 <= E_M) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && 2 <= E_2) && 2 <= m_st) && token <= local) && __retres1 == 0) && local <= token) && 0 == t2_pc) && 0 == t2_st)) || (((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(0 == t2_st)) && !(tmp == 0)) && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st) && !(m_st == 0))) || (((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && token <= local + 1) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && 2 <= t1_st) && !(m_st == 0))) || (((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && tmp == 1) && E_1 == 2) && 1 == t2_pc) && t1_pc <= 0) && 2 <= E_2) && 0 == t1_st) && !(m_st == 0))) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && 2 <= E_2) && !(m_st == 0)) && 0 == t2_pc) && 0 == t2_st)) || ((((((((((((m_pc == 1 && tmp == 1) && 1 == t2_pc) && t1_pc <= 0) && 2 <= m_st) && 0 == t1_st) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || ((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st)) || ((((((((((((m_pc == 1 && tmp == 1) && t1_pc <= 0) && 2 <= m_st) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || (((((((((m_pc <= 0 && 2 <= E_M) && tmp == 1) && E_1 == 2) && t1_pc <= 0) && 2 <= E_2) && 0 == t1_st) && !(m_st == 0)) && 0 == t2_pc) && 0 == t2_st)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && tmp == 1) && 0 == t1_st) && !(m_st == 0)) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((((((((((2 <= t2_st && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && token <= local) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0) && local <= token) || ((((((((((2 <= t2_st && 2 <= E_M) && tmp == 1) && 1 == t2_pc) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && !(m_st == 0)) && __retres1 == 0) && local <= token)) || ((((((((((2 <= E_M && tmp == 1) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && !(m_st == 0)) && __retres1 == 0) && local <= token) && 0 == t2_pc) && 0 == t2_st)) || ((((((((((2 <= E_M && 1 == t1_pc) && tmp == 1) && 2 <= E_2) && token <= local) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0) && local <= token) && 0 == t2_st) && 0 == t2_pc) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: (((((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) || (((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && tmp == 0)) || ((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st) && tmp == 0)) || ((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0)) || ((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && token <= local) && !(m_st == 0)) && local <= token) && tmp == 0)) || (((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && local + 2 <= token) && tmp == 0) && token <= local + 2) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: (((((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && token <= local + 1) && 1 == t2_pc) && !(0 == t1_st)) && local + 1 <= token) && !(m_st == 0)) && __retres1 == 0) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && 0 == t2_pc)) || (((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && !(0 == t1_st)) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && 0 == t2_pc)) || (((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && !(m_st == 0)) && __retres1 == 0) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((m_pc <= 0 && 2 <= E_M) && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) || ((((((((((2 <= E_M && m_pc == 1) && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: ((((((((((((2 <= t2_st && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && token <= local) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0) && local <= token) || ((((((((((2 <= t2_st && 2 <= E_M) && tmp == 1) && 1 == t2_pc) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && !(m_st == 0)) && __retres1 == 0) && local <= token)) || ((((((((((2 <= E_M && tmp == 1) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && !(m_st == 0)) && __retres1 == 0) && local <= token) && 0 == t2_pc) && 0 == t2_st)) || ((((((((((2 <= E_M && 1 == t1_pc) && tmp == 1) && 2 <= E_2) && token <= local) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0) && local <= token) && 0 == t2_st) && 0 == t2_pc) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: ((((((((m_pc <= 0 && 2 <= E_M) && E_1 == 2) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && local <= token) && 0 == t2_pc) && 0 == t2_st - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((m_pc <= 0 && 2 <= E_M) && 2 <= t2_st) && tmp == 1) && E_1 == 2) && 1 == t2_pc) && t1_pc <= 0) && 2 <= E_2) && 0 == t1_st) && !(m_st == 0)) || ((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && 2 <= E_2) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && 0 == t2_pc)) || (((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || (((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && !(tmp == 0)) && 2 <= E_2) && 2 <= t1_st) && 0 == t2_st) && 0 == t2_pc)) || ((((((((((m_pc <= 0 && 2 <= E_M) && tmp == 1) && E_1 == 2) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && local <= token) && 0 == t2_pc) && 0 == t2_st)) || (((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0))) || ((((((((((m_pc <= 0 && 2 <= E_M) && 2 <= t2_st) && tmp == 1) && E_1 == 2) && 1 == t2_pc) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && local <= token)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && tmp == 1) && 0 == t1_st) && !(m_st == 0)) && 0 == t2_st) && 0 == t2_pc) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || (((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && 2 <= E_2) && 2 <= m_st) && token <= local) && __retres1 == 0) && local <= token) && 0 == t2_st) && 0 == t2_pc)) || ((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && token <= local) && !(m_st == 0)) && local <= token)) || ((((((((((((m_pc == 1 && tmp == 1) && 1 == t2_pc) && t1_pc <= 0) && 2 <= m_st) && 0 == t1_st) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || ((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st)) || (((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st) && !(m_st == 0))) || ((((((((((((m_pc == 1 && tmp == 1) && t1_pc <= 0) && 2 <= m_st) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || (((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && 0 == t2_st) && 0 == t2_pc)) || (((((((((m_pc <= 0 && 2 <= E_M) && tmp == 1) && E_1 == 2) && t1_pc <= 0) && 2 <= E_2) && 0 == t1_st) && !(m_st == 0)) && 0 == t2_pc) && 0 == t2_st)) || ((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st) && !(m_st == 0)) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && 2 <= E_2) && 2 <= t1_st) && 0 == t2_st) && 0 == t2_pc) || ((((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && tmp == 1) && E_1 == 2) && 1 == t2_pc) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && local <= token)) || (((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0)) || ((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && 2 <= E_2) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && 0 == t2_pc)) || ((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && token <= local) && !(m_st == 0)) && local <= token)) || ((((((((m_pc <= 0 && 2 <= E_M) && E_1 == 2) && t1_pc <= 0) && 2 <= E_2) && 0 == t1_st) && !(m_st == 0)) && 0 == t2_st) && 0 == t2_pc)) || (((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0))) || (((((((m_pc <= 0 && 2 <= E_M) && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0))) || ((((((((((2 <= E_M && m_pc == 1) && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st) && !(m_st == 0))) || (((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && tmp == 1) && E_1 == 2) && 1 == t2_pc) && t1_pc <= 0) && 2 <= E_2) && 0 == t1_st) && !(m_st == 0))) || (((((((((m_pc <= 0 && 2 <= E_M) && E_1 == 2) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && local <= token) && 0 == t2_st) && 0 == t2_pc)) || (((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && tmp == 1) && 0 == t1_st) && !(m_st == 0)) && 0 == t2_st) && 0 == t2_pc) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || ((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st)) || (((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && 2 <= E_2) && 2 <= m_st) && token <= local) && __retres1 == 0) && local <= token) && 0 == t2_st) && 0 == t2_pc)) || (((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st) && !(m_st == 0))) || ((((((((((((m_pc == 1 && tmp == 1) && 1 == t2_pc) && t1_pc <= 0) && 2 <= m_st) && 0 == t1_st) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && 2 <= E_2) && !(m_st == 0)) && 0 == t2_st) && 0 == t2_pc)) || ((((((((((((m_pc == 1 && tmp == 1) && t1_pc <= 0) && 2 <= m_st) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || (((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || ((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st) && !(m_st == 0)) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((((((((m_pc == 1 && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2) || ((((((((m_pc <= 0 && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0)) || ((((((((((m_pc == 1 && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && 0 == t2_pc) || ((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 0 <= __retres1) && __retres1 <= 0) && !(m_st == 0)) && __retres1 == 0)) || (((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && token <= local + 1) && 1 == t2_pc) && local + 1 <= token) && !(m_st == 0)) && __retres1 == 0)) || ((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && 0 == t2_pc)) || (((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && !(m_st == 0)) && __retres1 == 0) - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: (((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && !(m_st == 0)) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token) || ((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && __retres1 == 0)) || (((((((((((m_pc <= 0 && 2 <= t2_st) && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 0 <= __retres1) && 2 <= E_2) && __retres1 <= 0) && __retres1 == 0) && 2 <= t1_st) && tmp == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 <= token) && token <= local + 2)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && __retres1 == 0)) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0) && tmp == 0) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: (((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t1_st) && !(m_st == 0)) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && !(tmp == 0)) && 2 <= E_2) && __retres1 == 0) && local + 2 <= token) && token <= local + 2 - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((((((((((2 <= t2_st && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 0 <= __retres1) && 2 <= E_2) && __retres1 <= 0) && token <= local) && !(m_st == 0)) && __retres1 == 0) && local <= token) || ((((((((((2 <= E_M && tmp == 1) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && !(m_st == 0)) && __retres1 == 0) && local <= token) && 0 == t2_pc) && 0 == t2_st)) || (((((((((2 <= E_M && 1 == t1_pc) && tmp == 1) && 2 <= E_2) && token <= local) && !(m_st == 0)) && __retres1 == 0) && local <= token) && 0 == t2_st) && 0 == t2_pc)) || ((((((((((((tmp == 1 && 1 == t2_pc) && t1_pc <= 0) && __retres1 <= 0) && 0 == t1_st) && !(m_st == 0)) && 2 <= t2_st) && 2 <= E_M) && 0 <= __retres1) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token) - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: (((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && !(m_st == 0)) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token) || ((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && __retres1 == 0)) || (((((((((((m_pc <= 0 && 2 <= t2_st) && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 0 <= __retres1) && 2 <= E_2) && __retres1 <= 0) && __retres1 == 0) && 2 <= t1_st) && tmp == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 <= token) && token <= local + 2)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && __retres1 == 0)) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0) && tmp == 0) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: (((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && !(m_st == 0)) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token) || ((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && __retres1 == 0)) || (((((((((((m_pc <= 0 && 2 <= t2_st) && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 0 <= __retres1) && 2 <= E_2) && __retres1 <= 0) && __retres1 == 0) && 2 <= t1_st) && tmp == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 <= token) && token <= local + 2)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && __retres1 == 0)) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0) && tmp == 0) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((((((((m_pc <= 0 && 2 <= E_M) && E_1 == 2) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && local <= token) && 0 == t2_pc) && 0 == t2_st - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0) && tmp == 0) || (((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0) && tmp == 0)) || ((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st) && tmp == 0)) || (((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && token <= local) && local <= token) && !(m_st == 0)) && __retres1 == 0) && tmp == 0)) || (((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && local + 2 <= token) && tmp == 0) && token <= local + 2)) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0) && tmp == 0) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: ((((((((((((m_pc == 1 && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) || (((((((m_pc == 1 && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && E_M == 1)) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2) || (((((((((m_pc == 1 && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0)) || ((((((((m_pc <= 0 && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 100 locations, 1 error locations. Result: SAFE, OverallTime: 30.6s, OverallIterations: 21, TraceHistogramMax: 4, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 21.4s, HoareTripleCheckerStatistics: 3375 SDtfs, 3676 SDslu, 4383 SDs, 0 SdLazy, 950 SolverSat, 218 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 824 GetRequests, 713 SyntacticMatches, 3 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1380occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 3656 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 397 NumberOfFragments, 6967 HoareAnnotationTreeSize, 33 FomulaSimplifications, 580280 FormulaSimplificationTreeSizeReduction, 2.4s HoareSimplificationTime, 33 FomulaSimplificationsInter, 186191 FormulaSimplificationTreeSizeReductionInter, 18.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1527 NumberOfCodeBlocks, 1527 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1832 ConstructedInterpolants, 0 QuantifiedInterpolants, 236996 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1546 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 33 InterpolantComputations, 26 PerfectInterpolantSequences, 412/429 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 correct! Received shutdown request...