/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label40.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:31:11,035 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:31:11,037 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:31:11,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:31:11,050 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:31:11,051 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:31:11,053 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:31:11,054 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:31:11,056 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:31:11,057 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:31:11,060 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:31:11,064 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:31:11,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:31:11,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:31:11,067 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:31:11,068 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:31:11,069 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:31:11,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:31:11,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:31:11,073 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:31:11,075 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:31:11,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:31:11,078 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:31:11,078 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:31:11,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:31:11,081 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:31:11,081 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:31:11,082 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:31:11,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:31:11,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:31:11,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:31:11,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:31:11,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:31:11,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:31:11,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:31:11,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:31:11,088 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:31:11,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:31:11,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:31:11,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:31:11,091 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:31:11,091 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:11,116 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:31:11,118 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:31:11,121 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:31:11,121 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:31:11,121 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:31:11,122 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:31:11,122 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:31:11,122 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:31:11,122 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:31:11,122 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:31:11,122 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:31:11,123 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:31:11,123 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:31:11,123 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:31:11,123 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:31:11,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:31:11,126 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:31:11,126 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:31:11,126 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:31:11,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:31:11,127 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:31:11,127 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:31:11,127 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:31:11,127 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:31:11,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:31:11,127 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:31:11,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:31:11,128 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:31:11,128 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:31:11,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:31:11,129 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:31:11,130 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:31:11,130 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:31:11,131 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:31:11,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:31:11,131 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:31:11,132 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:31:11,132 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:31:11,428 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:31:11,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:31:11,446 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:31:11,447 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:31:11,447 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:31:11,448 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label40.c [2019-11-23 23:31:11,508 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03be8a95d/542f83b31bc542b4b3382b562ca8068d/FLAGcfd006833 [2019-11-23 23:31:12,080 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:31:12,083 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label40.c [2019-11-23 23:31:12,099 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03be8a95d/542f83b31bc542b4b3382b562ca8068d/FLAGcfd006833 [2019-11-23 23:31:12,341 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03be8a95d/542f83b31bc542b4b3382b562ca8068d [2019-11-23 23:31:12,349 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:31:12,350 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:31:12,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:31:12,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:31:12,355 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:31:12,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:31:12" (1/1) ... [2019-11-23 23:31:12,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50346e1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:12, skipping insertion in model container [2019-11-23 23:31:12,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:31:12" (1/1) ... [2019-11-23 23:31:12,367 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:31:12,422 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:31:12,924 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:31:12,936 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:31:13,045 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:31:13,065 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:31:13,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:13 WrapperNode [2019-11-23 23:31:13,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:31:13,067 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:31:13,067 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:31:13,067 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:31:13,076 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:13" (1/1) ... [2019-11-23 23:31:13,093 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:13" (1/1) ... [2019-11-23 23:31:13,155 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:31:13,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:31:13,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:31:13,156 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:31:13,169 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:13" (1/1) ... [2019-11-23 23:31:13,169 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:13" (1/1) ... [2019-11-23 23:31:13,182 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:13" (1/1) ... [2019-11-23 23:31:13,183 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:13" (1/1) ... [2019-11-23 23:31:13,220 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:13" (1/1) ... [2019-11-23 23:31:13,245 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:13" (1/1) ... [2019-11-23 23:31:13,256 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:13" (1/1) ... [2019-11-23 23:31:13,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:31:13,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:31:13,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:31:13,264 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:31:13,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:13" (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:13,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:31:13,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:31:15,421 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:31:15,422 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:31:15,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:31:15 BoogieIcfgContainer [2019-11-23 23:31:15,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:31:15,424 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:31:15,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:31:15,427 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:31:15,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:31:12" (1/3) ... [2019-11-23 23:31:15,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5688efe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:31:15, skipping insertion in model container [2019-11-23 23:31:15,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:13" (2/3) ... [2019-11-23 23:31:15,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5688efe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:31:15, skipping insertion in model container [2019-11-23 23:31:15,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:31:15" (3/3) ... [2019-11-23 23:31:15,431 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label40.c [2019-11-23 23:31:15,440 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:31:15,447 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:31:15,458 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:31:15,483 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:31:15,483 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:31:15,483 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:31:15,483 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:31:15,484 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:31:15,484 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:31:15,484 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:31:15,484 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:31:15,502 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:31:15,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:31:15,511 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:15,512 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:15,513 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:15,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:15,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1323245855, now seen corresponding path program 1 times [2019-11-23 23:31:15,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:15,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989611442] [2019-11-23 23:31:15,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:15,863 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:31:15,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989611442] [2019-11-23 23:31:15,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:15,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:15,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603766488] [2019-11-23 23:31:15,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:15,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:15,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:15,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:15,891 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-23 23:31:16,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:16,684 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-23 23:31:16,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:16,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-23 23:31:16,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:16,704 INFO L225 Difference]: With dead ends: 297 [2019-11-23 23:31:16,704 INFO L226 Difference]: Without dead ends: 216 [2019-11-23 23:31:16,708 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:31:16,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-23 23:31:16,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 145. [2019-11-23 23:31:16,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-23 23:31:16,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-11-23 23:31:16,781 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-11-23 23:31:16,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:16,782 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-11-23 23:31:16,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:16,782 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-11-23 23:31:16,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-23 23:31:16,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:16,786 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:16,786 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:16,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:16,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1048398476, now seen corresponding path program 1 times [2019-11-23 23:31:16,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:16,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821094210] [2019-11-23 23:31:16,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:16,863 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:16,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821094210] [2019-11-23 23:31:16,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:16,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:16,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9622018] [2019-11-23 23:31:16,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:16,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:16,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:16,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:16,868 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-11-23 23:31:17,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:17,481 INFO L93 Difference]: Finished difference Result 573 states and 1031 transitions. [2019-11-23 23:31:17,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:17,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-23 23:31:17,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:17,486 INFO L225 Difference]: With dead ends: 573 [2019-11-23 23:31:17,486 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:31:17,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:17,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:31:17,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-23 23:31:17,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-23 23:31:17,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 705 transitions. [2019-11-23 23:31:17,518 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 705 transitions. Word has length 77 [2019-11-23 23:31:17,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:17,518 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 705 transitions. [2019-11-23 23:31:17,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:17,519 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 705 transitions. [2019-11-23 23:31:17,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 23:31:17,525 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:17,525 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:17,525 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:17,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:17,526 INFO L82 PathProgramCache]: Analyzing trace with hash 928579171, now seen corresponding path program 1 times [2019-11-23 23:31:17,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:17,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288610246] [2019-11-23 23:31:17,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:17,620 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:31:17,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288610246] [2019-11-23 23:31:17,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:17,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:31:17,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688540622] [2019-11-23 23:31:17,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:17,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:17,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:17,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:17,623 INFO L87 Difference]: Start difference. First operand 429 states and 705 transitions. Second operand 3 states. [2019-11-23 23:31:18,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:18,025 INFO L93 Difference]: Finished difference Result 999 states and 1678 transitions. [2019-11-23 23:31:18,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:18,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-23 23:31:18,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:18,030 INFO L225 Difference]: With dead ends: 999 [2019-11-23 23:31:18,030 INFO L226 Difference]: Without dead ends: 571 [2019-11-23 23:31:18,033 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:31:18,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-11-23 23:31:18,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 500. [2019-11-23 23:31:18,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-23 23:31:18,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 825 transitions. [2019-11-23 23:31:18,065 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 825 transitions. Word has length 97 [2019-11-23 23:31:18,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:18,065 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 825 transitions. [2019-11-23 23:31:18,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:18,065 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 825 transitions. [2019-11-23 23:31:18,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-23 23:31:18,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:18,070 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:31:18,070 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:18,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:18,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1330805114, now seen corresponding path program 1 times [2019-11-23 23:31:18,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:18,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462744156] [2019-11-23 23:31:18,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:18,147 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-23 23:31:18,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462744156] [2019-11-23 23:31:18,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:18,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:31:18,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762600476] [2019-11-23 23:31:18,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:18,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:18,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:18,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:18,150 INFO L87 Difference]: Start difference. First operand 500 states and 825 transitions. Second operand 3 states. [2019-11-23 23:31:18,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:18,547 INFO L93 Difference]: Finished difference Result 1212 states and 1976 transitions. [2019-11-23 23:31:18,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:18,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-11-23 23:31:18,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:18,551 INFO L225 Difference]: With dead ends: 1212 [2019-11-23 23:31:18,552 INFO L226 Difference]: Without dead ends: 713 [2019-11-23 23:31:18,553 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:31:18,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-11-23 23:31:18,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 642. [2019-11-23 23:31:18,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-23 23:31:18,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 967 transitions. [2019-11-23 23:31:18,579 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 967 transitions. Word has length 133 [2019-11-23 23:31:18,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:18,580 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 967 transitions. [2019-11-23 23:31:18,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:18,580 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 967 transitions. [2019-11-23 23:31:18,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 23:31:18,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:18,586 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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:31:18,586 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:18,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:18,587 INFO L82 PathProgramCache]: Analyzing trace with hash -211735786, now seen corresponding path program 1 times [2019-11-23 23:31:18,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:18,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786533003] [2019-11-23 23:31:18,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:18,709 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-11-23 23:31:18,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786533003] [2019-11-23 23:31:18,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:18,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:31:18,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457535795] [2019-11-23 23:31:18,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:18,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:18,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:18,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:18,712 INFO L87 Difference]: Start difference. First operand 642 states and 967 transitions. Second operand 3 states. [2019-11-23 23:31:19,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:19,106 INFO L93 Difference]: Finished difference Result 1709 states and 2563 transitions. [2019-11-23 23:31:19,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:19,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-23 23:31:19,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:19,114 INFO L225 Difference]: With dead ends: 1709 [2019-11-23 23:31:19,114 INFO L226 Difference]: Without dead ends: 1068 [2019-11-23 23:31:19,116 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:31:19,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-23 23:31:19,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 855. [2019-11-23 23:31:19,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-23 23:31:19,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1269 transitions. [2019-11-23 23:31:19,146 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1269 transitions. Word has length 152 [2019-11-23 23:31:19,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:19,147 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1269 transitions. [2019-11-23 23:31:19,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:19,147 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1269 transitions. [2019-11-23 23:31:19,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-23 23:31:19,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:19,152 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-23 23:31:19,152 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:19,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:19,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1004824413, now seen corresponding path program 1 times [2019-11-23 23:31:19,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:19,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231408389] [2019-11-23 23:31:19,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:19,251 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-23 23:31:19,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231408389] [2019-11-23 23:31:19,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:19,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:31:19,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76740470] [2019-11-23 23:31:19,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:19,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:19,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:19,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:19,255 INFO L87 Difference]: Start difference. First operand 855 states and 1269 transitions. Second operand 3 states. [2019-11-23 23:31:19,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:19,623 INFO L93 Difference]: Finished difference Result 1851 states and 2733 transitions. [2019-11-23 23:31:19,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:19,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-23 23:31:19,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:19,629 INFO L225 Difference]: With dead ends: 1851 [2019-11-23 23:31:19,629 INFO L226 Difference]: Without dead ends: 997 [2019-11-23 23:31:19,631 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:31:19,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-23 23:31:19,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2019-11-23 23:31:19,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:31:19,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1429 transitions. [2019-11-23 23:31:19,654 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1429 transitions. Word has length 155 [2019-11-23 23:31:19,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:19,655 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1429 transitions. [2019-11-23 23:31:19,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:19,655 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1429 transitions. [2019-11-23 23:31:19,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-23 23:31:19,658 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:19,659 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-23 23:31:19,659 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:19,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:19,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1683955307, now seen corresponding path program 1 times [2019-11-23 23:31:19,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:19,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595672835] [2019-11-23 23:31:19,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:19,869 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-23 23:31:19,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595672835] [2019-11-23 23:31:19,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:19,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 23:31:19,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536491204] [2019-11-23 23:31:19,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 23:31:19,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:19,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 23:31:19,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:31:19,872 INFO L87 Difference]: Start difference. First operand 997 states and 1429 transitions. Second operand 8 states. [2019-11-23 23:31:20,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:20,722 INFO L93 Difference]: Finished difference Result 2100 states and 2970 transitions. [2019-11-23 23:31:20,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 23:31:20,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 159 [2019-11-23 23:31:20,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:20,730 INFO L225 Difference]: With dead ends: 2100 [2019-11-23 23:31:20,730 INFO L226 Difference]: Without dead ends: 1104 [2019-11-23 23:31:20,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:31:20,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2019-11-23 23:31:20,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 997. [2019-11-23 23:31:20,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:31:20,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1417 transitions. [2019-11-23 23:31:20,764 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1417 transitions. Word has length 159 [2019-11-23 23:31:20,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:20,766 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1417 transitions. [2019-11-23 23:31:20,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 23:31:20,766 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1417 transitions. [2019-11-23 23:31:20,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-23 23:31:20,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:20,771 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:20,771 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:20,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:20,772 INFO L82 PathProgramCache]: Analyzing trace with hash -114234491, now seen corresponding path program 1 times [2019-11-23 23:31:20,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:20,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518001465] [2019-11-23 23:31:20,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:20,952 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-23 23:31:20,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518001465] [2019-11-23 23:31:20,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:20,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:31:20,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344258217] [2019-11-23 23:31:20,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:20,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:20,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:20,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:20,954 INFO L87 Difference]: Start difference. First operand 997 states and 1417 transitions. Second operand 4 states. [2019-11-23 23:31:21,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:21,626 INFO L93 Difference]: Finished difference Result 2135 states and 3035 transitions. [2019-11-23 23:31:21,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:21,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-23 23:31:21,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:21,634 INFO L225 Difference]: With dead ends: 2135 [2019-11-23 23:31:21,634 INFO L226 Difference]: Without dead ends: 1139 [2019-11-23 23:31:21,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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:31:21,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2019-11-23 23:31:21,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1068. [2019-11-23 23:31:21,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-23 23:31:21,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1422 transitions. [2019-11-23 23:31:21,661 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1422 transitions. Word has length 192 [2019-11-23 23:31:21,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:21,663 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1422 transitions. [2019-11-23 23:31:21,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:21,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1422 transitions. [2019-11-23 23:31:21,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-23 23:31:21,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:21,667 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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:31:21,667 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:21,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:21,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1171741241, now seen corresponding path program 1 times [2019-11-23 23:31:21,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:21,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284891061] [2019-11-23 23:31:21,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:21,848 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-23 23:31:21,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284891061] [2019-11-23 23:31:21,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:21,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:31:21,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415783613] [2019-11-23 23:31:21,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:21,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:21,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:21,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:21,853 INFO L87 Difference]: Start difference. First operand 1068 states and 1422 transitions. Second operand 4 states. [2019-11-23 23:31:22,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:22,360 INFO L93 Difference]: Finished difference Result 2419 states and 3181 transitions. [2019-11-23 23:31:22,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:22,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-11-23 23:31:22,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:22,366 INFO L225 Difference]: With dead ends: 2419 [2019-11-23 23:31:22,366 INFO L226 Difference]: Without dead ends: 1352 [2019-11-23 23:31:22,368 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:31:22,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2019-11-23 23:31:22,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1068. [2019-11-23 23:31:22,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-23 23:31:22,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1410 transitions. [2019-11-23 23:31:22,392 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1410 transitions. Word has length 218 [2019-11-23 23:31:22,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:22,393 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1410 transitions. [2019-11-23 23:31:22,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:22,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1410 transitions. [2019-11-23 23:31:22,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-23 23:31:22,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:22,398 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:22,398 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:22,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:22,398 INFO L82 PathProgramCache]: Analyzing trace with hash 39381252, now seen corresponding path program 1 times [2019-11-23 23:31:22,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:22,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458867541] [2019-11-23 23:31:22,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:22,563 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-23 23:31:22,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458867541] [2019-11-23 23:31:22,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:22,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 23:31:22,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452731202] [2019-11-23 23:31:22,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 23:31:22,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:22,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 23:31:22,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:31:22,566 INFO L87 Difference]: Start difference. First operand 1068 states and 1410 transitions. Second operand 6 states. [2019-11-23 23:31:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:23,152 INFO L93 Difference]: Finished difference Result 2244 states and 2934 transitions. [2019-11-23 23:31:23,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:31:23,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 239 [2019-11-23 23:31:23,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:23,158 INFO L225 Difference]: With dead ends: 2244 [2019-11-23 23:31:23,158 INFO L226 Difference]: Without dead ends: 1177 [2019-11-23 23:31:23,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:31:23,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2019-11-23 23:31:23,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 997. [2019-11-23 23:31:23,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:31:23,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1261 transitions. [2019-11-23 23:31:23,184 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1261 transitions. Word has length 239 [2019-11-23 23:31:23,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:23,185 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1261 transitions. [2019-11-23 23:31:23,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 23:31:23,185 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1261 transitions. [2019-11-23 23:31:23,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-11-23 23:31:23,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:23,190 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 4, 4, 4, 4, 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] [2019-11-23 23:31:23,190 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:23,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:23,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1839440731, now seen corresponding path program 1 times [2019-11-23 23:31:23,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:23,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886617360] [2019-11-23 23:31:23,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:24,082 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-11-23 23:31:24,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886617360] [2019-11-23 23:31:24,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:24,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-23 23:31:24,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218885195] [2019-11-23 23:31:24,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-23 23:31:24,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:24,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-23 23:31:24,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-11-23 23:31:24,084 INFO L87 Difference]: Start difference. First operand 997 states and 1261 transitions. Second operand 14 states. [2019-11-23 23:31:25,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:25,392 INFO L93 Difference]: Finished difference Result 2252 states and 2825 transitions. [2019-11-23 23:31:25,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 23:31:25,394 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 261 [2019-11-23 23:31:25,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:25,395 INFO L225 Difference]: With dead ends: 2252 [2019-11-23 23:31:25,395 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:31:25,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=192, Unknown=0, NotChecked=0, Total=342 [2019-11-23 23:31:25,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:31:25,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:31:25,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:31:25,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:31:25,399 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 261 [2019-11-23 23:31:25,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:25,399 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:31:25,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-23 23:31:25,400 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:31:25,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:31:25,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:31:25,531 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 102 [2019-11-23 23:31:25,667 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 99 [2019-11-23 23:31:26,299 WARN L192 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 49 [2019-11-23 23:31:26,829 WARN L192 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 49 [2019-11-23 23:31:26,833 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:31:26,833 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:31:26,834 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:31:26,834 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:31:26,834 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:31:26,834 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:31:26,834 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:31:26,834 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:31:26,834 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:31:26,834 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:31:26,835 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-23 23:31:26,835 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:31:26,835 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:31:26,835 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:31:26,835 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:31:26,835 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:31:26,835 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:31:26,835 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:31:26,835 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:31:26,836 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:31:26,836 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse6 (= 1 ~a7~0)) (.cse3 (= ~a16~0 6)) (.cse2 (= ~a21~0 1)) (.cse7 (= 13 ~a8~0))) (let ((.cse4 (not .cse7)) (.cse5 (not .cse2)) (.cse10 (<= ~a17~0 0)) (.cse8 (not .cse3)) (.cse0 (not .cse6)) (.cse12 (= ~a16~0 4)) (.cse9 (= ~a17~0 1)) (.cse1 (= ~a12~0 8)) (.cse11 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse4 (= ~a16~0 5)) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse1) (and .cse5 .cse6 .cse7 .cse1 .cse10 .cse11 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse3) (and .cse6 .cse7 .cse12 .cse1 .cse10) (and .cse8 .cse1 .cse0 .cse9 .cse2) (and .cse12 .cse1 .cse2 (not .cse9)) (and .cse9 .cse1 .cse2 .cse11)))) [2019-11-23 23:31:26,836 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:31:26,836 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:31:26,837 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:31:26,837 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:31:26,837 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:31:26,837 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:31:26,837 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:31:26,837 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:31:26,837 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:31:26,838 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:31:26,838 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:31:26,838 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:31:26,838 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:31:26,838 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:31:26,838 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:31:26,838 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:31:26,838 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:31:26,839 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:31:26,839 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:31:26,839 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:31:26,839 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:31:26,839 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:31:26,839 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:31:26,839 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse6 (= 1 ~a7~0)) (.cse3 (= ~a16~0 6)) (.cse2 (= ~a21~0 1)) (.cse7 (= 13 ~a8~0))) (let ((.cse4 (not .cse7)) (.cse5 (not .cse2)) (.cse10 (<= ~a17~0 0)) (.cse12 (= ~a16~0 4)) (.cse8 (not .cse3)) (.cse0 (not .cse6)) (.cse9 (= ~a17~0 1)) (.cse1 (= ~a12~0 8)) (.cse11 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse4 (= ~a16~0 5)) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse1) (and .cse5 .cse6 .cse7 .cse1 .cse10 .cse11 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse3) (and .cse6 .cse7 .cse12 .cse1 .cse10) (and .cse12 .cse1 .cse2 (not .cse9)) (and .cse8 .cse1 .cse0 .cse9 .cse2) (and .cse9 .cse1 .cse2 .cse11)))) [2019-11-23 23:31:26,840 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:31:26,840 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:31:26,840 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:31:26,840 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:31:26,840 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:31:26,840 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:31:26,840 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:31:26,840 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:31:26,841 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:31:26,841 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:31:26,841 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:31:26,841 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:31:26,841 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:31:26,841 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:31:26,841 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:31:26,841 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:31:26,842 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:31:26,842 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:31:26,842 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:31:26,842 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:31:26,842 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:31:26,842 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:31:26,842 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:31:26,842 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 437) no Hoare annotation was computed. [2019-11-23 23:31:26,843 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:31:26,843 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:31:26,843 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:31:26,843 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:31:26,843 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:31:26,843 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:31:26,843 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:31:26,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:31:26 BoogieIcfgContainer [2019-11-23 23:31:26,871 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:31:26,873 INFO L168 Benchmark]: Toolchain (without parser) took 14522.55 ms. Allocated memory was 137.9 MB in the beginning and 451.4 MB in the end (delta: 313.5 MB). Free memory was 100.7 MB in the beginning and 230.0 MB in the end (delta: -129.4 MB). Peak memory consumption was 331.5 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:26,874 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 23:31:26,875 INFO L168 Benchmark]: CACSL2BoogieTranslator took 714.56 ms. Allocated memory was 137.9 MB in the beginning and 204.5 MB in the end (delta: 66.6 MB). Free memory was 100.5 MB in the beginning and 170.5 MB in the end (delta: -70.1 MB). Peak memory consumption was 34.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:26,876 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.81 ms. Allocated memory is still 204.5 MB. Free memory was 170.5 MB in the beginning and 164.1 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:26,877 INFO L168 Benchmark]: Boogie Preprocessor took 107.75 ms. Allocated memory is still 204.5 MB. Free memory was 164.1 MB in the beginning and 159.9 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:26,878 INFO L168 Benchmark]: RCFGBuilder took 2159.47 ms. Allocated memory was 204.5 MB in the beginning and 251.7 MB in the end (delta: 47.2 MB). Free memory was 159.9 MB in the beginning and 208.6 MB in the end (delta: -48.7 MB). Peak memory consumption was 114.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:26,879 INFO L168 Benchmark]: TraceAbstraction took 11446.86 ms. Allocated memory was 251.7 MB in the beginning and 451.4 MB in the end (delta: 199.8 MB). Free memory was 208.6 MB in the beginning and 230.0 MB in the end (delta: -21.4 MB). Peak memory consumption was 325.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:26,884 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.16 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 714.56 ms. Allocated memory was 137.9 MB in the beginning and 204.5 MB in the end (delta: 66.6 MB). Free memory was 100.5 MB in the beginning and 170.5 MB in the end (delta: -70.1 MB). Peak memory consumption was 34.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 88.81 ms. Allocated memory is still 204.5 MB. Free memory was 170.5 MB in the beginning and 164.1 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.75 ms. Allocated memory is still 204.5 MB. Free memory was 164.1 MB in the beginning and 159.9 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2159.47 ms. Allocated memory was 204.5 MB in the beginning and 251.7 MB in the end (delta: 47.2 MB). Free memory was 159.9 MB in the beginning and 208.6 MB in the end (delta: -48.7 MB). Peak memory consumption was 114.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11446.86 ms. Allocated memory was 251.7 MB in the beginning and 451.4 MB in the end (delta: 199.8 MB). Free memory was 208.6 MB in the beginning and 230.0 MB in the end (delta: -21.4 MB). Peak memory consumption was 325.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 437]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((!(1 == a7) && a12 == 8) && a21 == 1) && a16 == 6) && !(13 == a8)) || (((a12 == 8 && a21 == 1) && !(13 == a8)) && a16 == 5)) || (((((!(a21 == 1) && 1 == a7) && 13 == a8) && !(a16 == 6)) && a17 == 1) && a12 == 8)) || (((((((!(a21 == 1) && 1 == a7) && 13 == a8) && a12 == 8) && a17 <= 0) && a20 == 1) && ((((2 == input || 4 == input) || 6 == input) || 1 == input) || 5 == input)) && a16 == 6)) || ((((1 == a7 && 13 == a8) && a16 == 4) && a12 == 8) && a17 <= 0)) || ((((!(a16 == 6) && a12 == 8) && !(1 == a7)) && a17 == 1) && a21 == 1)) || (((a16 == 4 && a12 == 8) && a21 == 1) && !(a17 == 1))) || (((a17 == 1 && a12 == 8) && a21 == 1) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((!(1 == a7) && a12 == 8) && a21 == 1) && a16 == 6) && !(13 == a8)) || (((a12 == 8 && a21 == 1) && !(13 == a8)) && a16 == 5)) || (((((!(a21 == 1) && 1 == a7) && 13 == a8) && !(a16 == 6)) && a17 == 1) && a12 == 8)) || (((((((!(a21 == 1) && 1 == a7) && 13 == a8) && a12 == 8) && a17 <= 0) && a20 == 1) && ((((2 == input || 4 == input) || 6 == input) || 1 == input) || 5 == input)) && a16 == 6)) || ((((1 == a7 && 13 == a8) && a16 == 4) && a12 == 8) && a17 <= 0)) || (((a16 == 4 && a12 == 8) && a21 == 1) && !(a17 == 1))) || ((((!(a16 == 6) && a12 == 8) && !(1 == a7)) && a17 == 1) && a21 == 1)) || (((a17 == 1 && a12 == 8) && a21 == 1) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 11.3s, OverallIterations: 11, TraceHistogramMax: 7, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, HoareTripleCheckerStatistics: 556 SDtfs, 1666 SDslu, 100 SDs, 0 SdLazy, 4218 SolverSat, 1076 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1068occurred in iteration=8, 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, 11 MinimizatonAttempts, 1068 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 309 HoareAnnotationTreeSize, 3 FomulaSimplifications, 15014 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 5314 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1754 NumberOfCodeBlocks, 1754 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1743 ConstructedInterpolants, 0 QuantifiedInterpolants, 1290399 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 2253/2253 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...