/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/eca-rers2012/Problem01_label05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:29:36,719 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:29:36,721 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:29:36,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:29:36,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:29:36,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:29:36,734 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:29:36,736 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:29:36,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:29:36,738 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:29:36,739 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:29:36,740 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:29:36,741 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:29:36,742 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:29:36,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:29:36,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:29:36,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:29:36,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:29:36,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:29:36,749 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:29:36,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:29:36,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:29:36,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:29:36,754 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:29:36,756 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:29:36,756 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:29:36,756 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:29:36,757 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:29:36,758 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:29:36,759 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:29:36,759 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:29:36,760 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:29:36,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:29:36,761 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:29:36,762 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:29:36,763 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:29:36,763 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:29:36,763 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:29:36,764 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:29:36,764 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:29:36,765 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:29:36,766 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-23 23:29:36,781 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:29:36,781 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:29:36,782 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:29:36,782 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:29:36,782 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:29:36,783 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:29:36,783 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:29:36,783 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:29:36,783 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:29:36,783 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:29:36,783 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:29:36,784 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:29:36,784 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:29:36,784 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:29:36,784 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:29:36,785 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:29:36,785 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:29:36,785 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:29:36,785 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:29:36,786 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:29:36,786 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:29:36,786 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:29:36,786 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:29:36,786 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:29:36,786 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:29:36,787 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:29:36,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:29:36,787 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:29:36,787 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:29:36,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:29:36,788 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:29:36,788 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:29:36,788 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:29:36,788 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:29:36,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:29:36,789 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:29:36,789 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:29:36,789 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:29:37,051 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:29:37,069 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:29:37,072 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:29:37,073 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:29:37,074 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:29:37,075 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label05.c [2019-11-23 23:29:37,150 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f56466260/bb5e9d9e0f6f439593b083f2de9fa9bc/FLAGe28fc0366 [2019-11-23 23:29:37,745 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:29:37,745 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label05.c [2019-11-23 23:29:37,759 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f56466260/bb5e9d9e0f6f439593b083f2de9fa9bc/FLAGe28fc0366 [2019-11-23 23:29:38,053 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f56466260/bb5e9d9e0f6f439593b083f2de9fa9bc [2019-11-23 23:29:38,064 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:29:38,068 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:29:38,069 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:29:38,069 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:29:38,072 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:29:38,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:38" (1/1) ... [2019-11-23 23:29:38,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@193a5221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:38, skipping insertion in model container [2019-11-23 23:29:38,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:38" (1/1) ... [2019-11-23 23:29:38,085 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:29:38,144 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:29:38,739 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:29:38,746 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:29:38,844 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:29:38,865 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:29:38,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:38 WrapperNode [2019-11-23 23:29:38,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:29:38,866 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:29:38,867 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:29:38,867 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:29:38,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:38" (1/1) ... [2019-11-23 23:29:38,907 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:38" (1/1) ... [2019-11-23 23:29:38,980 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:29:38,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:29:38,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:29:38,981 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:29:38,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:38" (1/1) ... [2019-11-23 23:29:38,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:38" (1/1) ... [2019-11-23 23:29:39,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:38" (1/1) ... [2019-11-23 23:29:39,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:38" (1/1) ... [2019-11-23 23:29:39,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:38" (1/1) ... [2019-11-23 23:29:39,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:38" (1/1) ... [2019-11-23 23:29:39,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:38" (1/1) ... [2019-11-23 23:29:39,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:29:39,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:29:39,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:29:39,060 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:29:39,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:38" (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-23 23:29:39,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:29:39,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:29:40,947 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:29:40,948 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:29:40,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:40 BoogieIcfgContainer [2019-11-23 23:29:40,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:29:40,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:29:40,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:29:40,954 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:29:40,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:29:38" (1/3) ... [2019-11-23 23:29:40,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa8c2c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:40, skipping insertion in model container [2019-11-23 23:29:40,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:38" (2/3) ... [2019-11-23 23:29:40,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa8c2c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:40, skipping insertion in model container [2019-11-23 23:29:40,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:40" (3/3) ... [2019-11-23 23:29:40,958 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label05.c [2019-11-23 23:29:40,968 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:29:40,975 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:29:40,987 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:29:41,017 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:29:41,017 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:29:41,017 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:29:41,017 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:29:41,018 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:29:41,018 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:29:41,018 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:29:41,018 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:29:41,033 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:29:41,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:29:41,042 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:41,043 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:29:41,043 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:41,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:41,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1323244063, now seen corresponding path program 1 times [2019-11-23 23:29:41,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:41,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374308469] [2019-11-23 23:29:41,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:41,400 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-23 23:29:41,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374308469] [2019-11-23 23:29:41,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:41,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:29:41,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840760788] [2019-11-23 23:29:41,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:41,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:41,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:41,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:41,435 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-23 23:29:42,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:42,170 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-23 23:29:42,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:29:42,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-23 23:29:42,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:42,221 INFO L225 Difference]: With dead ends: 297 [2019-11-23 23:29:42,221 INFO L226 Difference]: Without dead ends: 216 [2019-11-23 23:29:42,232 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-23 23:29:42,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-23 23:29:42,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 145. [2019-11-23 23:29:42,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-23 23:29:42,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-11-23 23:29:42,287 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-11-23 23:29:42,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:42,288 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-11-23 23:29:42,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:42,288 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-11-23 23:29:42,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-23 23:29:42,292 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:42,292 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:42,292 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:42,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:42,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1048396684, now seen corresponding path program 1 times [2019-11-23 23:29:42,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:42,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379600773] [2019-11-23 23:29:42,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:42,378 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-23 23:29:42,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379600773] [2019-11-23 23:29:42,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:42,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:29:42,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176927075] [2019-11-23 23:29:42,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:42,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:42,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:42,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:42,383 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-11-23 23:29:42,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:42,952 INFO L93 Difference]: Finished difference Result 573 states and 1031 transitions. [2019-11-23 23:29:42,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:29:42,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-23 23:29:42,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:42,959 INFO L225 Difference]: With dead ends: 573 [2019-11-23 23:29:42,959 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:29:42,961 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-23 23:29:42,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:29:43,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-23 23:29:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-23 23:29:43,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 706 transitions. [2019-11-23 23:29:43,008 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 706 transitions. Word has length 77 [2019-11-23 23:29:43,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:43,008 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 706 transitions. [2019-11-23 23:29:43,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:43,009 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 706 transitions. [2019-11-23 23:29:43,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-23 23:29:43,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:43,013 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:43,014 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:43,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:43,014 INFO L82 PathProgramCache]: Analyzing trace with hash -2123301356, now seen corresponding path program 1 times [2019-11-23 23:29:43,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:43,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542764497] [2019-11-23 23:29:43,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:43,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:29:43,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542764497] [2019-11-23 23:29:43,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:43,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:29:43,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779501173] [2019-11-23 23:29:43,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:43,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:43,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:43,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:29:43,140 INFO L87 Difference]: Start difference. First operand 429 states and 706 transitions. Second operand 3 states. [2019-11-23 23:29:43,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:43,543 INFO L93 Difference]: Finished difference Result 1141 states and 1870 transitions. [2019-11-23 23:29:43,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:43,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-11-23 23:29:43,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:43,549 INFO L225 Difference]: With dead ends: 1141 [2019-11-23 23:29:43,549 INFO L226 Difference]: Without dead ends: 713 [2019-11-23 23:29:43,552 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-23 23:29:43,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-11-23 23:29:43,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 571. [2019-11-23 23:29:43,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-11-23 23:29:43,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 847 transitions. [2019-11-23 23:29:43,574 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 847 transitions. Word has length 78 [2019-11-23 23:29:43,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:43,574 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 847 transitions. [2019-11-23 23:29:43,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:43,575 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 847 transitions. [2019-11-23 23:29:43,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-23 23:29:43,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:43,578 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:43,578 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:43,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:43,579 INFO L82 PathProgramCache]: Analyzing trace with hash 466067279, now seen corresponding path program 1 times [2019-11-23 23:29:43,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:43,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353510056] [2019-11-23 23:29:43,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:43,652 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:29:43,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353510056] [2019-11-23 23:29:43,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:43,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:29:43,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115554052] [2019-11-23 23:29:43,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:43,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:43,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:43,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:29:43,656 INFO L87 Difference]: Start difference. First operand 571 states and 847 transitions. Second operand 3 states. [2019-11-23 23:29:44,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:44,028 INFO L93 Difference]: Finished difference Result 1283 states and 1938 transitions. [2019-11-23 23:29:44,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:44,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-23 23:29:44,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:44,033 INFO L225 Difference]: With dead ends: 1283 [2019-11-23 23:29:44,033 INFO L226 Difference]: Without dead ends: 713 [2019-11-23 23:29:44,034 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-23 23:29:44,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-11-23 23:29:44,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 642. [2019-11-23 23:29:44,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-23 23:29:44,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 961 transitions. [2019-11-23 23:29:44,059 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 961 transitions. Word has length 105 [2019-11-23 23:29:44,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:44,060 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 961 transitions. [2019-11-23 23:29:44,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:44,060 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 961 transitions. [2019-11-23 23:29:44,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-23 23:29:44,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:44,066 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:44,066 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:44,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:44,067 INFO L82 PathProgramCache]: Analyzing trace with hash 2048819508, now seen corresponding path program 1 times [2019-11-23 23:29:44,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:44,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482890704] [2019-11-23 23:29:44,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:44,195 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 23:29:44,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482890704] [2019-11-23 23:29:44,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:44,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:29:44,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155513246] [2019-11-23 23:29:44,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:44,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:44,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:44,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:29:44,199 INFO L87 Difference]: Start difference. First operand 642 states and 961 transitions. Second operand 3 states. [2019-11-23 23:29:44,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:44,555 INFO L93 Difference]: Finished difference Result 1709 states and 2539 transitions. [2019-11-23 23:29:44,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:44,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-11-23 23:29:44,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:44,561 INFO L225 Difference]: With dead ends: 1709 [2019-11-23 23:29:44,561 INFO L226 Difference]: Without dead ends: 1068 [2019-11-23 23:29:44,562 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-23 23:29:44,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-23 23:29:44,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 997. [2019-11-23 23:29:44,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:29:44,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1424 transitions. [2019-11-23 23:29:44,589 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1424 transitions. Word has length 129 [2019-11-23 23:29:44,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:44,590 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1424 transitions. [2019-11-23 23:29:44,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:44,590 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1424 transitions. [2019-11-23 23:29:44,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-23 23:29:44,593 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:44,594 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:44,594 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:44,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:44,594 INFO L82 PathProgramCache]: Analyzing trace with hash 865225503, now seen corresponding path program 1 times [2019-11-23 23:29:44,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:44,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16209820] [2019-11-23 23:29:44,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:44,654 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-23 23:29:44,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16209820] [2019-11-23 23:29:44,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:44,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:29:44,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464438298] [2019-11-23 23:29:44,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:44,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:44,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:44,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:29:44,656 INFO L87 Difference]: Start difference. First operand 997 states and 1424 transitions. Second operand 3 states. [2019-11-23 23:29:45,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:45,002 INFO L93 Difference]: Finished difference Result 1993 states and 2847 transitions. [2019-11-23 23:29:45,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:45,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-11-23 23:29:45,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:45,010 INFO L225 Difference]: With dead ends: 1993 [2019-11-23 23:29:45,010 INFO L226 Difference]: Without dead ends: 997 [2019-11-23 23:29:45,013 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-23 23:29:45,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-23 23:29:45,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 926. [2019-11-23 23:29:45,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-23 23:29:45,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1329 transitions. [2019-11-23 23:29:45,044 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1329 transitions. Word has length 134 [2019-11-23 23:29:45,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:45,045 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1329 transitions. [2019-11-23 23:29:45,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:45,045 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1329 transitions. [2019-11-23 23:29:45,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-23 23:29:45,094 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:45,094 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:45,094 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:45,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:45,095 INFO L82 PathProgramCache]: Analyzing trace with hash 465703224, now seen corresponding path program 1 times [2019-11-23 23:29:45,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:45,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968857510] [2019-11-23 23:29:45,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:45,193 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-23 23:29:45,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968857510] [2019-11-23 23:29:45,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:45,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:29:45,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205152574] [2019-11-23 23:29:45,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:45,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:45,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:45,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:29:45,196 INFO L87 Difference]: Start difference. First operand 926 states and 1329 transitions. Second operand 3 states. [2019-11-23 23:29:45,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:45,498 INFO L93 Difference]: Finished difference Result 1922 states and 2740 transitions. [2019-11-23 23:29:45,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:45,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-23 23:29:45,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:45,504 INFO L225 Difference]: With dead ends: 1922 [2019-11-23 23:29:45,504 INFO L226 Difference]: Without dead ends: 997 [2019-11-23 23:29:45,506 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-23 23:29:45,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-23 23:29:45,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2019-11-23 23:29:45,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:29:45,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1388 transitions. [2019-11-23 23:29:45,529 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1388 transitions. Word has length 154 [2019-11-23 23:29:45,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:45,530 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1388 transitions. [2019-11-23 23:29:45,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:45,530 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1388 transitions. [2019-11-23 23:29:45,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-23 23:29:45,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:45,534 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:45,534 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:45,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:45,534 INFO L82 PathProgramCache]: Analyzing trace with hash -2114883584, now seen corresponding path program 1 times [2019-11-23 23:29:45,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:45,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899290698] [2019-11-23 23:29:45,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:45,709 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-23 23:29:45,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899290698] [2019-11-23 23:29:45,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:45,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 23:29:45,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601843222] [2019-11-23 23:29:45,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 23:29:45,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:45,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 23:29:45,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:29:45,712 INFO L87 Difference]: Start difference. First operand 997 states and 1388 transitions. Second operand 8 states. [2019-11-23 23:29:46,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:46,502 INFO L93 Difference]: Finished difference Result 2103 states and 2891 transitions. [2019-11-23 23:29:46,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 23:29:46,503 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 158 [2019-11-23 23:29:46,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:46,509 INFO L225 Difference]: With dead ends: 2103 [2019-11-23 23:29:46,509 INFO L226 Difference]: Without dead ends: 1107 [2019-11-23 23:29:46,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:29:46,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-11-23 23:29:46,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 997. [2019-11-23 23:29:46,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:29:46,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1376 transitions. [2019-11-23 23:29:46,537 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1376 transitions. Word has length 158 [2019-11-23 23:29:46,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:46,537 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1376 transitions. [2019-11-23 23:29:46,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 23:29:46,537 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1376 transitions. [2019-11-23 23:29:46,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-23 23:29:46,540 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:46,541 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:46,541 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:46,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:46,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1219959715, now seen corresponding path program 1 times [2019-11-23 23:29:46,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:46,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282770867] [2019-11-23 23:29:46,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:46,669 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-11-23 23:29:46,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282770867] [2019-11-23 23:29:46,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:46,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:29:46,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899942694] [2019-11-23 23:29:46,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:46,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:46,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:46,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:29:46,672 INFO L87 Difference]: Start difference. First operand 997 states and 1376 transitions. Second operand 3 states. [2019-11-23 23:29:46,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:46,987 INFO L93 Difference]: Finished difference Result 1283 states and 1745 transitions. [2019-11-23 23:29:46,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:46,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-11-23 23:29:46,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:46,993 INFO L225 Difference]: With dead ends: 1283 [2019-11-23 23:29:46,993 INFO L226 Difference]: Without dead ends: 1281 [2019-11-23 23:29:46,994 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-23 23:29:46,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-11-23 23:29:47,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 926. [2019-11-23 23:29:47,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-23 23:29:47,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1262 transitions. [2019-11-23 23:29:47,016 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1262 transitions. Word has length 175 [2019-11-23 23:29:47,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:47,017 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1262 transitions. [2019-11-23 23:29:47,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:47,017 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1262 transitions. [2019-11-23 23:29:47,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-23 23:29:47,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:47,021 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:47,021 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:47,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:47,021 INFO L82 PathProgramCache]: Analyzing trace with hash -75790848, now seen corresponding path program 1 times [2019-11-23 23:29:47,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:47,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000013720] [2019-11-23 23:29:47,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:47,246 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 141 proven. 70 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-23 23:29:47,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000013720] [2019-11-23 23:29:47,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094563571] [2019-11-23 23:29:47,247 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-23 23:29:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:47,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:29:47,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:29:47,452 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-23 23:29:47,455 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:29:47,528 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-23 23:29:47,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:29:47,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-23 23:29:47,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376172823] [2019-11-23 23:29:47,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:47,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:47,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:47,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:29:47,540 INFO L87 Difference]: Start difference. First operand 926 states and 1262 transitions. Second operand 3 states. [2019-11-23 23:29:47,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:47,930 INFO L93 Difference]: Finished difference Result 1849 states and 2522 transitions. [2019-11-23 23:29:47,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:47,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-11-23 23:29:47,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:47,931 INFO L225 Difference]: With dead ends: 1849 [2019-11-23 23:29:47,931 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:29:47,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 386 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:29:47,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:29:47,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:29:47,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:29:47,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:29:47,938 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 193 [2019-11-23 23:29:47,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:47,938 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:29:47,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:47,939 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:29:47,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:29:48,142 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:29:48,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:29:48,405 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 28 [2019-11-23 23:29:48,571 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 28 [2019-11-23 23:29:48,574 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:29:48,575 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:29:48,575 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:29:48,575 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:29:48,575 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:29:48,575 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:29:48,576 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:29:48,576 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:29:48,576 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:29:48,576 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:29:48,576 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:29:48,576 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:29:48,577 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:29:48,577 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:29:48,577 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:29:48,577 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:29:48,578 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:29:48,578 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse3 (not (= 13 ~a8~0))) (.cse6 (= ~a17~0 1)) (.cse4 (<= ~a21~0 0)) (.cse1 (= ~a20~0 1)) (.cse5 (not (= ~a16~0 6))) (.cse0 (not (= 1 ~a7~0))) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse5 .cse2 .cse3) (and .cse6 .cse1 .cse2) (and .cse4 .cse1) (and .cse5 .cse0 .cse2))) [2019-11-23 23:29:48,578 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:29:48,578 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:29:48,579 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:29:48,579 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:29:48,579 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:29:48,579 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:29:48,579 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:29:48,579 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:29:48,579 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:29:48,580 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:29:48,580 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:29:48,580 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:29:48,580 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:29:48,580 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:29:48,580 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:29:48,580 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:29:48,580 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:29:48,581 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:29:48,581 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:29:48,581 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:29:48,581 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:29:48,581 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:29:48,581 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:29:48,581 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse3 (not (= 13 ~a8~0))) (.cse6 (= ~a17~0 1)) (.cse4 (<= ~a21~0 0)) (.cse1 (= ~a20~0 1)) (.cse5 (not (= ~a16~0 6))) (.cse0 (not (= 1 ~a7~0))) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse5 .cse2 .cse3) (and .cse6 .cse1 .cse2) (and .cse4 .cse1) (and .cse5 .cse0 .cse2))) [2019-11-23 23:29:48,582 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:29:48,582 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:29:48,582 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:29:48,582 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:29:48,582 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:29:48,582 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:29:48,582 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:29:48,582 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:29:48,583 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:29:48,583 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:29:48,583 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:29:48,583 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:29:48,583 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:29:48,583 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:29:48,583 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:29:48,583 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-23 23:29:48,584 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:29:48,584 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:29:48,584 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:29:48,584 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:29:48,584 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:29:48,584 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:29:48,584 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:29:48,584 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:29:48,585 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:29:48,585 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:29:48,585 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 458) no Hoare annotation was computed. [2019-11-23 23:29:48,585 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:29:48,585 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:29:48,585 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:29:48,585 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:29:48,585 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:29:48,586 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:29:48,586 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:29:48,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:29:48 BoogieIcfgContainer [2019-11-23 23:29:48,604 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:29:48,606 INFO L168 Benchmark]: Toolchain (without parser) took 10540.12 ms. Allocated memory was 145.2 MB in the beginning and 393.2 MB in the end (delta: 248.0 MB). Free memory was 100.4 MB in the beginning and 277.3 MB in the end (delta: -176.9 MB). Peak memory consumption was 71.1 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:48,607 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 23:29:48,607 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.16 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.2 MB in the beginning and 164.1 MB in the end (delta: -63.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:48,608 INFO L168 Benchmark]: Boogie Procedure Inliner took 113.56 ms. Allocated memory is still 202.4 MB. Free memory was 163.4 MB in the beginning and 158.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:48,609 INFO L168 Benchmark]: Boogie Preprocessor took 78.82 ms. Allocated memory is still 202.4 MB. Free memory was 158.0 MB in the beginning and 153.3 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:48,610 INFO L168 Benchmark]: RCFGBuilder took 1890.03 ms. Allocated memory was 202.4 MB in the beginning and 251.1 MB in the end (delta: 48.8 MB). Free memory was 153.3 MB in the beginning and 204.3 MB in the end (delta: -51.1 MB). Peak memory consumption was 110.2 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:48,611 INFO L168 Benchmark]: TraceAbstraction took 7653.06 ms. Allocated memory was 251.1 MB in the beginning and 393.2 MB in the end (delta: 142.1 MB). Free memory was 204.3 MB in the beginning and 277.3 MB in the end (delta: -72.9 MB). Peak memory consumption was 69.2 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:48,615 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.26 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 797.16 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.2 MB in the beginning and 164.1 MB in the end (delta: -63.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 113.56 ms. Allocated memory is still 202.4 MB. Free memory was 163.4 MB in the beginning and 158.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 78.82 ms. Allocated memory is still 202.4 MB. Free memory was 158.0 MB in the beginning and 153.3 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1890.03 ms. Allocated memory was 202.4 MB in the beginning and 251.1 MB in the end (delta: 48.8 MB). Free memory was 153.3 MB in the beginning and 204.3 MB in the end (delta: -51.1 MB). Peak memory consumption was 110.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7653.06 ms. Allocated memory was 251.1 MB in the beginning and 393.2 MB in the end (delta: 142.1 MB). Free memory was 204.3 MB in the beginning and 277.3 MB in the end (delta: -72.9 MB). Peak memory consumption was 69.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 458]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((!(1 == a7) && a20 == 1) && a21 == 1) || ((!(1 == a7) && a21 == 1) && !(13 == a8))) || ((a21 <= 0 && !(a16 == 6)) && a17 == 1)) || ((!(a16 == 6) && a21 == 1) && !(13 == a8))) || ((a17 == 1 && a20 == 1) && a21 == 1)) || (a21 <= 0 && a20 == 1)) || ((!(a16 == 6) && !(1 == a7)) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((!(1 == a7) && a20 == 1) && a21 == 1) || ((!(1 == a7) && a21 == 1) && !(13 == a8))) || ((a21 <= 0 && !(a16 == 6)) && a17 == 1)) || ((!(a16 == 6) && a21 == 1) && !(13 == a8))) || ((a17 == 1 && a20 == 1) && a21 == 1)) || (a21 <= 0 && a20 == 1)) || ((!(a16 == 6) && !(1 == a7)) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 7.5s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 431 SDtfs, 918 SDslu, 69 SDs, 0 SdLazy, 2857 SolverSat, 744 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 422 GetRequests, 396 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=997occurred in iteration=5, 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, 10 MinimizatonAttempts, 891 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 32 NumberOfFragments, 153 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3250 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 328 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1467 NumberOfCodeBlocks, 1467 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1648 ConstructedInterpolants, 0 QuantifiedInterpolants, 628287 SizeOfPredicates, 1 NumberOfNonLiveVariables, 389 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 1249/1319 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...