/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_label03.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:29:21,688 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:29:21,690 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:29:21,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:29:21,703 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:29:21,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:29:21,705 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:29:21,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:29:21,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:29:21,710 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:29:21,711 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:29:21,712 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:29:21,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:29:21,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:29:21,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:29:21,716 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:29:21,717 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:29:21,718 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:29:21,720 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:29:21,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:29:21,724 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:29:21,725 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:29:21,726 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:29:21,727 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:29:21,730 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:29:21,730 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:29:21,730 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:29:21,731 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:29:21,732 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:29:21,733 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:29:21,733 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:29:21,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:29:21,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:29:21,735 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:29:21,736 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:29:21,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:29:21,737 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:29:21,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:29:21,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:29:21,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:29:21,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:29:21,740 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:21,756 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:29:21,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:29:21,757 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:29:21,757 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:29:21,758 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:29:21,758 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:29:21,758 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:29:21,758 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:29:21,758 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:29:21,759 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:29:21,759 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:29:21,759 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:29:21,759 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:29:21,759 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:29:21,760 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:29:21,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:29:21,760 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:29:21,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:29:21,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:29:21,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:29:21,761 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:29:21,761 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:29:21,762 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:29:21,762 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:29:21,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:29:21,762 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:29:21,762 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:29:21,763 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:29:21,763 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:29:21,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:29:21,763 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:29:21,763 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:29:21,763 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:29:21,764 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:29:21,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:29:21,764 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:29:21,764 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:29:21,764 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:29:22,087 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:29:22,111 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:29:22,115 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:29:22,116 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:29:22,116 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:29:22,117 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label03.c [2019-11-23 23:29:22,178 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f0c935c1/a8e9671ded914597ae94dfaa6a74f84e/FLAGfdc915468 [2019-11-23 23:29:22,730 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:29:22,734 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label03.c [2019-11-23 23:29:22,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f0c935c1/a8e9671ded914597ae94dfaa6a74f84e/FLAGfdc915468 [2019-11-23 23:29:23,019 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f0c935c1/a8e9671ded914597ae94dfaa6a74f84e [2019-11-23 23:29:23,030 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:29:23,032 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:29:23,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:29:23,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:29:23,040 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:29:23,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:23" (1/1) ... [2019-11-23 23:29:23,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e6eb97e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:23, skipping insertion in model container [2019-11-23 23:29:23,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:23" (1/1) ... [2019-11-23 23:29:23,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:29:23,129 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:29:23,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:29:23,814 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:29:23,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:29:23,921 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:29:23,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:23 WrapperNode [2019-11-23 23:29:23,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:29:23,922 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:29:23,923 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:29:23,923 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:29:23,931 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:23" (1/1) ... [2019-11-23 23:29:23,954 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:23" (1/1) ... [2019-11-23 23:29:24,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:29:24,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:29:24,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:29:24,016 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:29:24,025 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:23" (1/1) ... [2019-11-23 23:29:24,025 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:23" (1/1) ... [2019-11-23 23:29:24,035 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:23" (1/1) ... [2019-11-23 23:29:24,035 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:23" (1/1) ... [2019-11-23 23:29:24,080 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:23" (1/1) ... [2019-11-23 23:29:24,100 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:23" (1/1) ... [2019-11-23 23:29:24,108 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:23" (1/1) ... [2019-11-23 23:29:24,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:29:24,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:29:24,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:29:24,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:29:24,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:23" (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:24,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:29:24,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:29:26,353 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:29:26,353 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:29:26,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:26 BoogieIcfgContainer [2019-11-23 23:29:26,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:29:26,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:29:26,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:29:26,359 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:29:26,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:29:23" (1/3) ... [2019-11-23 23:29:26,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f7aacab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:26, skipping insertion in model container [2019-11-23 23:29:26,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:23" (2/3) ... [2019-11-23 23:29:26,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f7aacab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:26, skipping insertion in model container [2019-11-23 23:29:26,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:26" (3/3) ... [2019-11-23 23:29:26,362 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label03.c [2019-11-23 23:29:26,372 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:29:26,379 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:29:26,391 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:29:26,417 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:29:26,417 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:29:26,417 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:29:26,417 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:29:26,418 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:29:26,418 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:29:26,418 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:29:26,418 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:29:26,435 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:29:26,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:29:26,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:26,445 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:26,446 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:26,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:26,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1323229337, now seen corresponding path program 1 times [2019-11-23 23:29:26,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:26,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44459593] [2019-11-23 23:29:26,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:26,930 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:26,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44459593] [2019-11-23 23:29:26,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:26,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:29:26,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460472770] [2019-11-23 23:29:26,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:26,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:26,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:26,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:26,958 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-23 23:29:27,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:27,788 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-23 23:29:27,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:29:27,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-23 23:29:27,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:27,806 INFO L225 Difference]: With dead ends: 297 [2019-11-23 23:29:27,807 INFO L226 Difference]: Without dead ends: 216 [2019-11-23 23:29:27,810 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:27,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-23 23:29:27,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 145. [2019-11-23 23:29:27,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-23 23:29:27,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-11-23 23:29:27,879 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-11-23 23:29:27,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:27,880 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-11-23 23:29:27,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:27,880 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-11-23 23:29:27,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-23 23:29:27,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:27,884 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:27,884 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:27,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:27,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1048381958, now seen corresponding path program 1 times [2019-11-23 23:29:27,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:27,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810807059] [2019-11-23 23:29:27,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:27,954 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:27,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810807059] [2019-11-23 23:29:27,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:27,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:29:27,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039351926] [2019-11-23 23:29:27,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:27,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:27,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:27,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:27,958 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-11-23 23:29:28,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:28,606 INFO L93 Difference]: Finished difference Result 573 states and 1031 transitions. [2019-11-23 23:29:28,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:29:28,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-23 23:29:28,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:28,611 INFO L225 Difference]: With dead ends: 573 [2019-11-23 23:29:28,611 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:29:28,613 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:28,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:29:28,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-23 23:29:28,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-23 23:29:28,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 707 transitions. [2019-11-23 23:29:28,660 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 707 transitions. Word has length 77 [2019-11-23 23:29:28,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:28,661 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 707 transitions. [2019-11-23 23:29:28,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:28,661 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 707 transitions. [2019-11-23 23:29:28,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-23 23:29:28,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:28,666 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:28,666 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:28,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:28,666 INFO L82 PathProgramCache]: Analyzing trace with hash -2123286630, now seen corresponding path program 1 times [2019-11-23 23:29:28,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:28,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037404728] [2019-11-23 23:29:28,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:28,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:29:28,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037404728] [2019-11-23 23:29:28,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:28,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:29:28,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167218977] [2019-11-23 23:29:28,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:28,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:28,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:28,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:28,783 INFO L87 Difference]: Start difference. First operand 429 states and 707 transitions. Second operand 4 states. [2019-11-23 23:29:29,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:29,388 INFO L93 Difference]: Finished difference Result 857 states and 1413 transitions. [2019-11-23 23:29:29,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:29:29,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-23 23:29:29,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:29,392 INFO L225 Difference]: With dead ends: 857 [2019-11-23 23:29:29,392 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:29:29,394 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-23 23:29:29,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:29:29,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-23 23:29:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-23 23:29:29,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 633 transitions. [2019-11-23 23:29:29,410 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 633 transitions. Word has length 78 [2019-11-23 23:29:29,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:29,411 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 633 transitions. [2019-11-23 23:29:29,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:29,411 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 633 transitions. [2019-11-23 23:29:29,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-23 23:29:29,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:29,415 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,416 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:29,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:29,416 INFO L82 PathProgramCache]: Analyzing trace with hash 293135613, now seen corresponding path program 1 times [2019-11-23 23:29:29,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:29,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052479373] [2019-11-23 23:29:29,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:29,467 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:29:29,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052479373] [2019-11-23 23:29:29,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:29,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:29:29,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285998951] [2019-11-23 23:29:29,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:29,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:29,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:29,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:29:29,470 INFO L87 Difference]: Start difference. First operand 429 states and 633 transitions. Second operand 3 states. [2019-11-23 23:29:29,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:29,873 INFO L93 Difference]: Finished difference Result 1141 states and 1669 transitions. [2019-11-23 23:29:29,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:29,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-23 23:29:29,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:29,879 INFO L225 Difference]: With dead ends: 1141 [2019-11-23 23:29:29,879 INFO L226 Difference]: Without dead ends: 713 [2019-11-23 23:29:29,880 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:29,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-11-23 23:29:29,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 642. [2019-11-23 23:29:29,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-23 23:29:29,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 888 transitions. [2019-11-23 23:29:29,898 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 888 transitions. Word has length 89 [2019-11-23 23:29:29,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:29,899 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 888 transitions. [2019-11-23 23:29:29,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:29,899 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 888 transitions. [2019-11-23 23:29:29,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 23:29:29,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:29,901 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 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:29,902 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:29,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:29,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1374575983, now seen corresponding path program 1 times [2019-11-23 23:29:29,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:29,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695069300] [2019-11-23 23:29:29,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:29,979 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 23:29:29,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695069300] [2019-11-23 23:29:29,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:29,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:29:29,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898085810] [2019-11-23 23:29:29,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:29,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:29,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:29,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:29,982 INFO L87 Difference]: Start difference. First operand 642 states and 888 transitions. Second operand 4 states. [2019-11-23 23:29:30,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:30,470 INFO L93 Difference]: Finished difference Result 1380 states and 1890 transitions. [2019-11-23 23:29:30,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:29:30,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-23 23:29:30,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:30,478 INFO L225 Difference]: With dead ends: 1380 [2019-11-23 23:29:30,479 INFO L226 Difference]: Without dead ends: 739 [2019-11-23 23:29:30,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:29:30,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-11-23 23:29:30,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 713. [2019-11-23 23:29:30,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-11-23 23:29:30,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 965 transitions. [2019-11-23 23:29:30,510 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 965 transitions. Word has length 97 [2019-11-23 23:29:30,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:30,510 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 965 transitions. [2019-11-23 23:29:30,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:30,511 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 965 transitions. [2019-11-23 23:29:30,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-23 23:29:30,514 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:30,514 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 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:30,515 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:30,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:30,515 INFO L82 PathProgramCache]: Analyzing trace with hash 252007113, now seen corresponding path program 1 times [2019-11-23 23:29:30,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:30,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448918342] [2019-11-23 23:29:30,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:30,616 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 23:29:30,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448918342] [2019-11-23 23:29:30,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:30,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:29:30,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012941508] [2019-11-23 23:29:30,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:30,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:30,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:30,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:30,620 INFO L87 Difference]: Start difference. First operand 713 states and 965 transitions. Second operand 4 states. [2019-11-23 23:29:31,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:31,167 INFO L93 Difference]: Finished difference Result 1922 states and 2638 transitions. [2019-11-23 23:29:31,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:29:31,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-23 23:29:31,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:31,175 INFO L225 Difference]: With dead ends: 1922 [2019-11-23 23:29:31,176 INFO L226 Difference]: Without dead ends: 1281 [2019-11-23 23:29:31,177 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:31,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-11-23 23:29:31,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1068. [2019-11-23 23:29:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-23 23:29:31,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1400 transitions. [2019-11-23 23:29:31,211 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1400 transitions. Word has length 101 [2019-11-23 23:29:31,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:31,211 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1400 transitions. [2019-11-23 23:29:31,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:31,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1400 transitions. [2019-11-23 23:29:31,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-23 23:29:31,215 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:31,215 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,215 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:31,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:31,220 INFO L82 PathProgramCache]: Analyzing trace with hash 526064268, now seen corresponding path program 1 times [2019-11-23 23:29:31,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:31,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147267058] [2019-11-23 23:29:31,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:31,434 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 23:29:31,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147267058] [2019-11-23 23:29:31,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:31,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 23:29:31,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278828060] [2019-11-23 23:29:31,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 23:29:31,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:31,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 23:29:31,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:29:31,437 INFO L87 Difference]: Start difference. First operand 1068 states and 1400 transitions. Second operand 8 states. [2019-11-23 23:29:32,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:32,188 INFO L93 Difference]: Finished difference Result 2245 states and 2951 transitions. [2019-11-23 23:29:32,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 23:29:32,190 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2019-11-23 23:29:32,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:32,197 INFO L225 Difference]: With dead ends: 2245 [2019-11-23 23:29:32,197 INFO L226 Difference]: Without dead ends: 1249 [2019-11-23 23:29:32,199 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:32,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2019-11-23 23:29:32,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1139. [2019-11-23 23:29:32,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2019-11-23 23:29:32,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1470 transitions. [2019-11-23 23:29:32,229 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1470 transitions. Word has length 115 [2019-11-23 23:29:32,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:32,230 INFO L462 AbstractCegarLoop]: Abstraction has 1139 states and 1470 transitions. [2019-11-23 23:29:32,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 23:29:32,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1470 transitions. [2019-11-23 23:29:32,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-23 23:29:32,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:32,233 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:32,233 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:32,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:32,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1291932129, now seen corresponding path program 1 times [2019-11-23 23:29:32,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:32,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616744685] [2019-11-23 23:29:32,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:32,303 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-23 23:29:32,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616744685] [2019-11-23 23:29:32,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:32,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:29:32,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411799681] [2019-11-23 23:29:32,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:32,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:32,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:32,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:32,305 INFO L87 Difference]: Start difference. First operand 1139 states and 1470 transitions. Second operand 4 states. [2019-11-23 23:29:32,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:32,799 INFO L93 Difference]: Finished difference Result 2845 states and 3646 transitions. [2019-11-23 23:29:32,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:29:32,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-23 23:29:32,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:32,805 INFO L225 Difference]: With dead ends: 2845 [2019-11-23 23:29:32,805 INFO L226 Difference]: Without dead ends: 1352 [2019-11-23 23:29:32,808 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-23 23:29:32,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2019-11-23 23:29:32,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1068. [2019-11-23 23:29:32,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-23 23:29:32,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1192 transitions. [2019-11-23 23:29:32,833 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1192 transitions. Word has length 134 [2019-11-23 23:29:32,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:32,834 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1192 transitions. [2019-11-23 23:29:32,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:32,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1192 transitions. [2019-11-23 23:29:32,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-23 23:29:32,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:32,837 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:32,837 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:32,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:32,838 INFO L82 PathProgramCache]: Analyzing trace with hash 2055487190, now seen corresponding path program 1 times [2019-11-23 23:29:32,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:32,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865727367] [2019-11-23 23:29:32,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:33,021 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-23 23:29:33,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865727367] [2019-11-23 23:29:33,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614818550] [2019-11-23 23:29:33,022 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:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:33,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:29:33,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:29:33,233 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-23 23:29:33,233 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:29:33,277 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-23 23:29:33,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:29:33,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-23 23:29:33,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632464128] [2019-11-23 23:29:33,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:33,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:33,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:33,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:29:33,280 INFO L87 Difference]: Start difference. First operand 1068 states and 1192 transitions. Second operand 3 states. [2019-11-23 23:29:33,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:33,560 INFO L93 Difference]: Finished difference Result 2206 states and 2466 transitions. [2019-11-23 23:29:33,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:33,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-11-23 23:29:33,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:33,565 INFO L225 Difference]: With dead ends: 2206 [2019-11-23 23:29:33,566 INFO L226 Difference]: Without dead ends: 1139 [2019-11-23 23:29:33,567 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 326 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:29:33,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2019-11-23 23:29:33,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1068. [2019-11-23 23:29:33,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-23 23:29:33,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1165 transitions. [2019-11-23 23:29:33,595 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1165 transitions. Word has length 164 [2019-11-23 23:29:33,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:33,595 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1165 transitions. [2019-11-23 23:29:33,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:33,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1165 transitions. [2019-11-23 23:29:33,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-23 23:29:33,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:33,599 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:33,803 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:29:33,803 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:33,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:33,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1425420626, now seen corresponding path program 1 times [2019-11-23 23:29:33,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:33,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681735226] [2019-11-23 23:29:33,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:34,163 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 161 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:29:34,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681735226] [2019-11-23 23:29:34,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201280981] [2019-11-23 23:29:34,164 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-23 23:29:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:34,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:29:34,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:29:34,327 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-23 23:29:34,327 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:29:34,356 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-23 23:29:34,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:29:34,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2019-11-23 23:29:34,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823070627] [2019-11-23 23:29:34,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:34,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:34,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:34,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-11-23 23:29:34,359 INFO L87 Difference]: Start difference. First operand 1068 states and 1165 transitions. Second operand 3 states. [2019-11-23 23:29:34,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:34,581 INFO L93 Difference]: Finished difference Result 1139 states and 1238 transitions. [2019-11-23 23:29:34,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:34,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-11-23 23:29:34,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:34,583 INFO L225 Difference]: With dead ends: 1139 [2019-11-23 23:29:34,583 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:29:34,585 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 331 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-11-23 23:29:34,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:29:34,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:29:34,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:29:34,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:29:34,586 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 167 [2019-11-23 23:29:34,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:34,586 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:29:34,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:34,586 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:29:34,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:29:34,793 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:29:34,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:29:34,962 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 87 [2019-11-23 23:29:35,399 WARN L192 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2019-11-23 23:29:35,743 WARN L192 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2019-11-23 23:29:35,747 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:29:35,747 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:29:35,747 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:29:35,747 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:29:35,747 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:29:35,747 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:29:35,748 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:29:35,748 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:29:35,748 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:29:35,748 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:29:35,748 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:29:35,748 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:29:35,748 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:29:35,748 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:29:35,748 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:29:35,748 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:29:35,748 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:29:35,749 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (<= 14 ~a8~0)) (.cse5 (<= ~a20~0 0)) (.cse1 (not (= 15 ~a8~0))) (.cse3 (= ~a16~0 5)) (.cse8 (= ~a16~0 4)) (.cse4 (not (= 1 ~a7~0))) (.cse2 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse7 (= 13 ~a8~0)) (.cse9 (= ~a17~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2 .cse5) (and .cse0 .cse4 .cse2 .cse6) (and .cse7 (not .cse3)) (and .cse2 .cse5 .cse3) (and .cse8 .cse2 .cse5) (and .cse8 .cse1 .cse9 .cse2) (and .cse1 .cse4 .cse2 .cse3) (and .cse8 .cse4 .cse2 .cse6) (and .cse7 .cse9))) [2019-11-23 23:29:35,749 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:29:35,749 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:29:35,749 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:29:35,750 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:29:35,750 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:29:35,750 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:29:35,750 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:29:35,750 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:29:35,750 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:29:35,751 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:29:35,751 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:29:35,751 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:29:35,751 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:29:35,751 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:29:35,751 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:29:35,751 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:29:35,751 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:29:35,752 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:29:35,752 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:29:35,752 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:29:35,752 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:29:35,752 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:29:35,752 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:29:35,752 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (<= 14 ~a8~0)) (.cse5 (<= ~a20~0 0)) (.cse1 (not (= 15 ~a8~0))) (.cse3 (= ~a16~0 5)) (.cse8 (= ~a16~0 4)) (.cse4 (not (= 1 ~a7~0))) (.cse2 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse7 (= 13 ~a8~0)) (.cse9 (= ~a17~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2 .cse5) (and .cse0 .cse4 .cse2 .cse6) (and .cse7 (not .cse3)) (and .cse2 .cse5 .cse3) (and .cse8 .cse2 .cse5) (and .cse8 .cse1 .cse9 .cse2) (and .cse1 .cse4 .cse2 .cse3) (and .cse8 .cse4 .cse2 .cse6) (and .cse7 .cse9))) [2019-11-23 23:29:35,753 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:29:35,753 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:29:35,753 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:29:35,753 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:29:35,753 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:29:35,753 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:29:35,753 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:29:35,753 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:29:35,754 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:29:35,754 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:29:35,754 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:29:35,754 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:29:35,754 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:29:35,754 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:29:35,754 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:29:35,754 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:29:35,754 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:29:35,754 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:29:35,754 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:29:35,755 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:29:35,755 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:29:35,755 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:29:35,755 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:29:35,755 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:29:35,755 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 563) no Hoare annotation was computed. [2019-11-23 23:29:35,755 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:29:35,755 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:29:35,755 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:29:35,755 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:29:35,755 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:29:35,755 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-23 23:29:35,755 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:29:35,756 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:29:35,756 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:29:35,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:29:35 BoogieIcfgContainer [2019-11-23 23:29:35,777 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:29:35,779 INFO L168 Benchmark]: Toolchain (without parser) took 12747.65 ms. Allocated memory was 144.7 MB in the beginning and 418.4 MB in the end (delta: 273.7 MB). Free memory was 101.0 MB in the beginning and 223.8 MB in the end (delta: -122.8 MB). Peak memory consumption was 242.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:35,780 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-11-23 23:29:35,781 INFO L168 Benchmark]: CACSL2BoogieTranslator took 889.08 ms. Allocated memory was 144.7 MB in the beginning and 203.9 MB in the end (delta: 59.2 MB). Free memory was 100.8 MB in the beginning and 167.2 MB in the end (delta: -66.4 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:35,782 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.12 ms. Allocated memory is still 203.9 MB. Free memory was 167.2 MB in the beginning and 160.9 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:35,783 INFO L168 Benchmark]: Boogie Preprocessor took 107.21 ms. Allocated memory is still 203.9 MB. Free memory was 160.9 MB in the beginning and 154.8 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:35,784 INFO L168 Benchmark]: RCFGBuilder took 2231.21 ms. Allocated memory was 203.9 MB in the beginning and 249.0 MB in the end (delta: 45.1 MB). Free memory was 154.8 MB in the beginning and 198.7 MB in the end (delta: -43.8 MB). Peak memory consumption was 110.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:35,785 INFO L168 Benchmark]: TraceAbstraction took 9422.03 ms. Allocated memory was 249.0 MB in the beginning and 418.4 MB in the end (delta: 169.3 MB). Free memory was 198.7 MB in the beginning and 223.8 MB in the end (delta: -25.2 MB). Peak memory consumption was 236.2 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:35,789 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.25 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 889.08 ms. Allocated memory was 144.7 MB in the beginning and 203.9 MB in the end (delta: 59.2 MB). Free memory was 100.8 MB in the beginning and 167.2 MB in the end (delta: -66.4 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 93.12 ms. Allocated memory is still 203.9 MB. Free memory was 167.2 MB in the beginning and 160.9 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.21 ms. Allocated memory is still 203.9 MB. Free memory was 160.9 MB in the beginning and 154.8 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2231.21 ms. Allocated memory was 203.9 MB in the beginning and 249.0 MB in the end (delta: 45.1 MB). Free memory was 154.8 MB in the beginning and 198.7 MB in the end (delta: -43.8 MB). Peak memory consumption was 110.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9422.03 ms. Allocated memory was 249.0 MB in the beginning and 418.4 MB in the end (delta: 169.3 MB). Free memory was 198.7 MB in the beginning and 223.8 MB in the end (delta: -25.2 MB). Peak memory consumption was 236.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 563]: 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: (((((((((((14 <= a8 && !(15 == a8)) && a21 == 1) && a16 == 5) || (((14 <= a8 && !(1 == a7)) && a21 == 1) && a20 <= 0)) || (((14 <= a8 && !(1 == a7)) && a21 == 1) && a20 == 1)) || (13 == a8 && !(a16 == 5))) || ((a21 == 1 && a20 <= 0) && a16 == 5)) || ((a16 == 4 && a21 == 1) && a20 <= 0)) || (((a16 == 4 && !(15 == a8)) && a17 == 1) && a21 == 1)) || (((!(15 == a8) && !(1 == a7)) && a21 == 1) && a16 == 5)) || (((a16 == 4 && !(1 == a7)) && a21 == 1) && a20 == 1)) || (13 == a8 && a17 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((14 <= a8 && !(15 == a8)) && a21 == 1) && a16 == 5) || (((14 <= a8 && !(1 == a7)) && a21 == 1) && a20 <= 0)) || (((14 <= a8 && !(1 == a7)) && a21 == 1) && a20 == 1)) || (13 == a8 && !(a16 == 5))) || ((a21 == 1 && a20 <= 0) && a16 == 5)) || ((a16 == 4 && a21 == 1) && a20 <= 0)) || (((a16 == 4 && !(15 == a8)) && a17 == 1) && a21 == 1)) || (((!(15 == a8) && !(1 == a7)) && a21 == 1) && a16 == 5)) || (((a16 == 4 && !(1 == a7)) && a21 == 1) && a20 == 1)) || (13 == a8 && a17 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 9.3s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, HoareTripleCheckerStatistics: 586 SDtfs, 1365 SDslu, 86 SDs, 0 SdLazy, 3235 SolverSat, 954 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 704 GetRequests, 667 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1139occurred in iteration=7, 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, 846 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 52 NumberOfFragments, 243 HoareAnnotationTreeSize, 3 FomulaSimplifications, 8294 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1628 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1424 NumberOfCodeBlocks, 1424 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1741 ConstructedInterpolants, 0 QuantifiedInterpolants, 705422 SizeOfPredicates, 2 NumberOfNonLiveVariables, 767 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 1338/1385 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...