/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_label04.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:31:55,686 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:31:55,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:31:55,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:31:55,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:31:55,702 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:31:55,703 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:31:55,705 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:31:55,706 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:31:55,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:31:55,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:31:55,710 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:31:55,710 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:31:55,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:31:55,712 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:31:55,713 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:31:55,714 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:31:55,715 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:31:55,717 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:31:55,719 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:31:55,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:31:55,721 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:31:55,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:31:55,723 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:31:55,726 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:31:55,726 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:31:55,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:31:55,727 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:31:55,728 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:31:55,731 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:31:55,731 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:31:55,732 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:31:55,733 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:31:55,734 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:31:55,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:31:55,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:31:55,735 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:31:55,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:31:55,736 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:31:55,737 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:31:55,738 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:31:55,738 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:31:55,765 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:31:55,765 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:31:55,767 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:31:55,767 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:31:55,767 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:31:55,767 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:31:55,768 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:31:55,768 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:31:55,768 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:31:55,768 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:31:55,769 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:31:55,770 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:31:55,770 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:31:55,770 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:31:55,771 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:31:55,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:31:55,772 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:31:55,772 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:31:55,773 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:31:55,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:31:55,773 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:31:55,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:31:55,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:31:55,774 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:31:55,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:31:55,774 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:31:55,775 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:31:55,775 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:31:55,776 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:31:55,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:31:55,776 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:31:55,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:31:55,777 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:31:55,777 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:31:55,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:31:55,778 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:31:55,778 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:31:55,778 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:31:56,091 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:31:56,114 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:31:56,117 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:31:56,119 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:31:56,119 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:31:56,120 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label04.c [2019-11-23 23:31:56,187 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cee3864af/b7841954c1ed45ebadeedf5308f296b1/FLAG27f8df73e [2019-11-23 23:31:56,774 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:31:56,774 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label04.c [2019-11-23 23:31:56,788 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cee3864af/b7841954c1ed45ebadeedf5308f296b1/FLAG27f8df73e [2019-11-23 23:31:57,021 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cee3864af/b7841954c1ed45ebadeedf5308f296b1 [2019-11-23 23:31:57,031 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:31:57,033 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:31:57,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:31:57,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:31:57,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:31:57,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:31:57" (1/1) ... [2019-11-23 23:31:57,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ab7ede9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:57, skipping insertion in model container [2019-11-23 23:31:57,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:31:57" (1/1) ... [2019-11-23 23:31:57,049 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:31:57,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:31:57,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:31:57,589 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:31:57,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:31:57,725 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:31:57,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:57 WrapperNode [2019-11-23 23:31:57,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:31:57,727 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:31:57,727 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:31:57,727 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:31:57,736 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:31:57" (1/1) ... [2019-11-23 23:31:57,769 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:31:57" (1/1) ... [2019-11-23 23:31:57,844 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:31:57,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:31:57,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:31:57,845 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:31:57,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:57" (1/1) ... [2019-11-23 23:31:57,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:57" (1/1) ... [2019-11-23 23:31:57,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:57" (1/1) ... [2019-11-23 23:31:57,873 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:57" (1/1) ... [2019-11-23 23:31:57,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:57" (1/1) ... [2019-11-23 23:31:57,934 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:57" (1/1) ... [2019-11-23 23:31:57,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:57" (1/1) ... [2019-11-23 23:31:57,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:31:57,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:31:57,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:31:57,955 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:31:57,956 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:57" (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:31:58,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:31:58,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:32:00,254 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:32:00,255 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:32:00,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:00 BoogieIcfgContainer [2019-11-23 23:32:00,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:32:00,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:32:00,258 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:32:00,261 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:32:00,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:31:57" (1/3) ... [2019-11-23 23:32:00,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e92995a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:00, skipping insertion in model container [2019-11-23 23:32:00,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:57" (2/3) ... [2019-11-23 23:32:00,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e92995a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:00, skipping insertion in model container [2019-11-23 23:32:00,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:00" (3/3) ... [2019-11-23 23:32:00,265 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label04.c [2019-11-23 23:32:00,275 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:32:00,283 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:32:00,295 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:32:00,321 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:32:00,321 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:32:00,322 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:32:00,322 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:32:00,322 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:32:00,322 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:32:00,322 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:32:00,322 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:32:00,340 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-23 23:32:00,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 23:32:00,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:00,351 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:00,352 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:00,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:00,358 INFO L82 PathProgramCache]: Analyzing trace with hash 925949065, now seen corresponding path program 1 times [2019-11-23 23:32:00,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:00,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923914687] [2019-11-23 23:32:00,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:00,753 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:00,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923914687] [2019-11-23 23:32:00,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:00,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:00,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043696693] [2019-11-23 23:32:00,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:00,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:00,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:00,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:00,782 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2019-11-23 23:32:01,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:01,669 INFO L93 Difference]: Finished difference Result 333 states and 641 transitions. [2019-11-23 23:32:01,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:01,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-23 23:32:01,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:01,690 INFO L225 Difference]: With dead ends: 333 [2019-11-23 23:32:01,690 INFO L226 Difference]: Without dead ends: 243 [2019-11-23 23:32:01,695 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:01,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-23 23:32:01,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-11-23 23:32:01,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-23 23:32:01,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 453 transitions. [2019-11-23 23:32:01,792 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 453 transitions. Word has length 80 [2019-11-23 23:32:01,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:01,794 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 453 transitions. [2019-11-23 23:32:01,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:01,794 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 453 transitions. [2019-11-23 23:32:01,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-23 23:32:01,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:01,802 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:01,802 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:01,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:01,803 INFO L82 PathProgramCache]: Analyzing trace with hash 221749544, now seen corresponding path program 1 times [2019-11-23 23:32:01,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:01,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34432158] [2019-11-23 23:32:01,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:01,885 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:01,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34432158] [2019-11-23 23:32:01,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:01,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:01,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837912668] [2019-11-23 23:32:01,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:01,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:01,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:01,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:01,889 INFO L87 Difference]: Start difference. First operand 243 states and 453 transitions. Second operand 4 states. [2019-11-23 23:32:02,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:02,480 INFO L93 Difference]: Finished difference Result 807 states and 1498 transitions. [2019-11-23 23:32:02,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:02,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-23 23:32:02,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:02,486 INFO L225 Difference]: With dead ends: 807 [2019-11-23 23:32:02,486 INFO L226 Difference]: Without dead ends: 565 [2019-11-23 23:32:02,489 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:02,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-11-23 23:32:02,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 403. [2019-11-23 23:32:02,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-11-23 23:32:02,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 719 transitions. [2019-11-23 23:32:02,549 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 719 transitions. Word has length 98 [2019-11-23 23:32:02,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:02,550 INFO L462 AbstractCegarLoop]: Abstraction has 403 states and 719 transitions. [2019-11-23 23:32:02,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:02,550 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 719 transitions. [2019-11-23 23:32:02,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-23 23:32:02,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:02,556 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:02,556 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:02,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:02,560 INFO L82 PathProgramCache]: Analyzing trace with hash -875195683, now seen corresponding path program 1 times [2019-11-23 23:32:02,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:02,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642164314] [2019-11-23 23:32:02,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:02,700 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:02,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642164314] [2019-11-23 23:32:02,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:02,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:02,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312918038] [2019-11-23 23:32:02,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:02,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:02,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:02,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:02,702 INFO L87 Difference]: Start difference. First operand 403 states and 719 transitions. Second operand 4 states. [2019-11-23 23:32:03,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:03,498 INFO L93 Difference]: Finished difference Result 1445 states and 2561 transitions. [2019-11-23 23:32:03,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:03,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-23 23:32:03,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:03,504 INFO L225 Difference]: With dead ends: 1445 [2019-11-23 23:32:03,505 INFO L226 Difference]: Without dead ends: 1043 [2019-11-23 23:32:03,506 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:03,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-11-23 23:32:03,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 883. [2019-11-23 23:32:03,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-11-23 23:32:03,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1447 transitions. [2019-11-23 23:32:03,536 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1447 transitions. Word has length 102 [2019-11-23 23:32:03,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:03,537 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1447 transitions. [2019-11-23 23:32:03,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:03,537 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1447 transitions. [2019-11-23 23:32:03,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-23 23:32:03,540 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:03,541 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:03,541 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:03,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:03,541 INFO L82 PathProgramCache]: Analyzing trace with hash 11614770, now seen corresponding path program 1 times [2019-11-23 23:32:03,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:03,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363759052] [2019-11-23 23:32:03,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:03,614 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:03,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363759052] [2019-11-23 23:32:03,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:03,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:32:03,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157865913] [2019-11-23 23:32:03,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:03,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:03,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:03,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:03,618 INFO L87 Difference]: Start difference. First operand 883 states and 1447 transitions. Second operand 3 states. [2019-11-23 23:32:04,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:04,063 INFO L93 Difference]: Finished difference Result 2165 states and 3504 transitions. [2019-11-23 23:32:04,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:04,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-23 23:32:04,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:04,071 INFO L225 Difference]: With dead ends: 2165 [2019-11-23 23:32:04,071 INFO L226 Difference]: Without dead ends: 1283 [2019-11-23 23:32:04,073 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:04,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-11-23 23:32:04,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2019-11-23 23:32:04,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-11-23 23:32:04,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1843 transitions. [2019-11-23 23:32:04,124 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1843 transitions. Word has length 102 [2019-11-23 23:32:04,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:04,124 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 1843 transitions. [2019-11-23 23:32:04,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:04,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1843 transitions. [2019-11-23 23:32:04,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-23 23:32:04,128 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:04,128 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:04,129 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:04,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:04,130 INFO L82 PathProgramCache]: Analyzing trace with hash -2118176117, now seen corresponding path program 1 times [2019-11-23 23:32:04,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:04,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663626547] [2019-11-23 23:32:04,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:04,294 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:04,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663626547] [2019-11-23 23:32:04,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:04,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:04,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548925298] [2019-11-23 23:32:04,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:04,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:04,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:04,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:04,297 INFO L87 Difference]: Start difference. First operand 1283 states and 1843 transitions. Second operand 4 states. [2019-11-23 23:32:04,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:04,930 INFO L93 Difference]: Finished difference Result 2965 states and 4271 transitions. [2019-11-23 23:32:04,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:04,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-23 23:32:04,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:04,945 INFO L225 Difference]: With dead ends: 2965 [2019-11-23 23:32:04,945 INFO L226 Difference]: Without dead ends: 1683 [2019-11-23 23:32:04,948 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:32:04,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2019-11-23 23:32:04,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1123. [2019-11-23 23:32:04,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-11-23 23:32:04,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1551 transitions. [2019-11-23 23:32:04,978 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1551 transitions. Word has length 107 [2019-11-23 23:32:04,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:04,978 INFO L462 AbstractCegarLoop]: Abstraction has 1123 states and 1551 transitions. [2019-11-23 23:32:04,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:04,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1551 transitions. [2019-11-23 23:32:04,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-23 23:32:04,981 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:04,982 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,982 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:04,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:04,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1177511591, now seen corresponding path program 1 times [2019-11-23 23:32:04,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:04,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290528479] [2019-11-23 23:32:04,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:05,047 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:05,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290528479] [2019-11-23 23:32:05,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:05,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:05,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286022588] [2019-11-23 23:32:05,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:05,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:05,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:05,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:05,050 INFO L87 Difference]: Start difference. First operand 1123 states and 1551 transitions. Second operand 3 states. [2019-11-23 23:32:05,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:05,435 INFO L93 Difference]: Finished difference Result 2405 states and 3281 transitions. [2019-11-23 23:32:05,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:05,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-23 23:32:05,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:05,442 INFO L225 Difference]: With dead ends: 2405 [2019-11-23 23:32:05,442 INFO L226 Difference]: Without dead ends: 1283 [2019-11-23 23:32:05,444 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:05,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-11-23 23:32:05,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1203. [2019-11-23 23:32:05,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-11-23 23:32:05,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1519 transitions. [2019-11-23 23:32:05,469 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1519 transitions. Word has length 120 [2019-11-23 23:32:05,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:05,470 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 1519 transitions. [2019-11-23 23:32:05,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:05,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1519 transitions. [2019-11-23 23:32:05,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-23 23:32:05,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:05,474 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:05,474 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:05,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:05,474 INFO L82 PathProgramCache]: Analyzing trace with hash 97823886, now seen corresponding path program 1 times [2019-11-23 23:32:05,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:05,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79044284] [2019-11-23 23:32:05,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:05,558 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 23:32:05,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79044284] [2019-11-23 23:32:05,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:05,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:05,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787161128] [2019-11-23 23:32:05,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:05,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:05,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:05,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:05,561 INFO L87 Difference]: Start difference. First operand 1203 states and 1519 transitions. Second operand 3 states. [2019-11-23 23:32:05,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:05,919 INFO L93 Difference]: Finished difference Result 2725 states and 3418 transitions. [2019-11-23 23:32:05,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:05,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-11-23 23:32:05,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:05,926 INFO L225 Difference]: With dead ends: 2725 [2019-11-23 23:32:05,927 INFO L226 Difference]: Without dead ends: 1123 [2019-11-23 23:32:05,929 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:05,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2019-11-23 23:32:05,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1043. [2019-11-23 23:32:05,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-11-23 23:32:05,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1237 transitions. [2019-11-23 23:32:05,984 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1237 transitions. Word has length 171 [2019-11-23 23:32:05,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:05,985 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1237 transitions. [2019-11-23 23:32:05,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1237 transitions. [2019-11-23 23:32:05,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-23 23:32:05,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:05,989 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:05,989 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:05,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:05,990 INFO L82 PathProgramCache]: Analyzing trace with hash -257183503, now seen corresponding path program 1 times [2019-11-23 23:32:05,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:05,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372052124] [2019-11-23 23:32:05,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 85 proven. 3 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-23 23:32:06,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372052124] [2019-11-23 23:32:06,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12076143] [2019-11-23 23:32:06,149 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:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:06,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-23 23:32:06,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:32:06,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:32:06,354 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-23 23:32:06,354 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:32:06,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 23:32:06,469 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-23 23:32:06,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:32:06,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 6 [2019-11-23 23:32:06,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688681500] [2019-11-23 23:32:06,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:32:06,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:06,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:32:06,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:32:06,472 INFO L87 Difference]: Start difference. First operand 1043 states and 1237 transitions. Second operand 5 states. [2019-11-23 23:32:07,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:07,160 INFO L93 Difference]: Finished difference Result 2121 states and 2509 transitions. [2019-11-23 23:32:07,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 23:32:07,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 185 [2019-11-23 23:32:07,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:07,166 INFO L225 Difference]: With dead ends: 2121 [2019-11-23 23:32:07,167 INFO L226 Difference]: Without dead ends: 1079 [2019-11-23 23:32:07,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 367 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-23 23:32:07,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-11-23 23:32:07,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1043. [2019-11-23 23:32:07,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-11-23 23:32:07,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1224 transitions. [2019-11-23 23:32:07,198 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1224 transitions. Word has length 185 [2019-11-23 23:32:07,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:07,198 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1224 transitions. [2019-11-23 23:32:07,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:32:07,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1224 transitions. [2019-11-23 23:32:07,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-23 23:32:07,203 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:07,203 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:07,417 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:32:07,417 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:07,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:07,418 INFO L82 PathProgramCache]: Analyzing trace with hash -391008802, now seen corresponding path program 1 times [2019-11-23 23:32:07,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:07,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817272584] [2019-11-23 23:32:07,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:07,529 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-23 23:32:07,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817272584] [2019-11-23 23:32:07,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:07,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:32:07,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973926277] [2019-11-23 23:32:07,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:07,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:07,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:07,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:07,533 INFO L87 Difference]: Start difference. First operand 1043 states and 1224 transitions. Second operand 3 states. [2019-11-23 23:32:08,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:08,027 INFO L93 Difference]: Finished difference Result 2485 states and 2937 transitions. [2019-11-23 23:32:08,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:08,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-11-23 23:32:08,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:08,034 INFO L225 Difference]: With dead ends: 2485 [2019-11-23 23:32:08,034 INFO L226 Difference]: Without dead ends: 1363 [2019-11-23 23:32:08,037 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:08,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-11-23 23:32:08,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1203. [2019-11-23 23:32:08,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-11-23 23:32:08,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1382 transitions. [2019-11-23 23:32:08,066 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1382 transitions. Word has length 213 [2019-11-23 23:32:08,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:08,066 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 1382 transitions. [2019-11-23 23:32:08,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:08,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1382 transitions. [2019-11-23 23:32:08,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-23 23:32:08,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:08,071 INFO L410 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:08,072 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:08,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:08,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1460296101, now seen corresponding path program 1 times [2019-11-23 23:32:08,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:08,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672113149] [2019-11-23 23:32:08,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 177 proven. 9 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-23 23:32:08,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672113149] [2019-11-23 23:32:08,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822645883] [2019-11-23 23:32:08,373 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:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:08,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:32:08,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:32:08,604 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-23 23:32:08,605 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:32:08,696 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-23 23:32:08,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:32:08,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 10 [2019-11-23 23:32:08,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208914504] [2019-11-23 23:32:08,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:08,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:08,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:08,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-23 23:32:08,698 INFO L87 Difference]: Start difference. First operand 1203 states and 1382 transitions. Second operand 4 states. [2019-11-23 23:32:09,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:09,175 INFO L93 Difference]: Finished difference Result 2483 states and 2837 transitions. [2019-11-23 23:32:09,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:09,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-11-23 23:32:09,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:09,176 INFO L225 Difference]: With dead ends: 2483 [2019-11-23 23:32:09,176 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:32:09,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-23 23:32:09,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:32:09,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:32:09,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:32:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:32:09,181 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 218 [2019-11-23 23:32:09,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:09,181 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:32:09,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:09,181 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:32:09,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:32:09,384 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:32:09,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:32:09,961 WARN L192 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 41 [2019-11-23 23:32:10,389 WARN L192 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 41 [2019-11-23 23:32:10,393 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-23 23:32:10,393 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-23 23:32:10,393 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-23 23:32:10,393 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-23 23:32:10,394 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-23 23:32:10,394 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-23 23:32:10,394 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-23 23:32:10,394 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-23 23:32:10,394 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-23 23:32:10,394 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-23 23:32:10,394 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-23 23:32:10,394 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-23 23:32:10,394 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-23 23:32:10,395 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-23 23:32:10,395 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-23 23:32:10,395 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-23 23:32:10,395 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-23 23:32:10,395 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-23 23:32:10,395 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-23 23:32:10,395 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-23 23:32:10,395 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-23 23:32:10,396 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-23 23:32:10,396 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-23 23:32:10,396 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-23 23:32:10,396 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-23 23:32:10,396 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:32:10,396 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-23 23:32:10,396 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-23 23:32:10,396 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-23 23:32:10,396 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-23 23:32:10,396 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-23 23:32:10,397 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-23 23:32:10,397 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-23 23:32:10,397 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-23 23:32:10,397 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-23 23:32:10,397 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-23 23:32:10,397 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 490) no Hoare annotation was computed. [2019-11-23 23:32:10,397 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-23 23:32:10,397 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-23 23:32:10,398 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-23 23:32:10,398 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-23 23:32:10,398 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse8 (= ~a25~0 1)) (.cse6 (= ~a19~0 1))) (let ((.cse7 (= ~a28~0 7)) (.cse1 (not .cse6)) (.cse2 (<= 10 ~a28~0)) (.cse9 (= ~a11~0 1)) (.cse10 (<= ~a19~0 0)) (.cse11 (not .cse8)) (.cse5 (not (= ~a28~0 11))) (.cse0 (= ~a28~0 9)) (.cse3 (= ~a17~0 8)) (.cse4 (= ~a21~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9) (and .cse2 .cse6 .cse8) (and .cse10 .cse11 .cse3) (and .cse3 .cse7 .cse4) (and .cse3 .cse8 .cse5) (and .cse1 .cse11 .cse3 .cse5) (and .cse0 .cse3 .cse9) (and .cse2 .cse6 .cse9) (and .cse10 .cse11 .cse5) (and .cse0 .cse3 .cse4)))) [2019-11-23 23:32:10,398 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-23 23:32:10,398 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-23 23:32:10,399 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-23 23:32:10,399 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-23 23:32:10,399 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-23 23:32:10,399 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-23 23:32:10,399 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-23 23:32:10,399 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-23 23:32:10,399 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-23 23:32:10,399 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-23 23:32:10,400 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse8 (= ~a25~0 1)) (.cse6 (= ~a19~0 1))) (let ((.cse7 (= ~a28~0 7)) (.cse1 (not .cse6)) (.cse2 (<= 10 ~a28~0)) (.cse9 (= ~a11~0 1)) (.cse10 (<= ~a19~0 0)) (.cse11 (not .cse8)) (.cse5 (not (= ~a28~0 11))) (.cse0 (= ~a28~0 9)) (.cse3 (= ~a17~0 8)) (.cse4 (= ~a21~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9) (and .cse2 .cse6 .cse8) (and .cse10 .cse11 .cse3) (and .cse3 .cse7 .cse4) (and .cse3 .cse8 .cse5) (and .cse1 .cse11 .cse3 .cse5) (and .cse0 .cse3 .cse9) (and .cse2 .cse6 .cse9) (and .cse10 .cse11 .cse5) (and .cse0 .cse3 .cse4)))) [2019-11-23 23:32:10,400 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-23 23:32:10,400 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-23 23:32:10,400 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-23 23:32:10,400 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-23 23:32:10,400 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-23 23:32:10,400 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-23 23:32:10,401 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-23 23:32:10,401 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-23 23:32:10,401 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-23 23:32:10,401 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-23 23:32:10,401 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:32:10,401 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-23 23:32:10,401 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-23 23:32:10,401 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-23 23:32:10,401 INFO L444 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:32:10,402 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-23 23:32:10,402 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-23 23:32:10,402 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-23 23:32:10,402 INFO L444 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:32:10,402 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-23 23:32:10,402 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-23 23:32:10,402 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-23 23:32:10,402 INFO L444 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-11-23 23:32:10,402 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-23 23:32:10,402 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-23 23:32:10,403 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-23 23:32:10,403 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-23 23:32:10,403 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-23 23:32:10,403 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-23 23:32:10,403 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-23 23:32:10,403 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-23 23:32:10,403 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-23 23:32:10,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:32:10 BoogieIcfgContainer [2019-11-23 23:32:10,427 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:32:10,429 INFO L168 Benchmark]: Toolchain (without parser) took 13396.30 ms. Allocated memory was 141.0 MB in the beginning and 457.2 MB in the end (delta: 316.1 MB). Free memory was 102.7 MB in the beginning and 367.5 MB in the end (delta: -264.8 MB). Peak memory consumption was 267.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:10,430 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 141.0 MB. Free memory was 123.0 MB in the beginning and 122.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-23 23:32:10,431 INFO L168 Benchmark]: CACSL2BoogieTranslator took 692.53 ms. Allocated memory was 141.0 MB in the beginning and 204.5 MB in the end (delta: 63.4 MB). Free memory was 102.5 MB in the beginning and 165.3 MB in the end (delta: -62.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:10,432 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.85 ms. Allocated memory is still 204.5 MB. Free memory was 165.3 MB in the beginning and 159.6 MB in the end (delta: 5.7 MB). Peak memory consumption was 5.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:10,432 INFO L168 Benchmark]: Boogie Preprocessor took 109.68 ms. Allocated memory is still 204.5 MB. Free memory was 159.6 MB in the beginning and 155.2 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:10,433 INFO L168 Benchmark]: RCFGBuilder took 2301.66 ms. Allocated memory was 204.5 MB in the beginning and 243.3 MB in the end (delta: 38.8 MB). Free memory was 155.2 MB in the beginning and 166.5 MB in the end (delta: -11.3 MB). Peak memory consumption was 99.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:10,434 INFO L168 Benchmark]: TraceAbstraction took 10169.54 ms. Allocated memory was 243.3 MB in the beginning and 457.2 MB in the end (delta: 213.9 MB). Free memory was 166.5 MB in the beginning and 367.5 MB in the end (delta: -201.0 MB). Peak memory consumption was 229.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:10,439 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.28 ms. Allocated memory is still 141.0 MB. Free memory was 123.0 MB in the beginning and 122.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 692.53 ms. Allocated memory was 141.0 MB in the beginning and 204.5 MB in the end (delta: 63.4 MB). Free memory was 102.5 MB in the beginning and 165.3 MB in the end (delta: -62.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 117.85 ms. Allocated memory is still 204.5 MB. Free memory was 165.3 MB in the beginning and 159.6 MB in the end (delta: 5.7 MB). Peak memory consumption was 5.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 109.68 ms. Allocated memory is still 204.5 MB. Free memory was 159.6 MB in the beginning and 155.2 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2301.66 ms. Allocated memory was 204.5 MB in the beginning and 243.3 MB in the end (delta: 38.8 MB). Free memory was 155.2 MB in the beginning and 166.5 MB in the end (delta: -11.3 MB). Peak memory consumption was 99.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10169.54 ms. Allocated memory was 243.3 MB in the beginning and 457.2 MB in the end (delta: 213.9 MB). Free memory was 166.5 MB in the beginning and 367.5 MB in the end (delta: -201.0 MB). Peak memory consumption was 229.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 490]: 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: (((((((((((a28 == 9 && !(a19 == 1)) || (((10 <= a28 && a17 == 8) && a21 == 1) && !(a28 == 11))) || (((a19 == 1 && a28 == 7) && a25 == 1) && a11 == 1)) || ((10 <= a28 && a19 == 1) && a25 == 1)) || ((a19 <= 0 && !(a25 == 1)) && a17 == 8)) || ((a17 == 8 && a28 == 7) && a21 == 1)) || ((a17 == 8 && a25 == 1) && !(a28 == 11))) || (((!(a19 == 1) && !(a25 == 1)) && a17 == 8) && !(a28 == 11))) || ((a28 == 9 && a17 == 8) && a11 == 1)) || ((10 <= a28 && a19 == 1) && a11 == 1)) || ((a19 <= 0 && !(a25 == 1)) && !(a28 == 11))) || ((a28 == 9 && a17 == 8) && a21 == 1) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((((a28 == 9 && !(a19 == 1)) || (((10 <= a28 && a17 == 8) && a21 == 1) && !(a28 == 11))) || (((a19 == 1 && a28 == 7) && a25 == 1) && a11 == 1)) || ((10 <= a28 && a19 == 1) && a25 == 1)) || ((a19 <= 0 && !(a25 == 1)) && a17 == 8)) || ((a17 == 8 && a28 == 7) && a21 == 1)) || ((a17 == 8 && a25 == 1) && !(a28 == 11))) || (((!(a19 == 1) && !(a25 == 1)) && a17 == 8) && !(a28 == 11))) || ((a28 == 9 && a17 == 8) && a11 == 1)) || ((10 <= a28 && a19 == 1) && a11 == 1)) || ((a19 <= 0 && !(a25 == 1)) && !(a28 == 11))) || ((a28 == 9 && a17 == 8) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 10.0s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, HoareTripleCheckerStatistics: 766 SDtfs, 1162 SDslu, 123 SDs, 0 SdLazy, 3574 SolverSat, 861 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 844 GetRequests, 812 SyntacticMatches, 5 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, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 50 NumberOfFragments, 273 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2140 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1350 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1799 NumberOfCodeBlocks, 1799 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2188 ConstructedInterpolants, 0 QuantifiedInterpolants, 1009693 SizeOfPredicates, 8 NumberOfNonLiveVariables, 735 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 1692/1704 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...