/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.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 06:05:14,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 06:05:14,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 06:05:14,657 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 06:05:14,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 06:05:14,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 06:05:14,663 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 06:05:14,666 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 06:05:14,667 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 06:05:14,670 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 06:05:14,671 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 06:05:14,674 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 06:05:14,674 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 06:05:14,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 06:05:14,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 06:05:14,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 06:05:14,687 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 06:05:14,688 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 06:05:14,691 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 06:05:14,693 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 06:05:14,696 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 06:05:14,697 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 06:05:14,697 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 06:05:14,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 06:05:14,703 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 06:05:14,703 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 06:05:14,703 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 06:05:14,706 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 06:05:14,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 06:05:14,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 06:05:14,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 06:05:14,711 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 06:05:14,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 06:05:14,712 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 06:05:14,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 06:05:14,715 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 06:05:14,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 06:05:14,716 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 06:05:14,716 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 06:05:14,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 06:05:14,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 06:05:14,718 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:14,735 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 06:05:14,735 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 06:05:14,736 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 06:05:14,736 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 06:05:14,737 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 06:05:14,737 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 06:05:14,737 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 06:05:14,737 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 06:05:14,737 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 06:05:14,738 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 06:05:14,738 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 06:05:14,738 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 06:05:14,738 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 06:05:14,738 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 06:05:14,739 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 06:05:14,739 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 06:05:14,740 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 06:05:14,740 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 06:05:14,740 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 06:05:14,740 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 06:05:14,740 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 06:05:14,741 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 06:05:14,741 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 06:05:14,741 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 06:05:14,741 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 06:05:14,741 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 06:05:14,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 06:05:14,742 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 06:05:14,742 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 06:05:14,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 06:05:14,742 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 06:05:14,743 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 06:05:14,743 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 06:05:14,743 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 06:05:14,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 06:05:14,743 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 06:05:14,744 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 06:05:14,744 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 06:05:15,022 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 06:05:15,043 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 06:05:15,046 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 06:05:15,047 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 06:05:15,048 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 06:05:15,049 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2019-11-24 06:05:15,123 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99112f69f/9f7bcd6f3100412fa9f7037d0f49ed5e/FLAG638998c54 [2019-11-24 06:05:15,624 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 06:05:15,624 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2019-11-24 06:05:15,634 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99112f69f/9f7bcd6f3100412fa9f7037d0f49ed5e/FLAG638998c54 [2019-11-24 06:05:16,026 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99112f69f/9f7bcd6f3100412fa9f7037d0f49ed5e [2019-11-24 06:05:16,036 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 06:05:16,038 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 06:05:16,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 06:05:16,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 06:05:16,043 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 06:05:16,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:05:16" (1/1) ... [2019-11-24 06:05:16,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b68018e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:16, skipping insertion in model container [2019-11-24 06:05:16,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:05:16" (1/1) ... [2019-11-24 06:05:16,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 06:05:16,085 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 06:05:16,280 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:05:16,285 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 06:05:16,427 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:05:16,455 INFO L208 MainTranslator]: Completed translation [2019-11-24 06:05:16,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:16 WrapperNode [2019-11-24 06:05:16,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 06:05:16,457 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 06:05:16,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 06:05:16,457 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 06:05:16,464 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:16" (1/1) ... [2019-11-24 06:05:16,471 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:16" (1/1) ... [2019-11-24 06:05:16,519 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 06:05:16,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 06:05:16,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 06:05:16,520 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 06:05:16,529 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:16" (1/1) ... [2019-11-24 06:05:16,529 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:16" (1/1) ... [2019-11-24 06:05:16,532 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:16" (1/1) ... [2019-11-24 06:05:16,532 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:16" (1/1) ... [2019-11-24 06:05:16,540 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:16" (1/1) ... [2019-11-24 06:05:16,549 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:16" (1/1) ... [2019-11-24 06:05:16,552 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:16" (1/1) ... [2019-11-24 06:05:16,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 06:05:16,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 06:05:16,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 06:05:16,558 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 06:05:16,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:16" (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:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 06:05:16,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 06:05:17,815 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 06:05:17,815 INFO L284 CfgBuilder]: Removed 82 assume(true) statements. [2019-11-24 06:05:17,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:05:17 BoogieIcfgContainer [2019-11-24 06:05:17,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 06:05:17,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 06:05:17,818 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 06:05:17,821 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 06:05:17,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 06:05:16" (1/3) ... [2019-11-24 06:05:17,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc80e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:05:17, skipping insertion in model container [2019-11-24 06:05:17,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:16" (2/3) ... [2019-11-24 06:05:17,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc80e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:05:17, skipping insertion in model container [2019-11-24 06:05:17,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:05:17" (3/3) ... [2019-11-24 06:05:17,825 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2019-11-24 06:05:17,835 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 06:05:17,842 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-24 06:05:17,854 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-24 06:05:17,879 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 06:05:17,879 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 06:05:17,879 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 06:05:17,879 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 06:05:17,880 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 06:05:17,880 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 06:05:17,880 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 06:05:17,880 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 06:05:17,897 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2019-11-24 06:05:17,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 06:05:17,904 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:17,905 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:17,905 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:17,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:17,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1923368619, now seen corresponding path program 1 times [2019-11-24 06:05:17,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:17,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784126081] [2019-11-24 06:05:17,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:18,115 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:18,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784126081] [2019-11-24 06:05:18,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:18,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:05:18,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530631491] [2019-11-24 06:05:18,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:18,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:18,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:18,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:18,142 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 3 states. [2019-11-24 06:05:18,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:18,257 INFO L93 Difference]: Finished difference Result 177 states and 273 transitions. [2019-11-24 06:05:18,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:18,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-24 06:05:18,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:18,280 INFO L225 Difference]: With dead ends: 177 [2019-11-24 06:05:18,280 INFO L226 Difference]: Without dead ends: 111 [2019-11-24 06:05:18,286 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:18,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-24 06:05:18,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2019-11-24 06:05:18,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-24 06:05:18,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2019-11-24 06:05:18,340 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 16 [2019-11-24 06:05:18,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:18,341 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2019-11-24 06:05:18,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:18,341 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2019-11-24 06:05:18,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 06:05:18,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:18,342 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:18,342 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:18,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:18,343 INFO L82 PathProgramCache]: Analyzing trace with hash 635174090, now seen corresponding path program 1 times [2019-11-24 06:05:18,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:18,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625315875] [2019-11-24 06:05:18,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:18,430 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:18,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625315875] [2019-11-24 06:05:18,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:18,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:05:18,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945282738] [2019-11-24 06:05:18,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:18,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:18,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:18,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:18,441 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand 3 states. [2019-11-24 06:05:18,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:18,528 INFO L93 Difference]: Finished difference Result 286 states and 414 transitions. [2019-11-24 06:05:18,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:18,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-24 06:05:18,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:18,534 INFO L225 Difference]: With dead ends: 286 [2019-11-24 06:05:18,534 INFO L226 Difference]: Without dead ends: 182 [2019-11-24 06:05:18,538 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:18,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-24 06:05:18,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 171. [2019-11-24 06:05:18,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-24 06:05:18,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 239 transitions. [2019-11-24 06:05:18,576 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 239 transitions. Word has length 16 [2019-11-24 06:05:18,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:18,577 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 239 transitions. [2019-11-24 06:05:18,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:18,577 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 239 transitions. [2019-11-24 06:05:18,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-24 06:05:18,579 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:18,580 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] [2019-11-24 06:05:18,580 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:18,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:18,581 INFO L82 PathProgramCache]: Analyzing trace with hash 309332967, now seen corresponding path program 1 times [2019-11-24 06:05:18,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:18,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737508578] [2019-11-24 06:05:18,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:18,677 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:18,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737508578] [2019-11-24 06:05:18,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:18,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:18,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257772863] [2019-11-24 06:05:18,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:18,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:18,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:18,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:18,680 INFO L87 Difference]: Start difference. First operand 171 states and 239 transitions. Second operand 4 states. [2019-11-24 06:05:18,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:18,750 INFO L93 Difference]: Finished difference Result 419 states and 600 transitions. [2019-11-24 06:05:18,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:18,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-11-24 06:05:18,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:18,754 INFO L225 Difference]: With dead ends: 419 [2019-11-24 06:05:18,754 INFO L226 Difference]: Without dead ends: 255 [2019-11-24 06:05:18,755 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:18,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-24 06:05:18,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 201. [2019-11-24 06:05:18,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-11-24 06:05:18,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 287 transitions. [2019-11-24 06:05:18,774 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 287 transitions. Word has length 29 [2019-11-24 06:05:18,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:18,775 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 287 transitions. [2019-11-24 06:05:18,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:18,775 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 287 transitions. [2019-11-24 06:05:18,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-24 06:05:18,778 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:18,778 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] [2019-11-24 06:05:18,778 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:18,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:18,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1736081379, now seen corresponding path program 1 times [2019-11-24 06:05:18,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:18,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774298787] [2019-11-24 06:05:18,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:18,875 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:18,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774298787] [2019-11-24 06:05:18,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:18,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:18,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233654345] [2019-11-24 06:05:18,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:18,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:18,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:18,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:18,877 INFO L87 Difference]: Start difference. First operand 201 states and 287 transitions. Second operand 3 states. [2019-11-24 06:05:18,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:18,912 INFO L93 Difference]: Finished difference Result 329 states and 473 transitions. [2019-11-24 06:05:18,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:18,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-24 06:05:18,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:18,914 INFO L225 Difference]: With dead ends: 329 [2019-11-24 06:05:18,915 INFO L226 Difference]: Without dead ends: 212 [2019-11-24 06:05:18,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:18,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-11-24 06:05:18,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 201. [2019-11-24 06:05:18,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-11-24 06:05:18,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 276 transitions. [2019-11-24 06:05:18,933 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 276 transitions. Word has length 42 [2019-11-24 06:05:18,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:18,933 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 276 transitions. [2019-11-24 06:05:18,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:18,933 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 276 transitions. [2019-11-24 06:05:18,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-24 06:05:18,938 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:18,938 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] [2019-11-24 06:05:18,938 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:18,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:18,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1418534206, now seen corresponding path program 1 times [2019-11-24 06:05:18,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:18,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884224400] [2019-11-24 06:05:18,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:19,088 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:19,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884224400] [2019-11-24 06:05:19,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:19,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:19,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129402198] [2019-11-24 06:05:19,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:19,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:19,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:19,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:19,091 INFO L87 Difference]: Start difference. First operand 201 states and 276 transitions. Second operand 4 states. [2019-11-24 06:05:19,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:19,131 INFO L93 Difference]: Finished difference Result 319 states and 441 transitions. [2019-11-24 06:05:19,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:19,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-24 06:05:19,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:19,133 INFO L225 Difference]: With dead ends: 319 [2019-11-24 06:05:19,134 INFO L226 Difference]: Without dead ends: 206 [2019-11-24 06:05:19,135 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:19,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-11-24 06:05:19,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 201. [2019-11-24 06:05:19,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-11-24 06:05:19,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 270 transitions. [2019-11-24 06:05:19,152 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 270 transitions. Word has length 42 [2019-11-24 06:05:19,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:19,153 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 270 transitions. [2019-11-24 06:05:19,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:19,153 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 270 transitions. [2019-11-24 06:05:19,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 06:05:19,159 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:19,160 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] [2019-11-24 06:05:19,160 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:19,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:19,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1532541634, now seen corresponding path program 1 times [2019-11-24 06:05:19,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:19,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480245786] [2019-11-24 06:05:19,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:19,308 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:19,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480245786] [2019-11-24 06:05:19,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510023938] [2019-11-24 06:05:19,310 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:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:19,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-24 06:05:19,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:19,441 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:19,442 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:19,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:19,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:19,459 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:19,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:05:19,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [5] total 6 [2019-11-24 06:05:19,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068918335] [2019-11-24 06:05:19,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:19,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:19,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:19,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:19,461 INFO L87 Difference]: Start difference. First operand 201 states and 270 transitions. Second operand 3 states. [2019-11-24 06:05:19,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:19,515 INFO L93 Difference]: Finished difference Result 475 states and 639 transitions. [2019-11-24 06:05:19,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:19,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-24 06:05:19,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:19,517 INFO L225 Difference]: With dead ends: 475 [2019-11-24 06:05:19,518 INFO L226 Difference]: Without dead ends: 281 [2019-11-24 06:05:19,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 85 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:19,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-24 06:05:19,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 277. [2019-11-24 06:05:19,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-24 06:05:19,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 366 transitions. [2019-11-24 06:05:19,535 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 366 transitions. Word has length 43 [2019-11-24 06:05:19,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:19,536 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 366 transitions. [2019-11-24 06:05:19,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:19,536 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 366 transitions. [2019-11-24 06:05:19,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-24 06:05:19,538 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:19,538 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] [2019-11-24 06:05:19,741 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:19,741 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:19,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:19,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1270401842, now seen corresponding path program 1 times [2019-11-24 06:05:19,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:19,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198721478] [2019-11-24 06:05:19,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:19,814 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:19,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198721478] [2019-11-24 06:05:19,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025600542] [2019-11-24 06:05:19,815 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:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:19,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-24 06:05:19,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:19,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:19,920 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:19,920 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:19,948 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:19,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:05:19,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [6] total 9 [2019-11-24 06:05:19,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981714415] [2019-11-24 06:05:19,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 06:05:19,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:19,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 06:05:19,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-24 06:05:19,951 INFO L87 Difference]: Start difference. First operand 277 states and 366 transitions. Second operand 8 states. [2019-11-24 06:05:20,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:20,247 INFO L93 Difference]: Finished difference Result 591 states and 799 transitions. [2019-11-24 06:05:20,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-24 06:05:20,248 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-11-24 06:05:20,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:20,250 INFO L225 Difference]: With dead ends: 591 [2019-11-24 06:05:20,250 INFO L226 Difference]: Without dead ends: 321 [2019-11-24 06:05:20,251 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2019-11-24 06:05:20,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-11-24 06:05:20,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 199. [2019-11-24 06:05:20,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-11-24 06:05:20,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 264 transitions. [2019-11-24 06:05:20,265 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 264 transitions. Word has length 44 [2019-11-24 06:05:20,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:20,267 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 264 transitions. [2019-11-24 06:05:20,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 06:05:20,267 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 264 transitions. [2019-11-24 06:05:20,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 06:05:20,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:20,269 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-24 06:05:20,472 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:20,473 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:20,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:20,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1926319797, now seen corresponding path program 1 times [2019-11-24 06:05:20,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:20,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546661329] [2019-11-24 06:05:20,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:20,526 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:20,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546661329] [2019-11-24 06:05:20,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:20,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:20,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797417850] [2019-11-24 06:05:20,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:20,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:20,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:20,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:20,529 INFO L87 Difference]: Start difference. First operand 199 states and 264 transitions. Second operand 4 states. [2019-11-24 06:05:20,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:20,583 INFO L93 Difference]: Finished difference Result 478 states and 638 transitions. [2019-11-24 06:05:20,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:20,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-11-24 06:05:20,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:20,597 INFO L225 Difference]: With dead ends: 478 [2019-11-24 06:05:20,597 INFO L226 Difference]: Without dead ends: 301 [2019-11-24 06:05:20,598 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:20,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-24 06:05:20,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 203. [2019-11-24 06:05:20,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-24 06:05:20,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 270 transitions. [2019-11-24 06:05:20,612 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 270 transitions. Word has length 46 [2019-11-24 06:05:20,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:20,612 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 270 transitions. [2019-11-24 06:05:20,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:20,613 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 270 transitions. [2019-11-24 06:05:20,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 06:05:20,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:20,614 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] [2019-11-24 06:05:20,614 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:20,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:20,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1663235962, now seen corresponding path program 1 times [2019-11-24 06:05:20,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:20,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539064230] [2019-11-24 06:05:20,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:20,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539064230] [2019-11-24 06:05:20,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:20,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:20,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67538785] [2019-11-24 06:05:20,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:20,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:20,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:20,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:20,673 INFO L87 Difference]: Start difference. First operand 203 states and 270 transitions. Second operand 4 states. [2019-11-24 06:05:20,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:20,716 INFO L93 Difference]: Finished difference Result 372 states and 498 transitions. [2019-11-24 06:05:20,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:20,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-11-24 06:05:20,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:20,718 INFO L225 Difference]: With dead ends: 372 [2019-11-24 06:05:20,718 INFO L226 Difference]: Without dead ends: 207 [2019-11-24 06:05:20,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:20,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-11-24 06:05:20,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2019-11-24 06:05:20,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-24 06:05:20,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 264 transitions. [2019-11-24 06:05:20,733 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 264 transitions. Word has length 46 [2019-11-24 06:05:20,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:20,734 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 264 transitions. [2019-11-24 06:05:20,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:20,734 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 264 transitions. [2019-11-24 06:05:20,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 06:05:20,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:20,735 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] [2019-11-24 06:05:20,735 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:20,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:20,736 INFO L82 PathProgramCache]: Analyzing trace with hash 592812283, now seen corresponding path program 1 times [2019-11-24 06:05:20,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:20,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209529526] [2019-11-24 06:05:20,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:20,779 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:20,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209529526] [2019-11-24 06:05:20,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:20,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:20,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473240938] [2019-11-24 06:05:20,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:20,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:20,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:20,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:20,781 INFO L87 Difference]: Start difference. First operand 203 states and 264 transitions. Second operand 3 states. [2019-11-24 06:05:20,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:20,813 INFO L93 Difference]: Finished difference Result 369 states and 483 transitions. [2019-11-24 06:05:20,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:20,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-11-24 06:05:20,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:20,817 INFO L225 Difference]: With dead ends: 369 [2019-11-24 06:05:20,817 INFO L226 Difference]: Without dead ends: 204 [2019-11-24 06:05:20,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:20,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-11-24 06:05:20,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 199. [2019-11-24 06:05:20,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-11-24 06:05:20,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 244 transitions. [2019-11-24 06:05:20,834 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 244 transitions. Word has length 46 [2019-11-24 06:05:20,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:20,834 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 244 transitions. [2019-11-24 06:05:20,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:20,834 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 244 transitions. [2019-11-24 06:05:20,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 06:05:20,835 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:20,836 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] [2019-11-24 06:05:20,836 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:20,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:20,837 INFO L82 PathProgramCache]: Analyzing trace with hash -535958381, now seen corresponding path program 1 times [2019-11-24 06:05:20,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:20,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430517356] [2019-11-24 06:05:20,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:20,911 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:20,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430517356] [2019-11-24 06:05:20,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156572266] [2019-11-24 06:05:20,912 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:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:20,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-24 06:05:20,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:21,017 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:21,018 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:21,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:21,067 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:21,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-24 06:05:21,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 5] total 12 [2019-11-24 06:05:21,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950985303] [2019-11-24 06:05:21,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 06:05:21,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:21,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 06:05:21,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-11-24 06:05:21,070 INFO L87 Difference]: Start difference. First operand 199 states and 244 transitions. Second operand 6 states. [2019-11-24 06:05:21,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:21,170 INFO L93 Difference]: Finished difference Result 457 states and 556 transitions. [2019-11-24 06:05:21,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 06:05:21,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-11-24 06:05:21,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:21,172 INFO L225 Difference]: With dead ends: 457 [2019-11-24 06:05:21,172 INFO L226 Difference]: Without dead ends: 232 [2019-11-24 06:05:21,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-11-24 06:05:21,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-24 06:05:21,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 209. [2019-11-24 06:05:21,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-11-24 06:05:21,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 247 transitions. [2019-11-24 06:05:21,189 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 247 transitions. Word has length 47 [2019-11-24 06:05:21,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:21,191 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 247 transitions. [2019-11-24 06:05:21,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 06:05:21,191 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 247 transitions. [2019-11-24 06:05:21,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-24 06:05:21,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:21,193 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-24 06:05:21,396 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:21,397 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:21,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:21,397 INFO L82 PathProgramCache]: Analyzing trace with hash -301636651, now seen corresponding path program 1 times [2019-11-24 06:05:21,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:21,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089511082] [2019-11-24 06:05:21,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:21,485 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:05:21,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089511082] [2019-11-24 06:05:21,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:21,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:21,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383559829] [2019-11-24 06:05:21,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:21,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:21,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:21,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:21,487 INFO L87 Difference]: Start difference. First operand 209 states and 247 transitions. Second operand 4 states. [2019-11-24 06:05:21,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:21,529 INFO L93 Difference]: Finished difference Result 440 states and 517 transitions. [2019-11-24 06:05:21,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:21,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-24 06:05:21,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:21,532 INFO L225 Difference]: With dead ends: 440 [2019-11-24 06:05:21,532 INFO L226 Difference]: Without dead ends: 438 [2019-11-24 06:05:21,532 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:21,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-11-24 06:05:21,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 300. [2019-11-24 06:05:21,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-24 06:05:21,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 355 transitions. [2019-11-24 06:05:21,554 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 355 transitions. Word has length 48 [2019-11-24 06:05:21,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:21,555 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 355 transitions. [2019-11-24 06:05:21,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:21,555 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 355 transitions. [2019-11-24 06:05:21,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 06:05:21,555 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:21,556 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-24 06:05:21,556 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:21,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:21,556 INFO L82 PathProgramCache]: Analyzing trace with hash -552854574, now seen corresponding path program 1 times [2019-11-24 06:05:21,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:21,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905513034] [2019-11-24 06:05:21,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-24 06:05:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-24 06:05:21,624 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-24 06:05:21,625 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-24 06:05:21,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 06:05:21 BoogieIcfgContainer [2019-11-24 06:05:21,691 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 06:05:21,701 INFO L168 Benchmark]: Toolchain (without parser) took 5657.79 ms. Allocated memory was 144.2 MB in the beginning and 289.4 MB in the end (delta: 145.2 MB). Free memory was 100.3 MB in the beginning and 223.5 MB in the end (delta: -123.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:21,702 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-24 06:05:21,703 INFO L168 Benchmark]: CACSL2BoogieTranslator took 417.12 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.1 MB in the beginning and 178.7 MB in the end (delta: -78.6 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:21,704 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.54 ms. Allocated memory is still 201.3 MB. Free memory was 178.7 MB in the beginning and 176.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:21,704 INFO L168 Benchmark]: Boogie Preprocessor took 38.00 ms. Allocated memory is still 201.3 MB. Free memory was 176.1 MB in the beginning and 173.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:21,705 INFO L168 Benchmark]: RCFGBuilder took 1259.39 ms. Allocated memory was 201.3 MB in the beginning and 232.8 MB in the end (delta: 31.5 MB). Free memory was 173.4 MB in the beginning and 193.7 MB in the end (delta: -20.3 MB). Peak memory consumption was 92.2 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:21,706 INFO L168 Benchmark]: TraceAbstraction took 3875.90 ms. Allocated memory was 232.8 MB in the beginning and 289.4 MB in the end (delta: 56.6 MB). Free memory was 193.7 MB in the beginning and 223.5 MB in the end (delta: -29.8 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:21,715 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.21 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 417.12 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.1 MB in the beginning and 178.7 MB in the end (delta: -78.6 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.54 ms. Allocated memory is still 201.3 MB. Free memory was 178.7 MB in the beginning and 176.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.00 ms. Allocated memory is still 201.3 MB. Free memory was 176.1 MB in the beginning and 173.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1259.39 ms. Allocated memory was 201.3 MB in the beginning and 232.8 MB in the end (delta: 31.5 MB). Free memory was 173.4 MB in the beginning and 193.7 MB in the end (delta: -20.3 MB). Peak memory consumption was 92.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3875.90 ms. Allocated memory was 232.8 MB in the beginning and 289.4 MB in the end (delta: 56.6 MB). Free memory was 193.7 MB in the beginning and 223.5 MB in the end (delta: -29.8 MB). Peak memory consumption was 26.9 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 m_st ; [L17] int t1_st ; [L18] int m_i ; [L19] int t1_i ; [L20] int M_E = 2; [L21] int T1_E = 2; [L22] int E_M = 2; [L23] int E_1 = 2; [L27] int token ; [L29] int local ; [L475] int __retres1 ; [L390] m_i = 1 [L391] t1_i = 1 [L416] int kernel_st ; [L417] int tmp ; [L418] int tmp___0 ; [L422] kernel_st = 0 [L172] COND TRUE m_i == 1 [L173] m_st = 0 [L177] COND TRUE t1_i == 1 [L178] t1_st = 0 [L261] COND FALSE !(M_E == 0) [L266] COND FALSE !(T1_E == 0) [L271] COND FALSE !(E_M == 0) [L276] COND FALSE !(E_1 == 0) [L314] int tmp ; [L315] int tmp___0 ; [L123] int __retres1 ; VAL [E_1=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, token=0] [L126] COND FALSE !(m_pc == 1) VAL [E_1=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, token=0] [L136] __retres1 = 0 VAL [E_1=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, token=0] [L138] return (__retres1); [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) [L142] int __retres1 ; VAL [E_1=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, token=0] [L145] COND FALSE !(t1_pc == 1) VAL [E_1=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, token=0] [L155] __retres1 = 0 VAL [E_1=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, token=0] [L157] return (__retres1); [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\read(tmp___0)) [L289] COND FALSE !(M_E == 1) [L294] COND FALSE !(T1_E == 1) [L299] COND FALSE !(E_M == 1) [L304] COND FALSE !(E_1 == 1) VAL [E_1=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, token=0] [L430] COND TRUE 1 [L433] kernel_st = 1 [L208] int tmp ; VAL [E_1=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, token=0] [L212] COND TRUE 1 [L187] int __retres1 ; [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 [L203] return (__retres1); [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [E_1=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, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=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, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [E_1=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, token=0] [L90] COND TRUE t1_pc == 0 VAL [E_1=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, token=0] [L101] COND TRUE 1 [L103] t1_pc = 1 [L104] t1_st = 2 VAL [E_1=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, token=0] [L212] COND TRUE 1 [L187] int __retres1 ; [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 [L203] return (__retres1); [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [E_1=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, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND TRUE m_pc == 0 VAL [E_1=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, token=0] [L45] COND TRUE 1 [L48] token = __VERIFIER_nondet_int() [L49] local = token [L50] E_1 = 1 [L314] int tmp ; [L315] int tmp___0 ; [L123] int __retres1 ; VAL [E_1=1, 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, token=0] [L126] COND FALSE !(m_pc == 1) VAL [E_1=1, 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, token=0] [L136] __retres1 = 0 VAL [E_1=1, 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, token=0] [L138] return (__retres1); [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) [L142] int __retres1 ; VAL [E_1=1, 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, token=0] [L145] COND TRUE t1_pc == 1 VAL [E_1=1, 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, token=0] [L146] COND TRUE E_1 == 1 [L147] __retres1 = 1 VAL [E_1=1, 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, token=0] [L157] return (__retres1); [L327] tmp___0 = is_transmit1_triggered() [L329] COND TRUE \read(tmp___0) [L330] t1_st = 0 [L52] E_1 = 2 [L53] m_pc = 1 [L54] m_st = 2 VAL [E_1=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, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [E_1=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, token=0] [L90] COND FALSE !(t1_pc == 0) VAL [E_1=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, token=0] [L93] COND TRUE t1_pc == 1 [L109] token += 1 [L110] E_M = 1 [L314] int tmp ; [L315] int tmp___0 ; [L123] int __retres1 ; VAL [E_1=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=1, token=1] [L126] COND TRUE m_pc == 1 VAL [E_1=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=1, token=1] [L127] COND TRUE E_M == 1 [L128] __retres1 = 1 VAL [E_1=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=1, token=1] [L138] return (__retres1); [L319] tmp = is_master_triggered() [L321] COND TRUE \read(tmp) [L322] m_st = 0 [L142] int __retres1 ; VAL [E_1=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=1, token=1] [L145] COND TRUE t1_pc == 1 VAL [E_1=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=1, token=1] [L146] COND FALSE !(E_1 == 1) VAL [E_1=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=1, token=1] [L155] __retres1 = 0 VAL [E_1=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=1, token=1] [L157] return (__retres1); [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\read(tmp___0)) [L112] E_M = 2 VAL [E_1=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=1, token=1] [L101] COND TRUE 1 [L103] t1_pc = 1 [L104] t1_st = 2 VAL [E_1=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, token=1] [L212] COND TRUE 1 [L187] int __retres1 ; [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 [L203] return (__retres1); [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [E_1=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, token=1] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND FALSE !(m_pc == 0) VAL [E_1=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, token=1] [L37] COND TRUE m_pc == 1 VAL [E_1=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, token=1] [L59] COND FALSE !(token != local + 1) [L64] COND TRUE tmp_var <= 5 [L65] COND TRUE tmp_var >= 5 VAL [E_1=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, token=1] [L70] COND TRUE tmp_var <= 5 VAL [E_1=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, token=1] [L71] COND TRUE tmp_var >= 5 VAL [E_1=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, token=1] [L72] COND TRUE tmp_var == 5 VAL [E_1=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, token=1] [L10] __VERIFIER_error() VAL [E_1=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, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 68 locations, 2 error locations. Result: UNSAFE, OverallTime: 3.8s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1224 SDtfs, 1223 SDslu, 1288 SDs, 0 SdLazy, 367 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 333 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=300occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 480 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 650 NumberOfCodeBlocks, 650 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 715 ConstructedInterpolants, 0 QuantifiedInterpolants, 66563 SizeOfPredicates, 16 NumberOfNonLiveVariables, 620 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 156/167 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...