/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.03.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 06:05:23,821 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 06:05:23,824 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 06:05:23,835 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 06:05:23,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 06:05:23,837 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 06:05:23,838 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 06:05:23,840 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 06:05:23,851 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 06:05:23,852 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 06:05:23,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 06:05:23,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 06:05:23,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 06:05:23,860 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 06:05:23,861 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 06:05:23,862 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 06:05:23,862 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 06:05:23,866 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 06:05:23,867 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 06:05:23,873 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 06:05:23,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 06:05:23,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 06:05:23,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 06:05:23,880 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 06:05:23,886 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 06:05:23,886 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 06:05:23,886 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 06:05:23,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 06:05:23,889 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 06:05:23,890 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 06:05:23,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 06:05:23,891 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 06:05:23,892 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 06:05:23,893 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 06:05:23,894 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 06:05:23,894 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 06:05:23,895 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 06:05:23,895 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 06:05:23,896 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 06:05:23,897 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 06:05:23,899 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 06:05:23,899 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:23,918 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 06:05:23,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 06:05:23,920 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 06:05:23,920 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 06:05:23,920 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 06:05:23,921 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 06:05:23,921 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 06:05:23,921 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 06:05:23,921 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 06:05:23,921 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 06:05:23,922 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 06:05:23,922 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 06:05:23,923 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 06:05:23,923 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 06:05:23,923 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 06:05:23,924 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 06:05:23,924 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 06:05:23,924 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 06:05:23,925 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 06:05:23,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 06:05:23,925 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 06:05:23,925 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 06:05:23,925 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 06:05:23,926 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 06:05:23,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 06:05:23,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 06:05:23,926 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 06:05:23,926 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 06:05:23,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 06:05:23,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 06:05:23,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 06:05:23,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 06:05:23,928 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 06:05:23,928 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 06:05:23,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 06:05:23,929 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 06:05:23,929 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 06:05:23,930 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 06:05:24,198 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 06:05:24,215 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 06:05:24,219 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 06:05:24,220 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 06:05:24,221 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 06:05:24,221 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.03.cil-1.c [2019-11-24 06:05:24,290 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/356355ee5/934db39361944ef884a1dfcf97aa2605/FLAG3de22ba86 [2019-11-24 06:05:24,769 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 06:05:24,769 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.03.cil-1.c [2019-11-24 06:05:24,791 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/356355ee5/934db39361944ef884a1dfcf97aa2605/FLAG3de22ba86 [2019-11-24 06:05:25,106 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/356355ee5/934db39361944ef884a1dfcf97aa2605 [2019-11-24 06:05:25,115 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 06:05:25,117 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 06:05:25,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 06:05:25,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 06:05:25,123 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 06:05:25,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:05:25" (1/1) ... [2019-11-24 06:05:25,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19f7ac10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:25, skipping insertion in model container [2019-11-24 06:05:25,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:05:25" (1/1) ... [2019-11-24 06:05:25,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 06:05:25,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 06:05:25,455 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:05:25,461 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 06:05:25,527 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:05:25,546 INFO L208 MainTranslator]: Completed translation [2019-11-24 06:05:25,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:25 WrapperNode [2019-11-24 06:05:25,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 06:05:25,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 06:05:25,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 06:05:25,547 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 06:05:25,554 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:25" (1/1) ... [2019-11-24 06:05:25,561 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:25" (1/1) ... [2019-11-24 06:05:25,689 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 06:05:25,689 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 06:05:25,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 06:05:25,690 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 06:05:25,706 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:25" (1/1) ... [2019-11-24 06:05:25,706 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:25" (1/1) ... [2019-11-24 06:05:25,709 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:25" (1/1) ... [2019-11-24 06:05:25,710 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:25" (1/1) ... [2019-11-24 06:05:25,722 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:25" (1/1) ... [2019-11-24 06:05:25,737 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:25" (1/1) ... [2019-11-24 06:05:25,741 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:25" (1/1) ... [2019-11-24 06:05:25,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 06:05:25,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 06:05:25,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 06:05:25,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 06:05:25,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:25" (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:25,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 06:05:25,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 06:05:27,740 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 06:05:27,740 INFO L284 CfgBuilder]: Removed 132 assume(true) statements. [2019-11-24 06:05:27,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:05:27 BoogieIcfgContainer [2019-11-24 06:05:27,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 06:05:27,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 06:05:27,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 06:05:27,746 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 06:05:27,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 06:05:25" (1/3) ... [2019-11-24 06:05:27,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc91e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:05:27, skipping insertion in model container [2019-11-24 06:05:27,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:25" (2/3) ... [2019-11-24 06:05:27,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc91e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:05:27, skipping insertion in model container [2019-11-24 06:05:27,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:05:27" (3/3) ... [2019-11-24 06:05:27,749 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-1.c [2019-11-24 06:05:27,759 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 06:05:27,766 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-24 06:05:27,779 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-24 06:05:27,814 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 06:05:27,814 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 06:05:27,814 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 06:05:27,814 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 06:05:27,815 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 06:05:27,815 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 06:05:27,815 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 06:05:27,815 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 06:05:27,840 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states. [2019-11-24 06:05:27,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 06:05:27,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:27,851 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:27,852 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:27,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:27,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1366287352, now seen corresponding path program 1 times [2019-11-24 06:05:27,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:27,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180817356] [2019-11-24 06:05:27,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:28,078 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:28,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180817356] [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,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:05:28,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563239059] [2019-11-24 06:05:28,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:28,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:28,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:28,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:28,107 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 3 states. [2019-11-24 06:05:28,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:28,245 INFO L93 Difference]: Finished difference Result 416 states and 639 transitions. [2019-11-24 06:05:28,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:28,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-24 06:05:28,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:28,263 INFO L225 Difference]: With dead ends: 416 [2019-11-24 06:05:28,263 INFO L226 Difference]: Without dead ends: 264 [2019-11-24 06:05:28,267 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:28,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-11-24 06:05:28,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 250. [2019-11-24 06:05:28,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-24 06:05:28,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2019-11-24 06:05:28,327 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 22 [2019-11-24 06:05:28,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:28,328 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2019-11-24 06:05:28,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:28,328 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2019-11-24 06:05:28,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 06:05:28,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:28,331 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:28,332 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:28,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:28,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1905200937, now seen corresponding path program 1 times [2019-11-24 06:05:28,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:28,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225378342] [2019-11-24 06:05:28,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:28,400 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:28,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225378342] [2019-11-24 06:05:28,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:28,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:05:28,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733071970] [2019-11-24 06:05:28,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:28,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:28,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:28,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:28,404 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand 3 states. [2019-11-24 06:05:28,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:28,473 INFO L93 Difference]: Finished difference Result 684 states and 1014 transitions. [2019-11-24 06:05:28,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:28,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-24 06:05:28,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:28,477 INFO L225 Difference]: With dead ends: 684 [2019-11-24 06:05:28,477 INFO L226 Difference]: Without dead ends: 443 [2019-11-24 06:05:28,479 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:28,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-11-24 06:05:28,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 437. [2019-11-24 06:05:28,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-11-24 06:05:28,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 639 transitions. [2019-11-24 06:05:28,509 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 639 transitions. Word has length 43 [2019-11-24 06:05:28,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:28,509 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 639 transitions. [2019-11-24 06:05:28,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:28,510 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 639 transitions. [2019-11-24 06:05:28,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 06:05:28,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:28,513 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:28,514 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:28,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:28,514 INFO L82 PathProgramCache]: Analyzing trace with hash 624949750, now seen corresponding path program 1 times [2019-11-24 06:05:28,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:28,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329461386] [2019-11-24 06:05:28,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:28,618 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:28,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329461386] [2019-11-24 06:05:28,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:28,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:05:28,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394829624] [2019-11-24 06:05:28,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:28,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:28,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:28,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:28,622 INFO L87 Difference]: Start difference. First operand 437 states and 639 transitions. Second operand 3 states. [2019-11-24 06:05:28,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:28,683 INFO L93 Difference]: Finished difference Result 1207 states and 1765 transitions. [2019-11-24 06:05:28,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:28,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-24 06:05:28,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:28,691 INFO L225 Difference]: With dead ends: 1207 [2019-11-24 06:05:28,692 INFO L226 Difference]: Without dead ends: 782 [2019-11-24 06:05:28,694 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:28,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2019-11-24 06:05:28,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 774. [2019-11-24 06:05:28,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-11-24 06:05:28,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1114 transitions. [2019-11-24 06:05:28,743 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1114 transitions. Word has length 43 [2019-11-24 06:05:28,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:28,744 INFO L462 AbstractCegarLoop]: Abstraction has 774 states and 1114 transitions. [2019-11-24 06:05:28,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:28,744 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1114 transitions. [2019-11-24 06:05:28,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 06:05:28,752 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:28,752 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:28,753 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:28,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:28,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1955969130, now seen corresponding path program 1 times [2019-11-24 06:05:28,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:28,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616581579] [2019-11-24 06:05:28,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:28,859 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:28,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616581579] [2019-11-24 06:05:28,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:28,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:28,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962991057] [2019-11-24 06:05:28,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:28,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:28,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:28,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:28,861 INFO L87 Difference]: Start difference. First operand 774 states and 1114 transitions. Second operand 3 states. [2019-11-24 06:05:28,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:28,946 INFO L93 Difference]: Finished difference Result 2230 states and 3194 transitions. [2019-11-24 06:05:28,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:28,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-24 06:05:28,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:28,956 INFO L225 Difference]: With dead ends: 2230 [2019-11-24 06:05:28,956 INFO L226 Difference]: Without dead ends: 1461 [2019-11-24 06:05:28,959 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:28,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2019-11-24 06:05:29,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1377. [2019-11-24 06:05:29,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1377 states. [2019-11-24 06:05:29,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1951 transitions. [2019-11-24 06:05:29,015 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1951 transitions. Word has length 43 [2019-11-24 06:05:29,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:29,015 INFO L462 AbstractCegarLoop]: Abstraction has 1377 states and 1951 transitions. [2019-11-24 06:05:29,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:29,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1951 transitions. [2019-11-24 06:05:29,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 06:05:29,018 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:29,019 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:29,019 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:29,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:29,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1294635339, now seen corresponding path program 1 times [2019-11-24 06:05:29,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:29,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600768417] [2019-11-24 06:05:29,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:29,128 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:29,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600768417] [2019-11-24 06:05:29,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:29,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:29,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590984511] [2019-11-24 06:05:29,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:29,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:29,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:29,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:29,131 INFO L87 Difference]: Start difference. First operand 1377 states and 1951 transitions. Second operand 4 states. [2019-11-24 06:05:29,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:29,246 INFO L93 Difference]: Finished difference Result 3381 states and 4909 transitions. [2019-11-24 06:05:29,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:29,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-11-24 06:05:29,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:29,257 INFO L225 Difference]: With dead ends: 3381 [2019-11-24 06:05:29,257 INFO L226 Difference]: Without dead ends: 2017 [2019-11-24 06:05:29,260 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:29,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2017 states. [2019-11-24 06:05:29,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2017 to 1641. [2019-11-24 06:05:29,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1641 states. [2019-11-24 06:05:29,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2399 transitions. [2019-11-24 06:05:29,318 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2399 transitions. Word has length 43 [2019-11-24 06:05:29,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:29,318 INFO L462 AbstractCegarLoop]: Abstraction has 1641 states and 2399 transitions. [2019-11-24 06:05:29,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:29,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2399 transitions. [2019-11-24 06:05:29,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-24 06:05:29,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:29,322 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:29,322 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:29,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:29,323 INFO L82 PathProgramCache]: Analyzing trace with hash 438954228, now seen corresponding path program 1 times [2019-11-24 06:05:29,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:29,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014344584] [2019-11-24 06:05:29,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:29,442 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:29,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014344584] [2019-11-24 06:05:29,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:29,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:29,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078947020] [2019-11-24 06:05:29,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:29,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:29,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:29,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:29,446 INFO L87 Difference]: Start difference. First operand 1641 states and 2399 transitions. Second operand 3 states. [2019-11-24 06:05:29,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:29,526 INFO L93 Difference]: Finished difference Result 2657 states and 3885 transitions. [2019-11-24 06:05:29,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:29,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-11-24 06:05:29,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:29,535 INFO L225 Difference]: With dead ends: 2657 [2019-11-24 06:05:29,536 INFO L226 Difference]: Without dead ends: 1741 [2019-11-24 06:05:29,537 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:29,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1741 states. [2019-11-24 06:05:29,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1741 to 1641. [2019-11-24 06:05:29,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1641 states. [2019-11-24 06:05:29,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2347 transitions. [2019-11-24 06:05:29,611 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2347 transitions. Word has length 62 [2019-11-24 06:05:29,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:29,612 INFO L462 AbstractCegarLoop]: Abstraction has 1641 states and 2347 transitions. [2019-11-24 06:05:29,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:29,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2347 transitions. [2019-11-24 06:05:29,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-24 06:05:29,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:29,615 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:29,616 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:29,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:29,620 INFO L82 PathProgramCache]: Analyzing trace with hash 2029349205, now seen corresponding path program 1 times [2019-11-24 06:05:29,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:29,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753307452] [2019-11-24 06:05:29,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:29,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:29,742 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:29,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753307452] [2019-11-24 06:05:29,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:29,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:29,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71222655] [2019-11-24 06:05:29,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:29,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:29,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:29,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:29,744 INFO L87 Difference]: Start difference. First operand 1641 states and 2347 transitions. Second operand 4 states. [2019-11-24 06:05:29,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:29,826 INFO L93 Difference]: Finished difference Result 2589 states and 3705 transitions. [2019-11-24 06:05:29,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:29,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-24 06:05:29,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:29,834 INFO L225 Difference]: With dead ends: 2589 [2019-11-24 06:05:29,834 INFO L226 Difference]: Without dead ends: 1689 [2019-11-24 06:05:29,836 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:29,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1689 states. [2019-11-24 06:05:29,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 1641. [2019-11-24 06:05:29,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1641 states. [2019-11-24 06:05:29,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2315 transitions. [2019-11-24 06:05:29,893 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2315 transitions. Word has length 62 [2019-11-24 06:05:29,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:29,894 INFO L462 AbstractCegarLoop]: Abstraction has 1641 states and 2315 transitions. [2019-11-24 06:05:29,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:29,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2315 transitions. [2019-11-24 06:05:29,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-24 06:05:29,897 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:29,897 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:29,897 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:29,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:29,898 INFO L82 PathProgramCache]: Analyzing trace with hash 112663131, now seen corresponding path program 1 times [2019-11-24 06:05:29,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:29,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452623621] [2019-11-24 06:05:29,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:29,983 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:29,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452623621] [2019-11-24 06:05:29,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147386740] [2019-11-24 06:05:29,984 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:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:30,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-24 06:05:30,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:30,113 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:30,113 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:30,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:30,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:30,136 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:30,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:05:30,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [5] total 6 [2019-11-24 06:05:30,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015231215] [2019-11-24 06:05:30,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:30,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:30,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:30,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:30,139 INFO L87 Difference]: Start difference. First operand 1641 states and 2315 transitions. Second operand 3 states. [2019-11-24 06:05:30,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:30,424 INFO L93 Difference]: Finished difference Result 4669 states and 6579 transitions. [2019-11-24 06:05:30,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:30,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-24 06:05:30,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:30,440 INFO L225 Difference]: With dead ends: 4669 [2019-11-24 06:05:30,441 INFO L226 Difference]: Without dead ends: 3041 [2019-11-24 06:05:30,445 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 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:30,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3041 states. [2019-11-24 06:05:30,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3041 to 3037. [2019-11-24 06:05:30,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3037 states. [2019-11-24 06:05:30,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3037 states to 3037 states and 4243 transitions. [2019-11-24 06:05:30,610 INFO L78 Accepts]: Start accepts. Automaton has 3037 states and 4243 transitions. Word has length 63 [2019-11-24 06:05:30,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:30,610 INFO L462 AbstractCegarLoop]: Abstraction has 3037 states and 4243 transitions. [2019-11-24 06:05:30,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:30,611 INFO L276 IsEmpty]: Start isEmpty. Operand 3037 states and 4243 transitions. [2019-11-24 06:05:30,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-24 06:05:30,618 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:30,619 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:30,822 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:30,823 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:30,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:30,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1062842741, now seen corresponding path program 1 times [2019-11-24 06:05:30,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:30,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501494170] [2019-11-24 06:05:30,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:30,915 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:30,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501494170] [2019-11-24 06:05:30,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:30,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 06:05:30,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532230191] [2019-11-24 06:05:30,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 06:05:30,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:30,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 06:05:30,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:05:30,918 INFO L87 Difference]: Start difference. First operand 3037 states and 4243 transitions. Second operand 5 states. [2019-11-24 06:05:31,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:31,113 INFO L93 Difference]: Finished difference Result 5113 states and 7137 transitions. [2019-11-24 06:05:31,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 06:05:31,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-11-24 06:05:31,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:31,130 INFO L225 Difference]: With dead ends: 5113 [2019-11-24 06:05:31,130 INFO L226 Difference]: Without dead ends: 3433 [2019-11-24 06:05:31,134 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 06:05:31,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2019-11-24 06:05:31,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 3273. [2019-11-24 06:05:31,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3273 states. [2019-11-24 06:05:31,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3273 states to 3273 states and 4627 transitions. [2019-11-24 06:05:31,267 INFO L78 Accepts]: Start accepts. Automaton has 3273 states and 4627 transitions. Word has length 64 [2019-11-24 06:05:31,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:31,303 INFO L462 AbstractCegarLoop]: Abstraction has 3273 states and 4627 transitions. [2019-11-24 06:05:31,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 06:05:31,303 INFO L276 IsEmpty]: Start isEmpty. Operand 3273 states and 4627 transitions. [2019-11-24 06:05:31,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-24 06:05:31,310 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:31,310 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:31,310 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:31,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:31,311 INFO L82 PathProgramCache]: Analyzing trace with hash 264648656, now seen corresponding path program 1 times [2019-11-24 06:05:31,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:31,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387528319] [2019-11-24 06:05:31,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:31,382 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:31,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387528319] [2019-11-24 06:05:31,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:31,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:31,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740069792] [2019-11-24 06:05:31,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:31,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:31,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:31,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:31,384 INFO L87 Difference]: Start difference. First operand 3273 states and 4627 transitions. Second operand 4 states. [2019-11-24 06:05:31,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:31,530 INFO L93 Difference]: Finished difference Result 6597 states and 9321 transitions. [2019-11-24 06:05:31,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:31,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-24 06:05:31,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:31,546 INFO L225 Difference]: With dead ends: 6597 [2019-11-24 06:05:31,546 INFO L226 Difference]: Without dead ends: 3337 [2019-11-24 06:05:31,551 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:31,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3337 states. [2019-11-24 06:05:31,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3337 to 3273. [2019-11-24 06:05:31,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3273 states. [2019-11-24 06:05:31,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3273 states to 3273 states and 4571 transitions. [2019-11-24 06:05:31,683 INFO L78 Accepts]: Start accepts. Automaton has 3273 states and 4571 transitions. Word has length 66 [2019-11-24 06:05:31,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:31,684 INFO L462 AbstractCegarLoop]: Abstraction has 3273 states and 4571 transitions. [2019-11-24 06:05:31,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:31,684 INFO L276 IsEmpty]: Start isEmpty. Operand 3273 states and 4571 transitions. [2019-11-24 06:05:31,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-24 06:05:31,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:31,690 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:31,690 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:31,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:31,691 INFO L82 PathProgramCache]: Analyzing trace with hash -708840303, now seen corresponding path program 1 times [2019-11-24 06:05:31,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:31,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908091302] [2019-11-24 06:05:31,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:31,739 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:31,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908091302] [2019-11-24 06:05:31,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:31,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:31,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117271355] [2019-11-24 06:05:31,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:31,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:31,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:31,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:31,741 INFO L87 Difference]: Start difference. First operand 3273 states and 4571 transitions. Second operand 3 states. [2019-11-24 06:05:31,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:31,880 INFO L93 Difference]: Finished difference Result 5736 states and 8015 transitions. [2019-11-24 06:05:31,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:31,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-24 06:05:31,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:31,892 INFO L225 Difference]: With dead ends: 5736 [2019-11-24 06:05:31,892 INFO L226 Difference]: Without dead ends: 2476 [2019-11-24 06:05:31,897 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:31,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2019-11-24 06:05:32,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 2441. [2019-11-24 06:05:32,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2441 states. [2019-11-24 06:05:32,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 3320 transitions. [2019-11-24 06:05:32,066 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 3320 transitions. Word has length 66 [2019-11-24 06:05:32,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:32,066 INFO L462 AbstractCegarLoop]: Abstraction has 2441 states and 3320 transitions. [2019-11-24 06:05:32,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:32,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 3320 transitions. [2019-11-24 06:05:32,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-24 06:05:32,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:32,078 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:32,079 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:32,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:32,079 INFO L82 PathProgramCache]: Analyzing trace with hash -11997915, now seen corresponding path program 1 times [2019-11-24 06:05:32,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:32,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784551910] [2019-11-24 06:05:32,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:32,199 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:32,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784551910] [2019-11-24 06:05:32,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517499082] [2019-11-24 06:05:32,200 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:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:32,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-24 06:05:32,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:32,301 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:32,301 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:32,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:32,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:32,313 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:32,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:05:32,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [5] total 6 [2019-11-24 06:05:32,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145626176] [2019-11-24 06:05:32,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:32,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:32,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:32,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:32,315 INFO L87 Difference]: Start difference. First operand 2441 states and 3320 transitions. Second operand 3 states. [2019-11-24 06:05:32,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:32,456 INFO L93 Difference]: Finished difference Result 5948 states and 8104 transitions. [2019-11-24 06:05:32,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:32,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-24 06:05:32,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:32,472 INFO L225 Difference]: With dead ends: 5948 [2019-11-24 06:05:32,472 INFO L226 Difference]: Without dead ends: 3520 [2019-11-24 06:05:32,476 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 133 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:32,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3520 states. [2019-11-24 06:05:32,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3520 to 3516. [2019-11-24 06:05:32,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3516 states. [2019-11-24 06:05:32,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3516 states to 3516 states and 4737 transitions. [2019-11-24 06:05:32,609 INFO L78 Accepts]: Start accepts. Automaton has 3516 states and 4737 transitions. Word has length 67 [2019-11-24 06:05:32,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:32,610 INFO L462 AbstractCegarLoop]: Abstraction has 3516 states and 4737 transitions. [2019-11-24 06:05:32,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:32,610 INFO L276 IsEmpty]: Start isEmpty. Operand 3516 states and 4737 transitions. [2019-11-24 06:05:32,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-24 06:05:32,616 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:32,616 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:32,819 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:32,820 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:32,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:32,820 INFO L82 PathProgramCache]: Analyzing trace with hash -2051663368, now seen corresponding path program 1 times [2019-11-24 06:05:32,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:32,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093986841] [2019-11-24 06:05:32,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:32,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:32,897 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:32,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093986841] [2019-11-24 06:05:32,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:32,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 06:05:32,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687627506] [2019-11-24 06:05:32,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 06:05:32,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:32,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 06:05:32,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:32,900 INFO L87 Difference]: Start difference. First operand 3516 states and 4737 transitions. Second operand 6 states. [2019-11-24 06:05:33,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:33,162 INFO L93 Difference]: Finished difference Result 5197 states and 6969 transitions. [2019-11-24 06:05:33,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 06:05:33,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-24 06:05:33,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:33,182 INFO L225 Difference]: With dead ends: 5197 [2019-11-24 06:05:33,182 INFO L226 Difference]: Without dead ends: 3782 [2019-11-24 06:05:33,185 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-24 06:05:33,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3782 states. [2019-11-24 06:05:33,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3782 to 3587. [2019-11-24 06:05:33,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3587 states. [2019-11-24 06:05:33,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3587 states to 3587 states and 4843 transitions. [2019-11-24 06:05:33,314 INFO L78 Accepts]: Start accepts. Automaton has 3587 states and 4843 transitions. Word has length 68 [2019-11-24 06:05:33,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:33,314 INFO L462 AbstractCegarLoop]: Abstraction has 3587 states and 4843 transitions. [2019-11-24 06:05:33,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 06:05:33,314 INFO L276 IsEmpty]: Start isEmpty. Operand 3587 states and 4843 transitions. [2019-11-24 06:05:33,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-24 06:05:33,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:33,322 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:33,323 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:33,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:33,323 INFO L82 PathProgramCache]: Analyzing trace with hash -206610238, now seen corresponding path program 1 times [2019-11-24 06:05:33,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:33,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77179140] [2019-11-24 06:05:33,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:33,362 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:33,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77179140] [2019-11-24 06:05:33,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:33,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:33,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037455145] [2019-11-24 06:05:33,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:33,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:33,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:33,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:33,364 INFO L87 Difference]: Start difference. First operand 3587 states and 4843 transitions. Second operand 3 states. [2019-11-24 06:05:33,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:33,490 INFO L93 Difference]: Finished difference Result 6097 states and 8269 transitions. [2019-11-24 06:05:33,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:33,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-11-24 06:05:33,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:33,500 INFO L225 Difference]: With dead ends: 6097 [2019-11-24 06:05:33,500 INFO L226 Difference]: Without dead ends: 3601 [2019-11-24 06:05:33,504 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:33,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3601 states. [2019-11-24 06:05:33,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3601 to 3546. [2019-11-24 06:05:33,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3546 states. [2019-11-24 06:05:33,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3546 states to 3546 states and 4646 transitions. [2019-11-24 06:05:33,624 INFO L78 Accepts]: Start accepts. Automaton has 3546 states and 4646 transitions. Word has length 70 [2019-11-24 06:05:33,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:33,624 INFO L462 AbstractCegarLoop]: Abstraction has 3546 states and 4646 transitions. [2019-11-24 06:05:33,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:33,624 INFO L276 IsEmpty]: Start isEmpty. Operand 3546 states and 4646 transitions. [2019-11-24 06:05:33,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-24 06:05:33,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:33,631 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:33,631 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:33,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:33,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1346961949, now seen corresponding path program 1 times [2019-11-24 06:05:33,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:33,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455609017] [2019-11-24 06:05:33,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:33,694 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:33,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455609017] [2019-11-24 06:05:33,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:33,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:33,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673508972] [2019-11-24 06:05:33,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:33,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:33,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:33,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:33,697 INFO L87 Difference]: Start difference. First operand 3546 states and 4646 transitions. Second operand 4 states. [2019-11-24 06:05:33,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:33,888 INFO L93 Difference]: Finished difference Result 6018 states and 7888 transitions. [2019-11-24 06:05:33,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:33,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-11-24 06:05:33,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:33,899 INFO L225 Difference]: With dead ends: 6018 [2019-11-24 06:05:33,900 INFO L226 Difference]: Without dead ends: 3582 [2019-11-24 06:05:33,903 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:33,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3582 states. [2019-11-24 06:05:34,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3582 to 3546. [2019-11-24 06:05:34,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3546 states. [2019-11-24 06:05:34,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3546 states to 3546 states and 4562 transitions. [2019-11-24 06:05:34,026 INFO L78 Accepts]: Start accepts. Automaton has 3546 states and 4562 transitions. Word has length 70 [2019-11-24 06:05:34,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:34,027 INFO L462 AbstractCegarLoop]: Abstraction has 3546 states and 4562 transitions. [2019-11-24 06:05:34,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:34,027 INFO L276 IsEmpty]: Start isEmpty. Operand 3546 states and 4562 transitions. [2019-11-24 06:05:34,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-24 06:05:34,035 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:34,035 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:34,036 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:34,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:34,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1382798545, now seen corresponding path program 1 times [2019-11-24 06:05:34,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:34,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192037552] [2019-11-24 06:05:34,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:34,144 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:34,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192037552] [2019-11-24 06:05:34,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362722768] [2019-11-24 06:05:34,145 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:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:34,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-24 06:05:34,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:34,272 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:34,272 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:34,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:34,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:34,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:34,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:05:34,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [5] total 6 [2019-11-24 06:05:34,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054174916] [2019-11-24 06:05:34,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:34,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:34,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:34,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:34,291 INFO L87 Difference]: Start difference. First operand 3546 states and 4562 transitions. Second operand 3 states. [2019-11-24 06:05:34,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:34,510 INFO L93 Difference]: Finished difference Result 8611 states and 11076 transitions. [2019-11-24 06:05:34,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:34,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-24 06:05:34,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:34,522 INFO L225 Difference]: With dead ends: 8611 [2019-11-24 06:05:34,522 INFO L226 Difference]: Without dead ends: 5078 [2019-11-24 06:05:34,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 141 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:34,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5078 states. [2019-11-24 06:05:34,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5078 to 5074. [2019-11-24 06:05:34,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5074 states. [2019-11-24 06:05:34,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5074 states to 5074 states and 6431 transitions. [2019-11-24 06:05:34,777 INFO L78 Accepts]: Start accepts. Automaton has 5074 states and 6431 transitions. Word has length 71 [2019-11-24 06:05:34,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:34,777 INFO L462 AbstractCegarLoop]: Abstraction has 5074 states and 6431 transitions. [2019-11-24 06:05:34,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:34,777 INFO L276 IsEmpty]: Start isEmpty. Operand 5074 states and 6431 transitions. [2019-11-24 06:05:34,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-24 06:05:34,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:34,789 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:34,994 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:34,995 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:34,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:34,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1513057378, now seen corresponding path program 1 times [2019-11-24 06:05:34,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:34,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392135005] [2019-11-24 06:05:34,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:35,033 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:35,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392135005] [2019-11-24 06:05:35,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:35,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:35,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270224205] [2019-11-24 06:05:35,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:35,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:35,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:35,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:35,036 INFO L87 Difference]: Start difference. First operand 5074 states and 6431 transitions. Second operand 4 states. [2019-11-24 06:05:35,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:35,267 INFO L93 Difference]: Finished difference Result 10904 states and 14006 transitions. [2019-11-24 06:05:35,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:35,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-24 06:05:35,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:35,283 INFO L225 Difference]: With dead ends: 10904 [2019-11-24 06:05:35,283 INFO L226 Difference]: Without dead ends: 7385 [2019-11-24 06:05:35,289 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:35,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7385 states. [2019-11-24 06:05:35,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7385 to 5442. [2019-11-24 06:05:35,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5442 states. [2019-11-24 06:05:35,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5442 states to 5442 states and 6977 transitions. [2019-11-24 06:05:35,534 INFO L78 Accepts]: Start accepts. Automaton has 5442 states and 6977 transitions. Word has length 72 [2019-11-24 06:05:35,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:35,534 INFO L462 AbstractCegarLoop]: Abstraction has 5442 states and 6977 transitions. [2019-11-24 06:05:35,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:35,535 INFO L276 IsEmpty]: Start isEmpty. Operand 5442 states and 6977 transitions. [2019-11-24 06:05:35,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-24 06:05:35,541 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:35,542 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:35,542 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:35,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:35,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1253458963, now seen corresponding path program 1 times [2019-11-24 06:05:35,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:35,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308195671] [2019-11-24 06:05:35,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:35,624 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:35,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308195671] [2019-11-24 06:05:35,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:35,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 06:05:35,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225896725] [2019-11-24 06:05:35,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 06:05:35,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:35,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 06:05:35,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 06:05:35,626 INFO L87 Difference]: Start difference. First operand 5442 states and 6977 transitions. Second operand 7 states. [2019-11-24 06:05:36,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:36,029 INFO L93 Difference]: Finished difference Result 7188 states and 9142 transitions. [2019-11-24 06:05:36,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 06:05:36,030 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-11-24 06:05:36,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:36,040 INFO L225 Difference]: With dead ends: 7188 [2019-11-24 06:05:36,040 INFO L226 Difference]: Without dead ends: 5748 [2019-11-24 06:05:36,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-11-24 06:05:36,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5748 states. [2019-11-24 06:05:36,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5748 to 5468. [2019-11-24 06:05:36,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5468 states. [2019-11-24 06:05:36,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5468 states to 5468 states and 7010 transitions. [2019-11-24 06:05:36,269 INFO L78 Accepts]: Start accepts. Automaton has 5468 states and 7010 transitions. Word has length 72 [2019-11-24 06:05:36,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:36,269 INFO L462 AbstractCegarLoop]: Abstraction has 5468 states and 7010 transitions. [2019-11-24 06:05:36,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 06:05:36,270 INFO L276 IsEmpty]: Start isEmpty. Operand 5468 states and 7010 transitions. [2019-11-24 06:05:36,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-24 06:05:36,280 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:36,280 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-11-24 06:05:36,280 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:36,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:36,281 INFO L82 PathProgramCache]: Analyzing trace with hash 369309680, now seen corresponding path program 1 times [2019-11-24 06:05:36,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:36,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956860686] [2019-11-24 06:05:36,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:36,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956860686] [2019-11-24 06:05:36,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:36,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:36,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076519470] [2019-11-24 06:05:36,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:36,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:36,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:36,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:36,332 INFO L87 Difference]: Start difference. First operand 5468 states and 7010 transitions. Second operand 3 states. [2019-11-24 06:05:36,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:36,598 INFO L93 Difference]: Finished difference Result 9392 states and 12124 transitions. [2019-11-24 06:05:36,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:36,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-24 06:05:36,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:36,606 INFO L225 Difference]: With dead ends: 9392 [2019-11-24 06:05:36,606 INFO L226 Difference]: Without dead ends: 5488 [2019-11-24 06:05:36,612 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:36,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5488 states. [2019-11-24 06:05:36,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5488 to 5405. [2019-11-24 06:05:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5405 states. [2019-11-24 06:05:36,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5405 states to 5405 states and 6717 transitions. [2019-11-24 06:05:36,827 INFO L78 Accepts]: Start accepts. Automaton has 5405 states and 6717 transitions. Word has length 73 [2019-11-24 06:05:36,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:36,827 INFO L462 AbstractCegarLoop]: Abstraction has 5405 states and 6717 transitions. [2019-11-24 06:05:36,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:36,828 INFO L276 IsEmpty]: Start isEmpty. Operand 5405 states and 6717 transitions. [2019-11-24 06:05:36,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-24 06:05:36,835 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:36,835 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-11-24 06:05:36,835 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:36,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:36,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1657504209, now seen corresponding path program 1 times [2019-11-24 06:05:36,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:36,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503138417] [2019-11-24 06:05:36,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:36,880 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:36,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503138417] [2019-11-24 06:05:36,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:36,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:05:36,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239988949] [2019-11-24 06:05:36,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:36,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:36,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:36,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:36,882 INFO L87 Difference]: Start difference. First operand 5405 states and 6717 transitions. Second operand 3 states. [2019-11-24 06:05:37,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:37,059 INFO L93 Difference]: Finished difference Result 9216 states and 11490 transitions. [2019-11-24 06:05:37,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:37,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-24 06:05:37,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:37,066 INFO L225 Difference]: With dead ends: 9216 [2019-11-24 06:05:37,067 INFO L226 Difference]: Without dead ends: 5405 [2019-11-24 06:05:37,072 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:37,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5405 states. [2019-11-24 06:05:37,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5405 to 5405. [2019-11-24 06:05:37,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5405 states. [2019-11-24 06:05:37,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5405 states to 5405 states and 6597 transitions. [2019-11-24 06:05:37,301 INFO L78 Accepts]: Start accepts. Automaton has 5405 states and 6597 transitions. Word has length 73 [2019-11-24 06:05:37,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:37,301 INFO L462 AbstractCegarLoop]: Abstraction has 5405 states and 6597 transitions. [2019-11-24 06:05:37,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:37,301 INFO L276 IsEmpty]: Start isEmpty. Operand 5405 states and 6597 transitions. [2019-11-24 06:05:37,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-24 06:05:37,309 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:37,309 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:37,309 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:37,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:37,310 INFO L82 PathProgramCache]: Analyzing trace with hash -142695346, now seen corresponding path program 1 times [2019-11-24 06:05:37,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:37,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082544218] [2019-11-24 06:05:37,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:37,361 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:37,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082544218] [2019-11-24 06:05:37,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:37,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:37,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186388862] [2019-11-24 06:05:37,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:37,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:37,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:37,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:37,363 INFO L87 Difference]: Start difference. First operand 5405 states and 6597 transitions. Second operand 4 states. [2019-11-24 06:05:37,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:37,723 INFO L93 Difference]: Finished difference Result 10864 states and 13343 transitions. [2019-11-24 06:05:37,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:37,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-24 06:05:37,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:37,729 INFO L225 Difference]: With dead ends: 10864 [2019-11-24 06:05:37,729 INFO L226 Difference]: Without dead ends: 7227 [2019-11-24 06:05:37,733 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:37,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7227 states. [2019-11-24 06:05:37,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7227 to 5630. [2019-11-24 06:05:37,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5630 states. [2019-11-24 06:05:37,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5630 states to 5630 states and 6926 transitions. [2019-11-24 06:05:37,931 INFO L78 Accepts]: Start accepts. Automaton has 5630 states and 6926 transitions. Word has length 74 [2019-11-24 06:05:37,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:37,931 INFO L462 AbstractCegarLoop]: Abstraction has 5630 states and 6926 transitions. [2019-11-24 06:05:37,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:37,932 INFO L276 IsEmpty]: Start isEmpty. Operand 5630 states and 6926 transitions. [2019-11-24 06:05:37,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-24 06:05:37,938 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:37,939 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:37,939 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:37,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:37,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1854869926, now seen corresponding path program 1 times [2019-11-24 06:05:37,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:37,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128599545] [2019-11-24 06:05:37,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:38,010 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:38,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128599545] [2019-11-24 06:05:38,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499164097] [2019-11-24 06:05:38,011 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:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:38,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-24 06:05:38,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:38,178 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:38,178 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:38,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:38,236 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:38,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-24 06:05:38,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 5] total 12 [2019-11-24 06:05:38,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55521671] [2019-11-24 06:05:38,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 06:05:38,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:38,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 06:05:38,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-11-24 06:05:38,238 INFO L87 Difference]: Start difference. First operand 5630 states and 6926 transitions. Second operand 6 states. [2019-11-24 06:05:38,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:38,564 INFO L93 Difference]: Finished difference Result 14610 states and 17702 transitions. [2019-11-24 06:05:38,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 06:05:38,566 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-11-24 06:05:38,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:38,572 INFO L225 Difference]: With dead ends: 14610 [2019-11-24 06:05:38,572 INFO L226 Difference]: Without dead ends: 6585 [2019-11-24 06:05:38,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-11-24 06:05:38,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6585 states. [2019-11-24 06:05:38,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6585 to 6066. [2019-11-24 06:05:38,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6066 states. [2019-11-24 06:05:38,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6066 states to 6066 states and 7087 transitions. [2019-11-24 06:05:38,808 INFO L78 Accepts]: Start accepts. Automaton has 6066 states and 7087 transitions. Word has length 75 [2019-11-24 06:05:38,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:38,808 INFO L462 AbstractCegarLoop]: Abstraction has 6066 states and 7087 transitions. [2019-11-24 06:05:38,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 06:05:38,808 INFO L276 IsEmpty]: Start isEmpty. Operand 6066 states and 7087 transitions. [2019-11-24 06:05:38,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-24 06:05:38,813 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:38,813 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-11-24 06:05:39,016 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:39,017 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:39,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:39,017 INFO L82 PathProgramCache]: Analyzing trace with hash 822473010, now seen corresponding path program 1 times [2019-11-24 06:05:39,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:39,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441115038] [2019-11-24 06:05:39,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:39,061 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:39,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441115038] [2019-11-24 06:05:39,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:39,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:39,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521492581] [2019-11-24 06:05:39,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:39,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:39,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:39,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:39,063 INFO L87 Difference]: Start difference. First operand 6066 states and 7087 transitions. Second operand 4 states. [2019-11-24 06:05:39,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:39,372 INFO L93 Difference]: Finished difference Result 10666 states and 12460 transitions. [2019-11-24 06:05:39,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:39,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-24 06:05:39,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:39,377 INFO L225 Difference]: With dead ends: 10666 [2019-11-24 06:05:39,378 INFO L226 Difference]: Without dead ends: 5950 [2019-11-24 06:05:39,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:39,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5950 states. [2019-11-24 06:05:39,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5950 to 4806. [2019-11-24 06:05:39,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4806 states. [2019-11-24 06:05:39,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4806 states to 4806 states and 5506 transitions. [2019-11-24 06:05:39,525 INFO L78 Accepts]: Start accepts. Automaton has 4806 states and 5506 transitions. Word has length 75 [2019-11-24 06:05:39,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:39,525 INFO L462 AbstractCegarLoop]: Abstraction has 4806 states and 5506 transitions. [2019-11-24 06:05:39,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:39,526 INFO L276 IsEmpty]: Start isEmpty. Operand 4806 states and 5506 transitions. [2019-11-24 06:05:39,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-24 06:05:39,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:39,531 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:39,531 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:39,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:39,531 INFO L82 PathProgramCache]: Analyzing trace with hash -234390366, now seen corresponding path program 1 times [2019-11-24 06:05:39,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:39,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630686016] [2019-11-24 06:05:39,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:39,577 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:39,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630686016] [2019-11-24 06:05:39,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:39,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:39,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712013536] [2019-11-24 06:05:39,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:39,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:39,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:39,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:39,579 INFO L87 Difference]: Start difference. First operand 4806 states and 5506 transitions. Second operand 4 states. [2019-11-24 06:05:39,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:39,912 INFO L93 Difference]: Finished difference Result 8443 states and 9681 transitions. [2019-11-24 06:05:39,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:39,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-24 06:05:39,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:39,918 INFO L225 Difference]: With dead ends: 8443 [2019-11-24 06:05:39,918 INFO L226 Difference]: Without dead ends: 4378 [2019-11-24 06:05:39,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:39,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4378 states. [2019-11-24 06:05:40,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4378 to 3584. [2019-11-24 06:05:40,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3584 states. [2019-11-24 06:05:40,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 4025 transitions. [2019-11-24 06:05:40,186 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 4025 transitions. Word has length 96 [2019-11-24 06:05:40,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:40,186 INFO L462 AbstractCegarLoop]: Abstraction has 3584 states and 4025 transitions. [2019-11-24 06:05:40,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:40,187 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 4025 transitions. [2019-11-24 06:05:40,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-24 06:05:40,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:40,194 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:40,194 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:40,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:40,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1546744589, now seen corresponding path program 1 times [2019-11-24 06:05:40,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:40,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633468935] [2019-11-24 06:05:40,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:40,432 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:05:40,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633468935] [2019-11-24 06:05:40,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:40,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 06:05:40,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973439354] [2019-11-24 06:05:40,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 06:05:40,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:40,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 06:05:40,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:40,436 INFO L87 Difference]: Start difference. First operand 3584 states and 4025 transitions. Second operand 6 states. [2019-11-24 06:05:41,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:41,110 INFO L93 Difference]: Finished difference Result 13215 states and 14699 transitions. [2019-11-24 06:05:41,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 06:05:41,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-11-24 06:05:41,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:41,120 INFO L225 Difference]: With dead ends: 13215 [2019-11-24 06:05:41,120 INFO L226 Difference]: Without dead ends: 11771 [2019-11-24 06:05:41,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:41,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11771 states. [2019-11-24 06:05:41,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11771 to 6458. [2019-11-24 06:05:41,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6458 states. [2019-11-24 06:05:41,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6458 states to 6458 states and 7189 transitions. [2019-11-24 06:05:41,384 INFO L78 Accepts]: Start accepts. Automaton has 6458 states and 7189 transitions. Word has length 118 [2019-11-24 06:05:41,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:41,384 INFO L462 AbstractCegarLoop]: Abstraction has 6458 states and 7189 transitions. [2019-11-24 06:05:41,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 06:05:41,384 INFO L276 IsEmpty]: Start isEmpty. Operand 6458 states and 7189 transitions. [2019-11-24 06:05:41,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-24 06:05:41,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:41,391 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:41,391 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:41,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:41,391 INFO L82 PathProgramCache]: Analyzing trace with hash -715255796, now seen corresponding path program 1 times [2019-11-24 06:05:41,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:41,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644105793] [2019-11-24 06:05:41,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-24 06:05:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-24 06:05:41,531 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-24 06:05:41,531 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-24 06:05:41,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 06:05:41 BoogieIcfgContainer [2019-11-24 06:05:41,686 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 06:05:41,688 INFO L168 Benchmark]: Toolchain (without parser) took 16571.14 ms. Allocated memory was 145.8 MB in the beginning and 829.4 MB in the end (delta: 683.7 MB). Free memory was 102.8 MB in the beginning and 82.0 MB in the end (delta: 20.8 MB). Peak memory consumption was 704.5 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:41,689 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 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:41,689 INFO L168 Benchmark]: CACSL2BoogieTranslator took 429.41 ms. Allocated memory was 145.8 MB in the beginning and 175.1 MB in the end (delta: 29.4 MB). Free memory was 102.6 MB in the beginning and 142.4 MB in the end (delta: -39.8 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:41,690 INFO L168 Benchmark]: Boogie Procedure Inliner took 141.71 ms. Allocated memory was 175.1 MB in the beginning and 227.0 MB in the end (delta: 51.9 MB). Free memory was 142.4 MB in the beginning and 209.6 MB in the end (delta: -67.2 MB). Peak memory consumption was 737.1 kB. Max. memory is 7.1 GB. [2019-11-24 06:05:41,690 INFO L168 Benchmark]: Boogie Preprocessor took 58.21 ms. Allocated memory is still 227.0 MB. Free memory was 209.6 MB in the beginning and 206.0 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:41,691 INFO L168 Benchmark]: RCFGBuilder took 1994.00 ms. Allocated memory was 227.0 MB in the beginning and 254.8 MB in the end (delta: 27.8 MB). Free memory was 206.0 MB in the beginning and 147.2 MB in the end (delta: 58.8 MB). Peak memory consumption was 125.8 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:41,692 INFO L168 Benchmark]: TraceAbstraction took 13943.26 ms. Allocated memory was 254.8 MB in the beginning and 829.4 MB in the end (delta: 574.6 MB). Free memory was 147.2 MB in the beginning and 82.0 MB in the end (delta: 65.2 MB). Peak memory consumption was 639.8 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:41,695 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 429.41 ms. Allocated memory was 145.8 MB in the beginning and 175.1 MB in the end (delta: 29.4 MB). Free memory was 102.6 MB in the beginning and 142.4 MB in the end (delta: -39.8 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 141.71 ms. Allocated memory was 175.1 MB in the beginning and 227.0 MB in the end (delta: 51.9 MB). Free memory was 142.4 MB in the beginning and 209.6 MB in the end (delta: -67.2 MB). Peak memory consumption was 737.1 kB. Max. memory is 7.1 GB. * Boogie Preprocessor took 58.21 ms. Allocated memory is still 227.0 MB. Free memory was 209.6 MB in the beginning and 206.0 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1994.00 ms. Allocated memory was 227.0 MB in the beginning and 254.8 MB in the end (delta: 27.8 MB). Free memory was 206.0 MB in the beginning and 147.2 MB in the end (delta: 58.8 MB). Peak memory consumption was 125.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13943.26 ms. Allocated memory was 254.8 MB in the beginning and 829.4 MB in the end (delta: 574.6 MB). Free memory was 147.2 MB in the beginning and 82.0 MB in the end (delta: 65.2 MB). Peak memory consumption was 639.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int t2_pc = 0; [L17] int t3_pc = 0; [L18] int m_st ; [L19] int t1_st ; [L20] int t2_st ; [L21] int t3_st ; [L22] int m_i ; [L23] int t1_i ; [L24] int t2_i ; [L25] int t3_i ; [L26] int M_E = 2; [L27] int T1_E = 2; [L28] int T2_E = 2; [L29] int T3_E = 2; [L30] int E_M = 2; [L31] int E_1 = 2; [L32] int E_2 = 2; [L33] int E_3 = 2; [L39] int token ; [L41] int local ; [L725] int __retres1 ; [L638] m_i = 1 [L639] t1_i = 1 [L640] t2_i = 1 [L641] t3_i = 1 [L666] int kernel_st ; [L667] int tmp ; [L668] int tmp___0 ; [L672] kernel_st = 0 [L294] COND TRUE m_i == 1 [L295] m_st = 0 [L299] COND TRUE t1_i == 1 [L300] t1_st = 0 [L304] COND TRUE t2_i == 1 [L305] t2_st = 0 [L309] COND TRUE t3_i == 1 [L310] t3_st = 0 [L431] COND FALSE !(M_E == 0) [L436] COND FALSE !(T1_E == 0) [L441] COND FALSE !(T2_E == 0) [L446] COND FALSE !(T3_E == 0) [L451] COND FALSE !(E_M == 0) [L456] COND FALSE !(E_1 == 0) [L461] COND FALSE !(E_2 == 0) [L466] COND FALSE !(E_3 == 0) [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; [L207] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L210] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L220] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L222] return (__retres1); [L531] tmp = is_master_triggered() [L533] COND FALSE !(\read(tmp)) [L226] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L229] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L239] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L241] return (__retres1); [L539] tmp___0 = is_transmit1_triggered() [L541] COND FALSE !(\read(tmp___0)) [L245] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L248] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L258] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L260] return (__retres1); [L547] tmp___1 = is_transmit2_triggered() [L549] COND FALSE !(\read(tmp___1)) [L264] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L267] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L277] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L279] return (__retres1); [L555] tmp___2 = is_transmit3_triggered() [L557] COND FALSE !(\read(tmp___2)) [L479] COND FALSE !(M_E == 1) [L484] COND FALSE !(T1_E == 1) [L489] COND FALSE !(T2_E == 1) [L494] COND FALSE !(T3_E == 1) [L499] COND FALSE !(E_M == 1) [L504] COND FALSE !(E_1 == 1) [L509] COND FALSE !(E_2 == 1) [L514] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L680] COND TRUE 1 [L683] kernel_st = 1 [L350] int tmp ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L354] COND TRUE 1 [L319] int __retres1 ; [L322] COND TRUE m_st == 0 [L323] __retres1 = 1 [L345] return (__retres1); [L357] tmp = exists_runnable_thread() [L359] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L364] COND TRUE m_st == 0 [L365] int tmp_ndt_1; [L366] tmp_ndt_1 = __VERIFIER_nondet_int() [L367] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L378] COND TRUE t1_st == 0 [L379] int tmp_ndt_2; [L380] tmp_ndt_2 = __VERIFIER_nondet_int() [L381] COND TRUE \read(tmp_ndt_2) [L383] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L102] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L113] COND TRUE 1 [L115] t1_pc = 1 [L116] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L392] COND TRUE t2_st == 0 [L393] int tmp_ndt_3; [L394] tmp_ndt_3 = __VERIFIER_nondet_int() [L395] COND TRUE \read(tmp_ndt_3) [L397] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L138] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L149] COND TRUE 1 [L151] t2_pc = 1 [L152] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L406] COND TRUE t3_st == 0 [L407] int tmp_ndt_4; [L408] tmp_ndt_4 = __VERIFIER_nondet_int() [L409] COND TRUE \read(tmp_ndt_4) [L411] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L174] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L185] COND TRUE 1 [L187] t3_pc = 1 [L188] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L354] COND TRUE 1 [L319] int __retres1 ; [L322] COND TRUE m_st == 0 [L323] __retres1 = 1 [L345] return (__retres1); [L357] tmp = exists_runnable_thread() [L359] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L364] COND TRUE m_st == 0 [L365] int tmp_ndt_1; [L366] tmp_ndt_1 = __VERIFIER_nondet_int() [L367] COND TRUE \read(tmp_ndt_1) [L369] m_st = 1 [L44] int tmp_var = __VERIFIER_nondet_int(); [L46] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L57] COND TRUE 1 [L60] token = __VERIFIER_nondet_int() [L61] local = token [L62] E_1 = 1 [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; [L207] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L210] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L220] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L222] return (__retres1); [L531] tmp = is_master_triggered() [L533] COND FALSE !(\read(tmp)) [L226] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L229] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L230] COND TRUE E_1 == 1 [L231] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L241] return (__retres1); [L539] tmp___0 = is_transmit1_triggered() [L541] COND TRUE \read(tmp___0) [L542] t1_st = 0 [L245] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L248] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L249] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L258] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L260] return (__retres1); [L547] tmp___1 = is_transmit2_triggered() [L549] COND FALSE !(\read(tmp___1)) [L264] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L267] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L268] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L277] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L279] return (__retres1); [L555] tmp___2 = is_transmit3_triggered() [L557] COND FALSE !(\read(tmp___2)) [L64] E_1 = 2 [L65] m_pc = 1 [L66] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L378] COND TRUE t1_st == 0 [L379] int tmp_ndt_2; [L380] tmp_ndt_2 = __VERIFIER_nondet_int() [L381] COND TRUE \read(tmp_ndt_2) [L383] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L102] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L105] COND TRUE t1_pc == 1 [L121] token += 1 [L122] E_2 = 1 [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; [L207] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L210] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L211] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L220] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L222] return (__retres1); [L531] tmp = is_master_triggered() [L533] COND FALSE !(\read(tmp)) [L226] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L229] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L230] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L239] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L241] return (__retres1); [L539] tmp___0 = is_transmit1_triggered() [L541] COND FALSE !(\read(tmp___0)) [L245] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L248] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L249] COND TRUE E_2 == 1 [L250] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L260] return (__retres1); [L547] tmp___1 = is_transmit2_triggered() [L549] COND TRUE \read(tmp___1) [L550] t2_st = 0 [L264] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L267] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L268] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L277] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L279] return (__retres1); [L555] tmp___2 = is_transmit3_triggered() [L557] COND FALSE !(\read(tmp___2)) [L124] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L113] COND TRUE 1 [L115] t1_pc = 1 [L116] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L392] COND TRUE t2_st == 0 [L393] int tmp_ndt_3; [L394] tmp_ndt_3 = __VERIFIER_nondet_int() [L395] COND TRUE \read(tmp_ndt_3) [L397] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L138] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L141] COND TRUE t2_pc == 1 [L157] token += 1 [L158] E_3 = 1 [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; [L207] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L210] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L211] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L220] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L222] return (__retres1); [L531] tmp = is_master_triggered() [L533] COND FALSE !(\read(tmp)) [L226] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L229] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L230] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L239] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L241] return (__retres1); [L539] tmp___0 = is_transmit1_triggered() [L541] COND FALSE !(\read(tmp___0)) [L245] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L248] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L249] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L258] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L260] return (__retres1); [L547] tmp___1 = is_transmit2_triggered() [L549] COND FALSE !(\read(tmp___1)) [L264] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L267] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L268] COND TRUE E_3 == 1 [L269] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L279] return (__retres1); [L555] tmp___2 = is_transmit3_triggered() [L557] COND TRUE \read(tmp___2) [L558] t3_st = 0 [L160] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L149] COND TRUE 1 [L151] t2_pc = 1 [L152] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L406] COND TRUE t3_st == 0 [L407] int tmp_ndt_4; [L408] tmp_ndt_4 = __VERIFIER_nondet_int() [L409] COND TRUE \read(tmp_ndt_4) [L411] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L174] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L177] COND TRUE t3_pc == 1 [L193] token += 1 [L194] E_M = 1 [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; [L207] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L210] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L211] COND TRUE E_M == 1 [L212] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L222] return (__retres1); [L531] tmp = is_master_triggered() [L533] COND TRUE \read(tmp) [L534] m_st = 0 [L226] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L229] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L230] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L239] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L241] return (__retres1); [L539] tmp___0 = is_transmit1_triggered() [L541] COND FALSE !(\read(tmp___0)) [L245] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L248] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L249] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L258] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L260] return (__retres1); [L547] tmp___1 = is_transmit2_triggered() [L549] COND FALSE !(\read(tmp___1)) [L264] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L267] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L268] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L277] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L279] return (__retres1); [L555] tmp___2 = is_transmit3_triggered() [L557] COND FALSE !(\read(tmp___2)) [L196] E_M = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L185] COND TRUE 1 [L187] t3_pc = 1 [L188] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L354] COND TRUE 1 [L319] int __retres1 ; [L322] COND TRUE m_st == 0 [L323] __retres1 = 1 [L345] return (__retres1); [L357] tmp = exists_runnable_thread() [L359] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L364] COND TRUE m_st == 0 [L365] int tmp_ndt_1; [L366] tmp_ndt_1 = __VERIFIER_nondet_int() [L367] COND TRUE \read(tmp_ndt_1) [L369] m_st = 1 [L44] int tmp_var = __VERIFIER_nondet_int(); [L46] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L49] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L71] COND FALSE !(token != local + 3) [L76] COND TRUE tmp_var <= 5 [L77] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L82] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L83] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L84] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L10] __VERIFIER_error() VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.8s, OverallIterations: 26, TraceHistogramMax: 3, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6648 SDtfs, 5413 SDslu, 6831 SDs, 0 SdLazy, 869 SolverSat, 235 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 671 GetRequests, 594 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6458occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 12866 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2048 NumberOfCodeBlocks, 2048 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2170 ConstructedInterpolants, 0 QuantifiedInterpolants, 383446 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1260 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 33 InterpolantComputations, 28 PerfectInterpolantSequences, 365/379 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...