/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_label07.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:32:01,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:32:01,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:32:02,017 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:32:02,018 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:32:02,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:32:02,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:32:02,031 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:32:02,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:32:02,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:32:02,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:32:02,036 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:32:02,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:32:02,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:32:02,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:32:02,039 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:32:02,040 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:32:02,041 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:32:02,042 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:32:02,044 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:32:02,045 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:32:02,046 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:32:02,047 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:32:02,048 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:32:02,050 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:32:02,050 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:32:02,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:32:02,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:32:02,052 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:32:02,053 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:32:02,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:32:02,054 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:32:02,054 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:32:02,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:32:02,056 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:32:02,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:32:02,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:32:02,057 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:32:02,057 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:32:02,058 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:32:02,059 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:32:02,060 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:02,074 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:32:02,074 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:32:02,075 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:32:02,075 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:32:02,076 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:32:02,076 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:32:02,076 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:32:02,076 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:32:02,076 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:32:02,076 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:32:02,077 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:32:02,077 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:32:02,077 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:32:02,077 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:32:02,078 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:32:02,078 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:32:02,078 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:32:02,079 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:32:02,079 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:32:02,079 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:32:02,079 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:32:02,079 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:32:02,080 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:32:02,080 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:32:02,080 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:32:02,080 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:32:02,081 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:32:02,081 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:32:02,081 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:32:02,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:32:02,081 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:32:02,082 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:32:02,082 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:32:02,082 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:32:02,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:32:02,082 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:32:02,083 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:32:02,083 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:32:02,345 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:32:02,357 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:32:02,361 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:32:02,362 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:32:02,362 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:32:02,363 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label07.c [2019-11-23 23:32:02,430 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50ca41ad1/aff62ada2b264b64ace52a2f2c1e0be5/FLAG72cae4cc2 [2019-11-23 23:32:03,012 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:32:03,013 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label07.c [2019-11-23 23:32:03,029 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50ca41ad1/aff62ada2b264b64ace52a2f2c1e0be5/FLAG72cae4cc2 [2019-11-23 23:32:03,318 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50ca41ad1/aff62ada2b264b64ace52a2f2c1e0be5 [2019-11-23 23:32:03,328 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:32:03,330 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:32:03,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:32:03,330 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:32:03,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:32:03,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:03" (1/1) ... [2019-11-23 23:32:03,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a725cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:03, skipping insertion in model container [2019-11-23 23:32:03,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:03" (1/1) ... [2019-11-23 23:32:03,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:32:03,398 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:32:03,888 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:32:03,893 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:32:04,049 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:32:04,070 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:32:04,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:04 WrapperNode [2019-11-23 23:32:04,070 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:32:04,071 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:32:04,071 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:32:04,072 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:32:04,082 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:04" (1/1) ... [2019-11-23 23:32:04,099 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:04" (1/1) ... [2019-11-23 23:32:04,153 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:32:04,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:32:04,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:32:04,153 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:32:04,163 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:04" (1/1) ... [2019-11-23 23:32:04,164 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:04" (1/1) ... [2019-11-23 23:32:04,168 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:04" (1/1) ... [2019-11-23 23:32:04,168 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:04" (1/1) ... [2019-11-23 23:32:04,186 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:04" (1/1) ... [2019-11-23 23:32:04,207 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:04" (1/1) ... [2019-11-23 23:32:04,216 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:04" (1/1) ... [2019-11-23 23:32:04,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:32:04,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:32:04,229 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:32:04,230 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:32:04,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:04" (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:04,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:32:04,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:32:06,204 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:32:06,205 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:32:06,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:06 BoogieIcfgContainer [2019-11-23 23:32:06,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:32:06,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:32:06,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:32:06,213 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:32:06,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:32:03" (1/3) ... [2019-11-23 23:32:06,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399ce433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:06, skipping insertion in model container [2019-11-23 23:32:06,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:04" (2/3) ... [2019-11-23 23:32:06,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399ce433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:06, skipping insertion in model container [2019-11-23 23:32:06,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:06" (3/3) ... [2019-11-23 23:32:06,217 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label07.c [2019-11-23 23:32:06,227 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:32:06,235 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:32:06,247 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:32:06,285 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:32:06,285 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:32:06,285 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:32:06,285 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:32:06,286 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:32:06,286 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:32:06,286 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:32:06,286 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:32:06,300 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-23 23:32:06,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 23:32:06,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:06,309 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:06,309 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:06,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:06,315 INFO L82 PathProgramCache]: Analyzing trace with hash 925963279, now seen corresponding path program 1 times [2019-11-23 23:32:06,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:06,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646299295] [2019-11-23 23:32:06,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:06,727 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:06,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646299295] [2019-11-23 23:32:06,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:06,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:06,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211593242] [2019-11-23 23:32:06,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:06,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:06,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:06,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:06,758 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2019-11-23 23:32:07,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:07,733 INFO L93 Difference]: Finished difference Result 333 states and 641 transitions. [2019-11-23 23:32:07,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:07,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-23 23:32:07,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:07,755 INFO L225 Difference]: With dead ends: 333 [2019-11-23 23:32:07,755 INFO L226 Difference]: Without dead ends: 243 [2019-11-23 23:32:07,762 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:07,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-23 23:32:07,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-11-23 23:32:07,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-23 23:32:07,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 398 transitions. [2019-11-23 23:32:07,820 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 398 transitions. Word has length 80 [2019-11-23 23:32:07,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:07,821 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 398 transitions. [2019-11-23 23:32:07,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:07,822 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 398 transitions. [2019-11-23 23:32:07,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-23 23:32:07,826 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:07,827 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:07,827 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:07,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:07,828 INFO L82 PathProgramCache]: Analyzing trace with hash 2010269746, now seen corresponding path program 1 times [2019-11-23 23:32:07,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:07,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623745197] [2019-11-23 23:32:07,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:07,975 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 23:32:07,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623745197] [2019-11-23 23:32:07,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:07,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:07,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599309974] [2019-11-23 23:32:07,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:07,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:07,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:07,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:07,980 INFO L87 Difference]: Start difference. First operand 243 states and 398 transitions. Second operand 4 states. [2019-11-23 23:32:08,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:08,595 INFO L93 Difference]: Finished difference Result 805 states and 1286 transitions. [2019-11-23 23:32:08,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:08,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-23 23:32:08,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:08,602 INFO L225 Difference]: With dead ends: 805 [2019-11-23 23:32:08,603 INFO L226 Difference]: Without dead ends: 563 [2019-11-23 23:32:08,605 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:08,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-11-23 23:32:08,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 483. [2019-11-23 23:32:08,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-11-23 23:32:08,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 758 transitions. [2019-11-23 23:32:08,640 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 758 transitions. Word has length 89 [2019-11-23 23:32:08,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:08,641 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 758 transitions. [2019-11-23 23:32:08,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:08,641 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 758 transitions. [2019-11-23 23:32:08,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-23 23:32:08,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:08,650 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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:08,651 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:08,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:08,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1900007154, now seen corresponding path program 1 times [2019-11-23 23:32:08,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:08,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547471381] [2019-11-23 23:32:08,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:08,705 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 23:32:08,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547471381] [2019-11-23 23:32:08,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:08,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:32:08,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630810399] [2019-11-23 23:32:08,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:08,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:08,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:08,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:08,710 INFO L87 Difference]: Start difference. First operand 483 states and 758 transitions. Second operand 3 states. [2019-11-23 23:32:09,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:09,165 INFO L93 Difference]: Finished difference Result 1285 states and 2020 transitions. [2019-11-23 23:32:09,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:09,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-11-23 23:32:09,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:09,170 INFO L225 Difference]: With dead ends: 1285 [2019-11-23 23:32:09,170 INFO L226 Difference]: Without dead ends: 803 [2019-11-23 23:32:09,173 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:09,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2019-11-23 23:32:09,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2019-11-23 23:32:09,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2019-11-23 23:32:09,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1153 transitions. [2019-11-23 23:32:09,222 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1153 transitions. Word has length 113 [2019-11-23 23:32:09,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:09,223 INFO L462 AbstractCegarLoop]: Abstraction has 803 states and 1153 transitions. [2019-11-23 23:32:09,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:09,224 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1153 transitions. [2019-11-23 23:32:09,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-23 23:32:09,232 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:09,232 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:09,233 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:09,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:09,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1735805163, now seen corresponding path program 1 times [2019-11-23 23:32:09,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:09,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387770154] [2019-11-23 23:32:09,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:09,316 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:09,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387770154] [2019-11-23 23:32:09,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:09,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:09,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566950931] [2019-11-23 23:32:09,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:09,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:09,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:09,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:09,320 INFO L87 Difference]: Start difference. First operand 803 states and 1153 transitions. Second operand 4 states. [2019-11-23 23:32:10,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:10,006 INFO L93 Difference]: Finished difference Result 2005 states and 2890 transitions. [2019-11-23 23:32:10,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:10,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-23 23:32:10,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:10,015 INFO L225 Difference]: With dead ends: 2005 [2019-11-23 23:32:10,015 INFO L226 Difference]: Without dead ends: 1203 [2019-11-23 23:32:10,017 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:10,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2019-11-23 23:32:10,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 803. [2019-11-23 23:32:10,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2019-11-23 23:32:10,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1058 transitions. [2019-11-23 23:32:10,041 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1058 transitions. Word has length 118 [2019-11-23 23:32:10,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:10,041 INFO L462 AbstractCegarLoop]: Abstraction has 803 states and 1058 transitions. [2019-11-23 23:32:10,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:10,042 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1058 transitions. [2019-11-23 23:32:10,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-23 23:32:10,044 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:10,045 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:10,045 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:10,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:10,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1692460679, now seen corresponding path program 1 times [2019-11-23 23:32:10,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:10,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633770913] [2019-11-23 23:32:10,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:10,139 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:10,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633770913] [2019-11-23 23:32:10,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:10,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:10,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757825332] [2019-11-23 23:32:10,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:10,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:10,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:10,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:10,144 INFO L87 Difference]: Start difference. First operand 803 states and 1058 transitions. Second operand 3 states. [2019-11-23 23:32:10,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:10,538 INFO L93 Difference]: Finished difference Result 2085 states and 2741 transitions. [2019-11-23 23:32:10,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:10,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-11-23 23:32:10,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:10,547 INFO L225 Difference]: With dead ends: 2085 [2019-11-23 23:32:10,547 INFO L226 Difference]: Without dead ends: 1203 [2019-11-23 23:32:10,549 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:10,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2019-11-23 23:32:10,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1043. [2019-11-23 23:32:10,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-11-23 23:32:10,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1345 transitions. [2019-11-23 23:32:10,626 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1345 transitions. Word has length 131 [2019-11-23 23:32:10,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:10,626 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1345 transitions. [2019-11-23 23:32:10,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:10,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1345 transitions. [2019-11-23 23:32:10,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-23 23:32:10,630 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:10,631 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:10,631 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:10,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:10,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1947476812, now seen corresponding path program 1 times [2019-11-23 23:32:10,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:10,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372252912] [2019-11-23 23:32:10,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:10,735 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-23 23:32:10,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372252912] [2019-11-23 23:32:10,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:10,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:10,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981228345] [2019-11-23 23:32:10,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:10,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:10,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:10,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:10,738 INFO L87 Difference]: Start difference. First operand 1043 states and 1345 transitions. Second operand 3 states. [2019-11-23 23:32:11,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:11,203 INFO L93 Difference]: Finished difference Result 2485 states and 3180 transitions. [2019-11-23 23:32:11,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:11,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-11-23 23:32:11,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:11,210 INFO L225 Difference]: With dead ends: 2485 [2019-11-23 23:32:11,211 INFO L226 Difference]: Without dead ends: 1043 [2019-11-23 23:32:11,213 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:11,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-11-23 23:32:11,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1043. [2019-11-23 23:32:11,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-11-23 23:32:11,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1245 transitions. [2019-11-23 23:32:11,237 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1245 transitions. Word has length 140 [2019-11-23 23:32:11,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:11,238 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1245 transitions. [2019-11-23 23:32:11,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:11,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1245 transitions. [2019-11-23 23:32:11,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-23 23:32:11,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:11,241 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-11-23 23:32:11,241 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:11,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:11,247 INFO L82 PathProgramCache]: Analyzing trace with hash 283727443, now seen corresponding path program 1 times [2019-11-23 23:32:11,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:11,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552922352] [2019-11-23 23:32:11,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:11,393 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-23 23:32:11,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552922352] [2019-11-23 23:32:11,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:11,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:11,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340747973] [2019-11-23 23:32:11,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:11,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:11,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:11,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:11,396 INFO L87 Difference]: Start difference. First operand 1043 states and 1245 transitions. Second operand 4 states. [2019-11-23 23:32:12,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:12,003 INFO L93 Difference]: Finished difference Result 2245 states and 2669 transitions. [2019-11-23 23:32:12,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:12,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-23 23:32:12,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:12,007 INFO L225 Difference]: With dead ends: 2245 [2019-11-23 23:32:12,007 INFO L226 Difference]: Without dead ends: 803 [2019-11-23 23:32:12,009 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:12,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2019-11-23 23:32:12,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 723. [2019-11-23 23:32:12,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-11-23 23:32:12,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 779 transitions. [2019-11-23 23:32:12,026 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 779 transitions. Word has length 150 [2019-11-23 23:32:12,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:12,026 INFO L462 AbstractCegarLoop]: Abstraction has 723 states and 779 transitions. [2019-11-23 23:32:12,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:12,026 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 779 transitions. [2019-11-23 23:32:12,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-23 23:32:12,030 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:12,030 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:12,030 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:12,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:12,031 INFO L82 PathProgramCache]: Analyzing trace with hash 67834797, now seen corresponding path program 1 times [2019-11-23 23:32:12,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:12,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389395112] [2019-11-23 23:32:12,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:12,378 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 207 proven. 61 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 23:32:12,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389395112] [2019-11-23 23:32:12,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821457031] [2019-11-23 23:32:12,379 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:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:12,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:32:12,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:32:12,627 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-11-23 23:32:12,627 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:32:12,701 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-11-23 23:32:12,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:32:12,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 11 [2019-11-23 23:32:12,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863031530] [2019-11-23 23:32:12,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:12,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:12,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:12,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-23 23:32:12,705 INFO L87 Difference]: Start difference. First operand 723 states and 779 transitions. Second operand 4 states. [2019-11-23 23:32:12,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:12,994 INFO L93 Difference]: Finished difference Result 1283 states and 1375 transitions. [2019-11-23 23:32:12,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:12,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 221 [2019-11-23 23:32:12,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:12,995 INFO L225 Difference]: With dead ends: 1283 [2019-11-23 23:32:12,995 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:32:12,997 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 439 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-23 23:32:12,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:32:12,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:32:12,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:32:12,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:32:12,998 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 221 [2019-11-23 23:32:12,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:12,998 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:32:12,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:12,999 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:32:12,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:32:13,202 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:32:13,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:32:13,480 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-11-23 23:32:13,665 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-11-23 23:32:13,670 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-23 23:32:13,670 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-23 23:32:13,670 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-23 23:32:13,670 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-23 23:32:13,671 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-23 23:32:13,671 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-23 23:32:13,671 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-23 23:32:13,671 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-23 23:32:13,671 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-23 23:32:13,671 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-23 23:32:13,671 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-23 23:32:13,672 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-23 23:32:13,672 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-23 23:32:13,672 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-23 23:32:13,672 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-23 23:32:13,672 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-23 23:32:13,672 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-23 23:32:13,672 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-23 23:32:13,678 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-23 23:32:13,679 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-23 23:32:13,679 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-23 23:32:13,679 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-23 23:32:13,679 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-23 23:32:13,679 INFO L444 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:32:13,680 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-23 23:32:13,680 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-23 23:32:13,680 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:32:13,680 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-23 23:32:13,680 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-23 23:32:13,680 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-23 23:32:13,681 INFO L444 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:32:13,681 INFO L444 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-11-23 23:32:13,681 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-23 23:32:13,681 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-23 23:32:13,681 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-23 23:32:13,681 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-23 23:32:13,681 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-23 23:32:13,682 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-23 23:32:13,682 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-23 23:32:13,682 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 589) no Hoare annotation was computed. [2019-11-23 23:32:13,682 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-23 23:32:13,682 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-23 23:32:13,682 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-23 23:32:13,683 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-23 23:32:13,683 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse5 (= ~a19~0 1)) (.cse4 (not (= ~a28~0 11))) (.cse3 (= ~a17~0 8))) (let ((.cse2 (or (and (not .cse5) .cse4) (and (<= ~a19~0 0) .cse3))) (.cse1 (= ~a11~0 1)) (.cse0 (= ~a25~0 1))) (or (and (<= ~a17~0 7) (= ~a28~0 7) .cse0 .cse1) (and (= ~a28~0 10) .cse1) (and .cse2 .cse1) (and (< ~a17~0 9) .cse2) (and .cse3 .cse1 .cse4) (and .cse3 .cse5 .cse0) (and (not (= ~a28~0 8)) .cse3 .cse4)))) [2019-11-23 23:32:13,683 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-23 23:32:13,683 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-23 23:32:13,684 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-23 23:32:13,684 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-23 23:32:13,684 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-23 23:32:13,684 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-23 23:32:13,684 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-23 23:32:13,684 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-23 23:32:13,684 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-23 23:32:13,685 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-23 23:32:13,689 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse5 (= ~a19~0 1)) (.cse4 (not (= ~a28~0 11))) (.cse3 (= ~a17~0 8))) (let ((.cse2 (or (and (not .cse5) .cse4) (and (<= ~a19~0 0) .cse3))) (.cse1 (= ~a11~0 1)) (.cse0 (= ~a25~0 1))) (or (and (<= ~a17~0 7) (= ~a28~0 7) .cse0 .cse1) (and (= ~a28~0 10) .cse1) (and .cse2 .cse1) (and (< ~a17~0 9) .cse2) (and .cse3 .cse1 .cse4) (and .cse3 .cse5 .cse0) (and (not (= ~a28~0 8)) .cse3 .cse4)))) [2019-11-23 23:32:13,689 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-23 23:32:13,689 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-23 23:32:13,689 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-23 23:32:13,690 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-23 23:32:13,690 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-23 23:32:13,690 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-23 23:32:13,690 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-23 23:32:13,690 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-23 23:32:13,690 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-23 23:32:13,690 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-23 23:32:13,691 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:32:13,691 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-23 23:32:13,691 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-23 23:32:13,691 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-23 23:32:13,691 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-23 23:32:13,691 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-23 23:32:13,691 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-23 23:32:13,691 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-23 23:32:13,694 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-23 23:32:13,694 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-23 23:32:13,694 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-23 23:32:13,694 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-23 23:32:13,694 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-23 23:32:13,695 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-23 23:32:13,695 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-23 23:32:13,695 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-23 23:32:13,695 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-23 23:32:13,695 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-23 23:32:13,695 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-23 23:32:13,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:32:13 BoogieIcfgContainer [2019-11-23 23:32:13,738 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:32:13,740 INFO L168 Benchmark]: Toolchain (without parser) took 10410.45 ms. Allocated memory was 137.9 MB in the beginning and 404.2 MB in the end (delta: 266.3 MB). Free memory was 100.7 MB in the beginning and 140.3 MB in the end (delta: -39.6 MB). Peak memory consumption was 226.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:13,741 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory is still 120.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-23 23:32:13,742 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.53 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.5 MB in the beginning and 162.0 MB in the end (delta: -61.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:13,742 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.52 ms. Allocated memory is still 201.9 MB. Free memory was 162.0 MB in the beginning and 156.4 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:13,745 INFO L168 Benchmark]: Boogie Preprocessor took 75.98 ms. Allocated memory is still 201.9 MB. Free memory was 156.4 MB in the beginning and 152.3 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:13,749 INFO L168 Benchmark]: RCFGBuilder took 1977.48 ms. Allocated memory was 201.9 MB in the beginning and 249.6 MB in the end (delta: 47.7 MB). Free memory was 151.6 MB in the beginning and 184.0 MB in the end (delta: -32.4 MB). Peak memory consumption was 108.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:13,750 INFO L168 Benchmark]: TraceAbstraction took 7530.04 ms. Allocated memory was 249.6 MB in the beginning and 404.2 MB in the end (delta: 154.7 MB). Free memory was 184.0 MB in the beginning and 140.3 MB in the end (delta: 43.8 MB). Peak memory consumption was 198.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:13,758 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory is still 120.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 740.53 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.5 MB in the beginning and 162.0 MB in the end (delta: -61.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 81.52 ms. Allocated memory is still 201.9 MB. Free memory was 162.0 MB in the beginning and 156.4 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 75.98 ms. Allocated memory is still 201.9 MB. Free memory was 156.4 MB in the beginning and 152.3 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1977.48 ms. Allocated memory was 201.9 MB in the beginning and 249.6 MB in the end (delta: 47.7 MB). Free memory was 151.6 MB in the beginning and 184.0 MB in the end (delta: -32.4 MB). Peak memory consumption was 108.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7530.04 ms. Allocated memory was 249.6 MB in the beginning and 404.2 MB in the end (delta: 154.7 MB). Free memory was 184.0 MB in the beginning and 140.3 MB in the end (delta: 43.8 MB). Peak memory consumption was 198.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 589]: 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: ((((((((a17 <= 7 && a28 == 7) && a25 == 1) && a11 == 1) || (a28 == 10 && a11 == 1)) || (((!(a19 == 1) && !(a28 == 11)) || (a19 <= 0 && a17 == 8)) && a11 == 1)) || (a17 < 9 && ((!(a19 == 1) && !(a28 == 11)) || (a19 <= 0 && a17 == 8)))) || ((a17 == 8 && a11 == 1) && !(a28 == 11))) || ((a17 == 8 && a19 == 1) && a25 == 1)) || ((!(a28 == 8) && a17 == 8) && !(a28 == 11)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((a17 <= 7 && a28 == 7) && a25 == 1) && a11 == 1) || (a28 == 10 && a11 == 1)) || (((!(a19 == 1) && !(a28 == 11)) || (a19 <= 0 && a17 == 8)) && a11 == 1)) || (a17 < 9 && ((!(a19 == 1) && !(a28 == 11)) || (a19 <= 0 && a17 == 8)))) || ((a17 == 8 && a11 == 1) && !(a28 == 11))) || ((a17 == 8 && a19 == 1) && a25 == 1)) || ((!(a28 == 8) && a17 == 8) && !(a28 == 11)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 7.4s, OverallIterations: 8, TraceHistogramMax: 5, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 554 SDtfs, 1074 SDslu, 63 SDs, 0 SdLazy, 2578 SolverSat, 695 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 473 GetRequests, 450 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1043occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 720 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 193 HoareAnnotationTreeSize, 3 FomulaSimplifications, 486 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 524 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1263 NumberOfCodeBlocks, 1263 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1474 ConstructedInterpolants, 0 QuantifiedInterpolants, 642244 SizeOfPredicates, 0 NumberOfNonLiveVariables, 449 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 1215/1276 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...