/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/Problem02_label22.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:32:27,682 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:32:27,685 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:32:27,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:32:27,700 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:32:27,701 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:32:27,703 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:32:27,704 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:32:27,706 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:32:27,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:32:27,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:32:27,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:32:27,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:32:27,710 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:32:27,711 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:32:27,712 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:32:27,713 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:32:27,714 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:32:27,716 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:32:27,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:32:27,719 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:32:27,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:32:27,721 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:32:27,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:32:27,724 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:32:27,724 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:32:27,725 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:32:27,725 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:32:27,726 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:32:27,727 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:32:27,727 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:32:27,728 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:32:27,729 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:32:27,729 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:32:27,730 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:32:27,730 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:32:27,731 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:32:27,731 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:32:27,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:32:27,733 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:32:27,733 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:32:27,734 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:32:27,749 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:32:27,749 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:32:27,750 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:32:27,750 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:32:27,750 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:32:27,750 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:32:27,750 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:32:27,751 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:32:27,751 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:32:27,751 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:32:27,751 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:32:27,751 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:32:27,751 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:32:27,752 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:32:27,752 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:32:27,752 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:32:27,753 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:32:27,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:32:27,753 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:32:27,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:32:27,753 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:32:27,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:32:27,754 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:32:27,754 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:32:27,754 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:32:27,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:32:27,755 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:32:27,755 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:32:27,755 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:32:27,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:32:27,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:32:27,756 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:32:27,756 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:32:27,756 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:32:27,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:32:27,756 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:32:27,757 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:32:27,757 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:32:28,051 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:32:28,069 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:32:28,073 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:32:28,074 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:32:28,074 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:32:28,075 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label22.c [2019-11-23 23:32:28,134 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/275cd5777/07257628e8534f90ac027debab806d7b/FLAG652f2c89e [2019-11-23 23:32:28,681 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:32:28,682 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label22.c [2019-11-23 23:32:28,696 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/275cd5777/07257628e8534f90ac027debab806d7b/FLAG652f2c89e [2019-11-23 23:32:28,956 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/275cd5777/07257628e8534f90ac027debab806d7b [2019-11-23 23:32:28,966 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:32:28,968 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:32:28,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:32:28,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:32:28,972 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:32:28,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:28" (1/1) ... [2019-11-23 23:32:28,976 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aa3939b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:28, skipping insertion in model container [2019-11-23 23:32:28,976 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:28" (1/1) ... [2019-11-23 23:32:28,984 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:32:29,040 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:32:29,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:32:29,533 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:32:29,667 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:32:29,700 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:32:29,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29 WrapperNode [2019-11-23 23:32:29,701 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:32:29,702 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:32:29,702 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:32:29,702 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:32:29,712 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:32:29" (1/1) ... [2019-11-23 23:32:29,746 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:32:29" (1/1) ... [2019-11-23 23:32:29,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:32:29,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:32:29,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:32:29,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:32:29,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29" (1/1) ... [2019-11-23 23:32:29,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29" (1/1) ... [2019-11-23 23:32:29,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29" (1/1) ... [2019-11-23 23:32:29,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29" (1/1) ... [2019-11-23 23:32:29,937 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29" (1/1) ... [2019-11-23 23:32:29,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29" (1/1) ... [2019-11-23 23:32:29,973 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29" (1/1) ... [2019-11-23 23:32:29,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:32:29,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:32:29,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:32:29,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:32:29,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29" (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:32:30,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:32:30,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:32:32,247 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:32:32,248 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:32:32,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:32 BoogieIcfgContainer [2019-11-23 23:32:32,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:32:32,253 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:32:32,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:32:32,257 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:32:32,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:32:28" (1/3) ... [2019-11-23 23:32:32,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4352b130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:32, skipping insertion in model container [2019-11-23 23:32:32,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29" (2/3) ... [2019-11-23 23:32:32,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4352b130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:32, skipping insertion in model container [2019-11-23 23:32:32,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:32" (3/3) ... [2019-11-23 23:32:32,262 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label22.c [2019-11-23 23:32:32,272 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:32:32,280 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:32:32,292 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:32:32,327 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:32:32,327 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:32:32,327 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:32:32,327 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:32:32,328 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:32:32,328 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:32:32,328 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:32:32,328 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:32:32,353 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-23 23:32:32,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 23:32:32,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:32,365 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:32,365 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:32,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:32,372 INFO L82 PathProgramCache]: Analyzing trace with hash 925946761, now seen corresponding path program 1 times [2019-11-23 23:32:32,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:32,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802670218] [2019-11-23 23:32:32,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:32,783 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:32:32,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802670218] [2019-11-23 23:32:32,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:32,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:32,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791928120] [2019-11-23 23:32:32,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:32,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:32,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:32,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:32,810 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2019-11-23 23:32:33,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:33,603 INFO L93 Difference]: Finished difference Result 333 states and 641 transitions. [2019-11-23 23:32:33,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:33,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-23 23:32:33,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:33,630 INFO L225 Difference]: With dead ends: 333 [2019-11-23 23:32:33,630 INFO L226 Difference]: Without dead ends: 243 [2019-11-23 23:32:33,638 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:32:33,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-23 23:32:33,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-11-23 23:32:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-23 23:32:33,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 453 transitions. [2019-11-23 23:32:33,734 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 453 transitions. Word has length 80 [2019-11-23 23:32:33,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:33,735 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 453 transitions. [2019-11-23 23:32:33,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:33,736 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 453 transitions. [2019-11-23 23:32:33,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-23 23:32:33,740 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:33,741 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:33,741 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:33,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:33,742 INFO L82 PathProgramCache]: Analyzing trace with hash 221747240, now seen corresponding path program 1 times [2019-11-23 23:32:33,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:33,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953403649] [2019-11-23 23:32:33,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:33,854 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:33,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953403649] [2019-11-23 23:32:33,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:33,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:33,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55114610] [2019-11-23 23:32:33,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:33,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:33,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:33,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:33,858 INFO L87 Difference]: Start difference. First operand 243 states and 453 transitions. Second operand 4 states. [2019-11-23 23:32:34,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:34,451 INFO L93 Difference]: Finished difference Result 807 states and 1498 transitions. [2019-11-23 23:32:34,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:34,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-23 23:32:34,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:34,457 INFO L225 Difference]: With dead ends: 807 [2019-11-23 23:32:34,457 INFO L226 Difference]: Without dead ends: 565 [2019-11-23 23:32:34,460 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:32:34,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-11-23 23:32:34,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 403. [2019-11-23 23:32:34,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-11-23 23:32:34,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 719 transitions. [2019-11-23 23:32:34,490 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 719 transitions. Word has length 98 [2019-11-23 23:32:34,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:34,490 INFO L462 AbstractCegarLoop]: Abstraction has 403 states and 719 transitions. [2019-11-23 23:32:34,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:34,490 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 719 transitions. [2019-11-23 23:32:34,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-23 23:32:34,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:34,496 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:34,497 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:34,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:34,497 INFO L82 PathProgramCache]: Analyzing trace with hash -875197987, now seen corresponding path program 1 times [2019-11-23 23:32:34,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:34,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348271206] [2019-11-23 23:32:34,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:34,605 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:34,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348271206] [2019-11-23 23:32:34,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:34,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:34,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184463102] [2019-11-23 23:32:34,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:34,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:34,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:34,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:34,609 INFO L87 Difference]: Start difference. First operand 403 states and 719 transitions. Second operand 4 states. [2019-11-23 23:32:35,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:35,412 INFO L93 Difference]: Finished difference Result 1445 states and 2561 transitions. [2019-11-23 23:32:35,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:35,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-23 23:32:35,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:35,419 INFO L225 Difference]: With dead ends: 1445 [2019-11-23 23:32:35,419 INFO L226 Difference]: Without dead ends: 1043 [2019-11-23 23:32:35,421 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:32:35,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-11-23 23:32:35,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 883. [2019-11-23 23:32:35,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-11-23 23:32:35,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1446 transitions. [2019-11-23 23:32:35,461 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1446 transitions. Word has length 102 [2019-11-23 23:32:35,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:35,461 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1446 transitions. [2019-11-23 23:32:35,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:35,461 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1446 transitions. [2019-11-23 23:32:35,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-23 23:32:35,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:35,474 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:35,474 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:35,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:35,474 INFO L82 PathProgramCache]: Analyzing trace with hash 11612466, now seen corresponding path program 1 times [2019-11-23 23:32:35,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:35,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631471373] [2019-11-23 23:32:35,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:35,553 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:35,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631471373] [2019-11-23 23:32:35,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:35,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:32:35,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575288236] [2019-11-23 23:32:35,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:35,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:35,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:35,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:35,555 INFO L87 Difference]: Start difference. First operand 883 states and 1446 transitions. Second operand 3 states. [2019-11-23 23:32:36,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:36,093 INFO L93 Difference]: Finished difference Result 2165 states and 3502 transitions. [2019-11-23 23:32:36,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:36,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-23 23:32:36,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:36,102 INFO L225 Difference]: With dead ends: 2165 [2019-11-23 23:32:36,102 INFO L226 Difference]: Without dead ends: 1283 [2019-11-23 23:32:36,104 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:32:36,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-11-23 23:32:36,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2019-11-23 23:32:36,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-11-23 23:32:36,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1842 transitions. [2019-11-23 23:32:36,170 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1842 transitions. Word has length 102 [2019-11-23 23:32:36,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:36,171 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 1842 transitions. [2019-11-23 23:32:36,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:36,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1842 transitions. [2019-11-23 23:32:36,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-23 23:32:36,174 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:36,174 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:36,174 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:36,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:36,175 INFO L82 PathProgramCache]: Analyzing trace with hash -2118178421, now seen corresponding path program 1 times [2019-11-23 23:32:36,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:36,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725266154] [2019-11-23 23:32:36,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:36,266 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 23:32:36,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725266154] [2019-11-23 23:32:36,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:36,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:36,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402543372] [2019-11-23 23:32:36,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:36,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:36,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:36,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:36,268 INFO L87 Difference]: Start difference. First operand 1283 states and 1842 transitions. Second operand 3 states. [2019-11-23 23:32:36,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:36,748 INFO L93 Difference]: Finished difference Result 3045 states and 4319 transitions. [2019-11-23 23:32:36,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:36,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-11-23 23:32:36,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:36,756 INFO L225 Difference]: With dead ends: 3045 [2019-11-23 23:32:36,756 INFO L226 Difference]: Without dead ends: 1443 [2019-11-23 23:32:36,759 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:32:36,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2019-11-23 23:32:36,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1123. [2019-11-23 23:32:36,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-11-23 23:32:36,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1463 transitions. [2019-11-23 23:32:36,791 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1463 transitions. Word has length 107 [2019-11-23 23:32:36,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:36,792 INFO L462 AbstractCegarLoop]: Abstraction has 1123 states and 1463 transitions. [2019-11-23 23:32:36,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:36,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1463 transitions. [2019-11-23 23:32:36,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-23 23:32:36,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:36,795 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:36,795 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:36,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:36,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1735821681, now seen corresponding path program 1 times [2019-11-23 23:32:36,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:36,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29062403] [2019-11-23 23:32:36,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:36,879 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 23:32:36,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29062403] [2019-11-23 23:32:36,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:36,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:36,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290525694] [2019-11-23 23:32:36,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:36,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:36,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:36,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:36,881 INFO L87 Difference]: Start difference. First operand 1123 states and 1463 transitions. Second operand 4 states. [2019-11-23 23:32:37,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:37,520 INFO L93 Difference]: Finished difference Result 2725 states and 3556 transitions. [2019-11-23 23:32:37,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:37,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-23 23:32:37,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:37,528 INFO L225 Difference]: With dead ends: 2725 [2019-11-23 23:32:37,528 INFO L226 Difference]: Without dead ends: 1363 [2019-11-23 23:32:37,530 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:32:37,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-11-23 23:32:37,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 963. [2019-11-23 23:32:37,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-11-23 23:32:37,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1224 transitions. [2019-11-23 23:32:37,555 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1224 transitions. Word has length 118 [2019-11-23 23:32:37,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:37,555 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 1224 transitions. [2019-11-23 23:32:37,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:37,556 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1224 transitions. [2019-11-23 23:32:37,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-23 23:32:37,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:37,558 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:37,558 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:37,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:37,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1692477197, now seen corresponding path program 1 times [2019-11-23 23:32:37,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:37,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101030984] [2019-11-23 23:32:37,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:37,634 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 23:32:37,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101030984] [2019-11-23 23:32:37,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:37,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:37,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663260704] [2019-11-23 23:32:37,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:37,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:37,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:37,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:37,637 INFO L87 Difference]: Start difference. First operand 963 states and 1224 transitions. Second operand 3 states. [2019-11-23 23:32:37,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:37,933 INFO L93 Difference]: Finished difference Result 2005 states and 2525 transitions. [2019-11-23 23:32:37,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:37,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-11-23 23:32:37,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:37,939 INFO L225 Difference]: With dead ends: 2005 [2019-11-23 23:32:37,939 INFO L226 Difference]: Without dead ends: 1043 [2019-11-23 23:32:37,941 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:32:37,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-11-23 23:32:37,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1043. [2019-11-23 23:32:37,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-11-23 23:32:37,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1236 transitions. [2019-11-23 23:32:37,967 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1236 transitions. Word has length 131 [2019-11-23 23:32:37,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:37,967 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1236 transitions. [2019-11-23 23:32:37,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:37,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1236 transitions. [2019-11-23 23:32:37,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-23 23:32:37,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:37,974 INFO L410 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 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, 1] [2019-11-23 23:32:37,974 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:37,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:37,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1881565628, now seen corresponding path program 1 times [2019-11-23 23:32:37,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:37,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832822144] [2019-11-23 23:32:37,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:38,181 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 125 proven. 3 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-11-23 23:32:38,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832822144] [2019-11-23 23:32:38,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534084142] [2019-11-23 23:32:38,182 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:32:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:38,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-23 23:32:38,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:32:38,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:32:38,434 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-11-23 23:32:38,434 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:32:38,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 23:32:38,503 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-11-23 23:32:38,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:32:38,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 6 [2019-11-23 23:32:38,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461275554] [2019-11-23 23:32:38,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:32:38,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:38,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:32:38,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:32:38,506 INFO L87 Difference]: Start difference. First operand 1043 states and 1236 transitions. Second operand 5 states. [2019-11-23 23:32:39,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:39,243 INFO L93 Difference]: Finished difference Result 2121 states and 2507 transitions. [2019-11-23 23:32:39,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 23:32:39,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2019-11-23 23:32:39,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:39,248 INFO L225 Difference]: With dead ends: 2121 [2019-11-23 23:32:39,248 INFO L226 Difference]: Without dead ends: 1079 [2019-11-23 23:32:39,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 443 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-23 23:32:39,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-11-23 23:32:39,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1043. [2019-11-23 23:32:39,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-11-23 23:32:39,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1223 transitions. [2019-11-23 23:32:39,292 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1223 transitions. Word has length 223 [2019-11-23 23:32:39,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:39,293 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1223 transitions. [2019-11-23 23:32:39,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:32:39,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1223 transitions. [2019-11-23 23:32:39,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-11-23 23:32:39,301 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:39,302 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1] [2019-11-23 23:32:39,516 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:32:39,517 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:39,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:39,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1701280113, now seen corresponding path program 1 times [2019-11-23 23:32:39,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:39,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566604038] [2019-11-23 23:32:39,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:39,651 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2019-11-23 23:32:39,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566604038] [2019-11-23 23:32:39,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:39,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:32:39,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858902123] [2019-11-23 23:32:39,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:39,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:39,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:39,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:39,654 INFO L87 Difference]: Start difference. First operand 1043 states and 1223 transitions. Second operand 3 states. [2019-11-23 23:32:39,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:39,962 INFO L93 Difference]: Finished difference Result 2485 states and 2935 transitions. [2019-11-23 23:32:39,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:39,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-11-23 23:32:39,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:39,969 INFO L225 Difference]: With dead ends: 2485 [2019-11-23 23:32:39,970 INFO L226 Difference]: Without dead ends: 1363 [2019-11-23 23:32:39,972 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 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:32:39,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-11-23 23:32:39,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1203. [2019-11-23 23:32:39,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-11-23 23:32:40,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1381 transitions. [2019-11-23 23:32:40,002 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1381 transitions. Word has length 251 [2019-11-23 23:32:40,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:40,003 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 1381 transitions. [2019-11-23 23:32:40,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:40,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1381 transitions. [2019-11-23 23:32:40,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-11-23 23:32:40,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:40,007 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1] [2019-11-23 23:32:40,008 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:40,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:40,008 INFO L82 PathProgramCache]: Analyzing trace with hash 916985848, now seen corresponding path program 1 times [2019-11-23 23:32:40,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:40,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125357584] [2019-11-23 23:32:40,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:40,298 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 250 proven. 9 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-11-23 23:32:40,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125357584] [2019-11-23 23:32:40,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579570422] [2019-11-23 23:32:40,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:32:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:40,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:32:40,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:32:40,471 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2019-11-23 23:32:40,472 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:32:40,517 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2019-11-23 23:32:40,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:32:40,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 10 [2019-11-23 23:32:40,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90404377] [2019-11-23 23:32:40,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:40,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:40,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:40,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-23 23:32:40,519 INFO L87 Difference]: Start difference. First operand 1203 states and 1381 transitions. Second operand 4 states. [2019-11-23 23:32:41,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:41,035 INFO L93 Difference]: Finished difference Result 2483 states and 2835 transitions. [2019-11-23 23:32:41,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:41,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2019-11-23 23:32:41,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:41,036 INFO L225 Difference]: With dead ends: 2483 [2019-11-23 23:32:41,036 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:32:41,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-23 23:32:41,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:32:41,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:32:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:32:41,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:32:41,039 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 256 [2019-11-23 23:32:41,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:41,039 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:32:41,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:41,040 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:32:41,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:32:41,244 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:32:41,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:32:41,956 WARN L192 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2019-11-23 23:32:42,599 WARN L192 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2019-11-23 23:32:42,604 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-23 23:32:42,604 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-23 23:32:42,605 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-23 23:32:42,605 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-23 23:32:42,605 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-23 23:32:42,605 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-23 23:32:42,605 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-23 23:32:42,605 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-23 23:32:42,605 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-23 23:32:42,605 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-23 23:32:42,606 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-23 23:32:42,606 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-23 23:32:42,606 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-23 23:32:42,606 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-23 23:32:42,606 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-23 23:32:42,606 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-23 23:32:42,606 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-23 23:32:42,606 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-23 23:32:42,606 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-23 23:32:42,606 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-23 23:32:42,606 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-23 23:32:42,606 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-23 23:32:42,606 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-23 23:32:42,607 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-23 23:32:42,607 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-23 23:32:42,607 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:32:42,607 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-23 23:32:42,607 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-23 23:32:42,607 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-23 23:32:42,607 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-23 23:32:42,607 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-23 23:32:42,607 INFO L444 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:32:42,608 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-23 23:32:42,608 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-23 23:32:42,608 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-23 23:32:42,608 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-23 23:32:42,608 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-23 23:32:42,608 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 463) no Hoare annotation was computed. [2019-11-23 23:32:42,609 INFO L444 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:32:42,609 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-23 23:32:42,609 INFO L444 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-11-23 23:32:42,609 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-23 23:32:42,609 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-23 23:32:42,609 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-23 23:32:42,610 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse6 (= ~a25~0 1))) (let ((.cse5 (not .cse6)) (.cse3 (not (= ~a28~0 11))) (.cse9 (= ~a11~0 1)) (.cse10 (= ~a19~0 1))) (let ((.cse7 (not .cse10)) (.cse4 (<= ~a19~0 0)) (.cse12 (= ~a28~0 7)) (.cse0 (<= 10 ~a28~0)) (.cse11 (or (and .cse5 .cse9 .cse3) (and .cse10 .cse9))) (.cse8 (= ~a28~0 9)) (.cse1 (= ~a17~0 8)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1) (and .cse1 .cse6 .cse3) (and .cse7 .cse5 .cse1 .cse3) (and .cse8 .cse4) (and .cse8 .cse7 .cse9) (and .cse0 .cse10 .cse6) (and .cse4 .cse11) (and .cse1 .cse12 .cse2) (and .cse12 .cse6 .cse11) (and .cse5 .cse1 .cse9 .cse3) (and .cse0 .cse11) (and .cse8 .cse1 .cse2))))) [2019-11-23 23:32:42,610 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-23 23:32:42,610 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-23 23:32:42,610 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-23 23:32:42,610 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-23 23:32:42,611 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-23 23:32:42,611 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-23 23:32:42,611 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-23 23:32:42,611 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-23 23:32:42,611 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-23 23:32:42,611 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-23 23:32:42,612 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse6 (= ~a25~0 1))) (let ((.cse5 (not .cse6)) (.cse3 (not (= ~a28~0 11))) (.cse9 (= ~a11~0 1)) (.cse10 (= ~a19~0 1))) (let ((.cse7 (not .cse10)) (.cse4 (<= ~a19~0 0)) (.cse12 (= ~a28~0 7)) (.cse0 (<= 10 ~a28~0)) (.cse11 (or (and .cse5 .cse9 .cse3) (and .cse10 .cse9))) (.cse8 (= ~a28~0 9)) (.cse1 (= ~a17~0 8)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1) (and .cse1 .cse6 .cse3) (and .cse7 .cse5 .cse1 .cse3) (and .cse8 .cse4) (and .cse8 .cse7 .cse9) (and .cse0 .cse10 .cse6) (and .cse4 .cse11) (and .cse1 .cse12 .cse2) (and .cse12 .cse6 .cse11) (and .cse5 .cse1 .cse9 .cse3) (and .cse0 .cse11) (and .cse8 .cse1 .cse2))))) [2019-11-23 23:32:42,612 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-23 23:32:42,612 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-23 23:32:42,612 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-23 23:32:42,612 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-23 23:32:42,612 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-23 23:32:42,612 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-23 23:32:42,612 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-23 23:32:42,613 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-23 23:32:42,613 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-23 23:32:42,613 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-23 23:32:42,613 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:32:42,613 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-23 23:32:42,613 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-23 23:32:42,613 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-23 23:32:42,613 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-23 23:32:42,613 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-23 23:32:42,614 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-23 23:32:42,614 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-23 23:32:42,614 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-23 23:32:42,614 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-23 23:32:42,614 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-23 23:32:42,614 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-23 23:32:42,614 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-23 23:32:42,614 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-23 23:32:42,614 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-23 23:32:42,615 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-23 23:32:42,615 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-23 23:32:42,615 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-23 23:32:42,615 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-23 23:32:42,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:32:42 BoogieIcfgContainer [2019-11-23 23:32:42,637 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:32:42,640 INFO L168 Benchmark]: Toolchain (without parser) took 13671.81 ms. Allocated memory was 135.3 MB in the beginning and 493.9 MB in the end (delta: 358.6 MB). Free memory was 97.2 MB in the beginning and 198.6 MB in the end (delta: -101.4 MB). Peak memory consumption was 257.2 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:42,640 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 135.3 MB. Free memory was 117.2 MB in the beginning and 117.0 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:32:42,641 INFO L168 Benchmark]: CACSL2BoogieTranslator took 732.79 ms. Allocated memory was 135.3 MB in the beginning and 201.9 MB in the end (delta: 66.6 MB). Free memory was 97.0 MB in the beginning and 167.3 MB in the end (delta: -70.3 MB). Peak memory consumption was 34.0 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:42,642 INFO L168 Benchmark]: Boogie Procedure Inliner took 162.62 ms. Allocated memory is still 201.9 MB. Free memory was 167.3 MB in the beginning and 162.0 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:42,643 INFO L168 Benchmark]: Boogie Preprocessor took 115.24 ms. Allocated memory is still 201.9 MB. Free memory was 162.0 MB in the beginning and 157.6 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:42,644 INFO L168 Benchmark]: RCFGBuilder took 2271.25 ms. Allocated memory was 201.9 MB in the beginning and 259.0 MB in the end (delta: 57.1 MB). Free memory was 156.8 MB in the beginning and 210.6 MB in the end (delta: -53.8 MB). Peak memory consumption was 114.1 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:42,645 INFO L168 Benchmark]: TraceAbstraction took 10384.89 ms. Allocated memory was 259.0 MB in the beginning and 493.9 MB in the end (delta: 234.9 MB). Free memory was 210.6 MB in the beginning and 198.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 246.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:42,649 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.19 ms. Allocated memory is still 135.3 MB. Free memory was 117.2 MB in the beginning and 117.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 732.79 ms. Allocated memory was 135.3 MB in the beginning and 201.9 MB in the end (delta: 66.6 MB). Free memory was 97.0 MB in the beginning and 167.3 MB in the end (delta: -70.3 MB). Peak memory consumption was 34.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 162.62 ms. Allocated memory is still 201.9 MB. Free memory was 167.3 MB in the beginning and 162.0 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.24 ms. Allocated memory is still 201.9 MB. Free memory was 162.0 MB in the beginning and 157.6 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2271.25 ms. Allocated memory was 201.9 MB in the beginning and 259.0 MB in the end (delta: 57.1 MB). Free memory was 156.8 MB in the beginning and 210.6 MB in the end (delta: -53.8 MB). Peak memory consumption was 114.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10384.89 ms. Allocated memory was 259.0 MB in the beginning and 493.9 MB in the end (delta: 234.9 MB). Free memory was 210.6 MB in the beginning and 198.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 246.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 463]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((((10 <= a28 && a17 == 8) && a21 == 1) && !(a28 == 11)) || ((a19 <= 0 && !(a25 == 1)) && a17 == 8)) || ((a17 == 8 && a25 == 1) && !(a28 == 11))) || (((!(a19 == 1) && !(a25 == 1)) && a17 == 8) && !(a28 == 11))) || (a28 == 9 && a19 <= 0)) || ((a28 == 9 && !(a19 == 1)) && a11 == 1)) || ((10 <= a28 && a19 == 1) && a25 == 1)) || (a19 <= 0 && (((!(a25 == 1) && a11 == 1) && !(a28 == 11)) || (a19 == 1 && a11 == 1)))) || ((a17 == 8 && a28 == 7) && a21 == 1)) || ((a28 == 7 && a25 == 1) && (((!(a25 == 1) && a11 == 1) && !(a28 == 11)) || (a19 == 1 && a11 == 1)))) || (((!(a25 == 1) && a17 == 8) && a11 == 1) && !(a28 == 11))) || (10 <= a28 && (((!(a25 == 1) && a11 == 1) && !(a28 == 11)) || (a19 == 1 && a11 == 1)))) || ((a28 == 9 && a17 == 8) && a21 == 1) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((((((10 <= a28 && a17 == 8) && a21 == 1) && !(a28 == 11)) || ((a19 <= 0 && !(a25 == 1)) && a17 == 8)) || ((a17 == 8 && a25 == 1) && !(a28 == 11))) || (((!(a19 == 1) && !(a25 == 1)) && a17 == 8) && !(a28 == 11))) || (a28 == 9 && a19 <= 0)) || ((a28 == 9 && !(a19 == 1)) && a11 == 1)) || ((10 <= a28 && a19 == 1) && a25 == 1)) || (a19 <= 0 && (((!(a25 == 1) && a11 == 1) && !(a28 == 11)) || (a19 == 1 && a11 == 1)))) || ((a17 == 8 && a28 == 7) && a21 == 1)) || ((a28 == 7 && a25 == 1) && (((!(a25 == 1) && a11 == 1) && !(a28 == 11)) || (a19 == 1 && a11 == 1)))) || (((!(a25 == 1) && a17 == 8) && a11 == 1) && !(a28 == 11))) || (10 <= a28 && (((!(a25 == 1) && a11 == 1) && !(a28 == 11)) || (a19 == 1 && a11 == 1)))) || ((a28 == 9 && a17 == 8) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 10.2s, OverallIterations: 10, TraceHistogramMax: 6, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, HoareTripleCheckerStatistics: 737 SDtfs, 1212 SDslu, 125 SDs, 0 SdLazy, 3527 SolverSat, 837 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 997 GetRequests, 964 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1283occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 1238 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 54 NumberOfFragments, 383 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1710 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1640 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1947 NumberOfCodeBlocks, 1947 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2412 ConstructedInterpolants, 0 QuantifiedInterpolants, 1193848 SizeOfPredicates, 8 NumberOfNonLiveVariables, 847 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 2601/2613 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...