/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_label12.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:30:10,749 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:30:10,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:30:10,773 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:30:10,773 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:30:10,775 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:30:10,777 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:30:10,786 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:30:10,787 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:30:10,788 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:30:10,789 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:30:10,790 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:30:10,790 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:30:10,791 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:30:10,792 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:30:10,793 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:30:10,794 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:30:10,795 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:30:10,796 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:30:10,798 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:30:10,799 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:30:10,800 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:30:10,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:30:10,802 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:30:10,804 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:30:10,804 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:30:10,804 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:30:10,805 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:30:10,806 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:30:10,806 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:30:10,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:30:10,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:30:10,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:30:10,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:30:10,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:30:10,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:30:10,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:30:10,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:30:10,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:30:10,812 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:30:10,813 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:30:10,813 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:30:10,828 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:30:10,828 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:30:10,829 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:30:10,829 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:30:10,829 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:30:10,829 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:30:10,830 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:30:10,830 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:30:10,830 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:30:10,830 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:30:10,830 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:30:10,830 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:30:10,831 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:30:10,831 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:30:10,831 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:30:10,832 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:30:10,832 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:30:10,832 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:30:10,832 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:30:10,832 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:30:10,833 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:30:10,833 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:30:10,833 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:30:10,833 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:30:10,833 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:30:10,833 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:30:10,834 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:30:10,834 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:30:10,834 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:30:10,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:30:10,834 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:30:10,835 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:30:10,835 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:30:10,835 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:30:10,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:30:10,835 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:30:10,836 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:30:10,836 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:30:11,119 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:30:11,139 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:30:11,143 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:30:11,144 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:30:11,145 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:30:11,146 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label12.c [2019-11-23 23:30:11,219 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b65c127a/23cd0360bd1145f8bc76f97035767ec4/FLAGa1960d596 [2019-11-23 23:30:11,775 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:30:11,776 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label12.c [2019-11-23 23:30:11,787 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b65c127a/23cd0360bd1145f8bc76f97035767ec4/FLAGa1960d596 [2019-11-23 23:30:12,039 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b65c127a/23cd0360bd1145f8bc76f97035767ec4 [2019-11-23 23:30:12,048 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:30:12,050 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:30:12,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:30:12,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:30:12,054 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:30:12,055 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:12" (1/1) ... [2019-11-23 23:30:12,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6a1297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:12, skipping insertion in model container [2019-11-23 23:30:12,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:12" (1/1) ... [2019-11-23 23:30:12,065 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:30:12,119 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:30:12,608 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:30:12,616 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:30:12,895 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:30:12,912 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:30:12,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:12 WrapperNode [2019-11-23 23:30:12,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:30:12,913 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:30:12,913 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:30:12,913 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:30:12,921 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:30:12" (1/1) ... [2019-11-23 23:30:12,944 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:30:12" (1/1) ... [2019-11-23 23:30:13,004 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:30:13,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:30:13,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:30:13,005 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:30:13,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:12" (1/1) ... [2019-11-23 23:30:13,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:12" (1/1) ... [2019-11-23 23:30:13,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:12" (1/1) ... [2019-11-23 23:30:13,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:12" (1/1) ... [2019-11-23 23:30:13,041 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:12" (1/1) ... [2019-11-23 23:30:13,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:12" (1/1) ... [2019-11-23 23:30:13,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:12" (1/1) ... [2019-11-23 23:30:13,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:30:13,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:30:13,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:30:13,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:30:13,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:12" (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:30:13,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:30:13,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:30:15,058 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:30:15,059 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:30:15,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:15 BoogieIcfgContainer [2019-11-23 23:30:15,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:30:15,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:30:15,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:30:15,065 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:30:15,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:30:12" (1/3) ... [2019-11-23 23:30:15,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9545414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:15, skipping insertion in model container [2019-11-23 23:30:15,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:12" (2/3) ... [2019-11-23 23:30:15,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9545414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:15, skipping insertion in model container [2019-11-23 23:30:15,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:15" (3/3) ... [2019-11-23 23:30:15,068 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label12.c [2019-11-23 23:30:15,078 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:30:15,086 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:30:15,097 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:30:15,125 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:30:15,125 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:30:15,126 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:30:15,126 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:30:15,126 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:30:15,126 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:30:15,126 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:30:15,127 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:30:15,147 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:30:15,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:30:15,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:15,157 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:30:15,157 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:15,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:15,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1323231641, now seen corresponding path program 1 times [2019-11-23 23:30:15,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:15,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068646822] [2019-11-23 23:30:15,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:15,631 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:30:15,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068646822] [2019-11-23 23:30:15,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:15,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:15,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444695374] [2019-11-23 23:30:15,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:15,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:15,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:15,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:15,658 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-23 23:30:16,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:16,563 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-23 23:30:16,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:16,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-23 23:30:16,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:16,580 INFO L225 Difference]: With dead ends: 297 [2019-11-23 23:30:16,581 INFO L226 Difference]: Without dead ends: 216 [2019-11-23 23:30:16,584 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:30:16,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-23 23:30:16,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 145. [2019-11-23 23:30:16,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-23 23:30:16,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-11-23 23:30:16,639 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-11-23 23:30:16,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:16,639 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-11-23 23:30:16,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:16,640 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-11-23 23:30:16,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-23 23:30:16,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:16,643 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:30:16,644 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:16,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:16,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1048384262, now seen corresponding path program 1 times [2019-11-23 23:30:16,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:16,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596748359] [2019-11-23 23:30:16,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:16,714 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:30:16,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596748359] [2019-11-23 23:30:16,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:16,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:16,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752910426] [2019-11-23 23:30:16,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:16,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:16,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:16,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:16,718 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-11-23 23:30:17,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:17,372 INFO L93 Difference]: Finished difference Result 573 states and 1031 transitions. [2019-11-23 23:30:17,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:17,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-23 23:30:17,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:17,378 INFO L225 Difference]: With dead ends: 573 [2019-11-23 23:30:17,378 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:30:17,380 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:30:17,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:30:17,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-23 23:30:17,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-23 23:30:17,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 707 transitions. [2019-11-23 23:30:17,445 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 707 transitions. Word has length 77 [2019-11-23 23:30:17,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:17,445 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 707 transitions. [2019-11-23 23:30:17,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:17,445 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 707 transitions. [2019-11-23 23:30:17,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-23 23:30:17,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:17,452 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:17,453 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:17,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:17,453 INFO L82 PathProgramCache]: Analyzing trace with hash -2123288934, now seen corresponding path program 1 times [2019-11-23 23:30:17,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:17,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563392604] [2019-11-23 23:30:17,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:17,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:17,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563392604] [2019-11-23 23:30:17,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:17,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:30:17,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649295627] [2019-11-23 23:30:17,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:17,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:17,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:17,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:17,583 INFO L87 Difference]: Start difference. First operand 429 states and 707 transitions. Second operand 4 states. [2019-11-23 23:30:18,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:18,164 INFO L93 Difference]: Finished difference Result 857 states and 1413 transitions. [2019-11-23 23:30:18,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:18,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-23 23:30:18,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:18,168 INFO L225 Difference]: With dead ends: 857 [2019-11-23 23:30:18,168 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:30:18,170 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:30:18,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:30:18,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-23 23:30:18,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-23 23:30:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 633 transitions. [2019-11-23 23:30:18,190 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 633 transitions. Word has length 78 [2019-11-23 23:30:18,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:18,190 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 633 transitions. [2019-11-23 23:30:18,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:18,191 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 633 transitions. [2019-11-23 23:30:18,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-23 23:30:18,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:18,194 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:18,194 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:18,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:18,194 INFO L82 PathProgramCache]: Analyzing trace with hash 293133309, now seen corresponding path program 1 times [2019-11-23 23:30:18,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:18,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761787713] [2019-11-23 23:30:18,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:18,276 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:30:18,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761787713] [2019-11-23 23:30:18,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:18,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:18,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113196569] [2019-11-23 23:30:18,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:18,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:18,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:18,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:18,279 INFO L87 Difference]: Start difference. First operand 429 states and 633 transitions. Second operand 3 states. [2019-11-23 23:30:18,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:18,703 INFO L93 Difference]: Finished difference Result 1141 states and 1669 transitions. [2019-11-23 23:30:18,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:18,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-23 23:30:18,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:18,711 INFO L225 Difference]: With dead ends: 1141 [2019-11-23 23:30:18,712 INFO L226 Difference]: Without dead ends: 713 [2019-11-23 23:30:18,713 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:30:18,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-11-23 23:30:18,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 642. [2019-11-23 23:30:18,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-23 23:30:18,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 888 transitions. [2019-11-23 23:30:18,744 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 888 transitions. Word has length 89 [2019-11-23 23:30:18,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:18,744 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 888 transitions. [2019-11-23 23:30:18,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:18,745 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 888 transitions. [2019-11-23 23:30:18,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 23:30:18,751 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:18,752 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:18,752 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:18,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:18,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1374578287, now seen corresponding path program 1 times [2019-11-23 23:30:18,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:18,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514926616] [2019-11-23 23:30:18,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:18,875 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 23:30:18,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514926616] [2019-11-23 23:30:18,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:18,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:18,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291836670] [2019-11-23 23:30:18,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:18,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:18,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:18,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:18,878 INFO L87 Difference]: Start difference. First operand 642 states and 888 transitions. Second operand 4 states. [2019-11-23 23:30:19,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:19,346 INFO L93 Difference]: Finished difference Result 1380 states and 1890 transitions. [2019-11-23 23:30:19,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:30:19,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-23 23:30:19,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:19,352 INFO L225 Difference]: With dead ends: 1380 [2019-11-23 23:30:19,353 INFO L226 Difference]: Without dead ends: 739 [2019-11-23 23:30:19,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:30:19,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-11-23 23:30:19,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 713. [2019-11-23 23:30:19,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-11-23 23:30:19,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 965 transitions. [2019-11-23 23:30:19,381 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 965 transitions. Word has length 97 [2019-11-23 23:30:19,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:19,382 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 965 transitions. [2019-11-23 23:30:19,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:19,383 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 965 transitions. [2019-11-23 23:30:19,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-23 23:30:19,385 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:19,386 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:19,386 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:19,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:19,387 INFO L82 PathProgramCache]: Analyzing trace with hash 252004809, now seen corresponding path program 1 times [2019-11-23 23:30:19,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:19,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155870153] [2019-11-23 23:30:19,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 23:30:19,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155870153] [2019-11-23 23:30:19,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:19,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:19,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115171329] [2019-11-23 23:30:19,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:19,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:19,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:19,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:19,492 INFO L87 Difference]: Start difference. First operand 713 states and 965 transitions. Second operand 4 states. [2019-11-23 23:30:20,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:20,023 INFO L93 Difference]: Finished difference Result 1922 states and 2638 transitions. [2019-11-23 23:30:20,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:20,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-23 23:30:20,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:20,029 INFO L225 Difference]: With dead ends: 1922 [2019-11-23 23:30:20,029 INFO L226 Difference]: Without dead ends: 1281 [2019-11-23 23:30:20,031 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:30:20,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-11-23 23:30:20,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1068. [2019-11-23 23:30:20,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-23 23:30:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1400 transitions. [2019-11-23 23:30:20,057 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1400 transitions. Word has length 101 [2019-11-23 23:30:20,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:20,058 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1400 transitions. [2019-11-23 23:30:20,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:20,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1400 transitions. [2019-11-23 23:30:20,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-23 23:30:20,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:20,060 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:20,060 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:20,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:20,061 INFO L82 PathProgramCache]: Analyzing trace with hash 526061964, now seen corresponding path program 1 times [2019-11-23 23:30:20,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:20,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917108385] [2019-11-23 23:30:20,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:20,201 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 23:30:20,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917108385] [2019-11-23 23:30:20,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:20,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 23:30:20,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674546236] [2019-11-23 23:30:20,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 23:30:20,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:20,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 23:30:20,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:30:20,204 INFO L87 Difference]: Start difference. First operand 1068 states and 1400 transitions. Second operand 8 states. [2019-11-23 23:30:20,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:20,976 INFO L93 Difference]: Finished difference Result 2245 states and 2951 transitions. [2019-11-23 23:30:20,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 23:30:20,978 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2019-11-23 23:30:20,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:20,986 INFO L225 Difference]: With dead ends: 2245 [2019-11-23 23:30:20,986 INFO L226 Difference]: Without dead ends: 1249 [2019-11-23 23:30:20,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:30:20,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2019-11-23 23:30:21,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1139. [2019-11-23 23:30:21,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2019-11-23 23:30:21,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1471 transitions. [2019-11-23 23:30:21,022 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1471 transitions. Word has length 115 [2019-11-23 23:30:21,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:21,023 INFO L462 AbstractCegarLoop]: Abstraction has 1139 states and 1471 transitions. [2019-11-23 23:30:21,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 23:30:21,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1471 transitions. [2019-11-23 23:30:21,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-23 23:30:21,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:21,028 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:21,028 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:21,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:21,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1428370297, now seen corresponding path program 1 times [2019-11-23 23:30:21,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:21,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228547945] [2019-11-23 23:30:21,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 23:30:21,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228547945] [2019-11-23 23:30:21,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:21,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:30:21,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560486020] [2019-11-23 23:30:21,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:21,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:21,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:21,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:21,152 INFO L87 Difference]: Start difference. First operand 1139 states and 1471 transitions. Second operand 4 states. [2019-11-23 23:30:21,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:21,717 INFO L93 Difference]: Finished difference Result 2845 states and 3648 transitions. [2019-11-23 23:30:21,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:21,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-23 23:30:21,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:21,725 INFO L225 Difference]: With dead ends: 2845 [2019-11-23 23:30:21,725 INFO L226 Difference]: Without dead ends: 1352 [2019-11-23 23:30:21,727 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:30:21,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2019-11-23 23:30:21,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1068. [2019-11-23 23:30:21,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-23 23:30:21,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1192 transitions. [2019-11-23 23:30:21,752 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1192 transitions. Word has length 118 [2019-11-23 23:30:21,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:21,753 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1192 transitions. [2019-11-23 23:30:21,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:21,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1192 transitions. [2019-11-23 23:30:21,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-23 23:30:21,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:21,756 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:21,757 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:21,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:21,757 INFO L82 PathProgramCache]: Analyzing trace with hash 2055484886, now seen corresponding path program 1 times [2019-11-23 23:30:21,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:21,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468206945] [2019-11-23 23:30:21,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:21,889 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-23 23:30:21,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468206945] [2019-11-23 23:30:21,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239663737] [2019-11-23 23:30:21,890 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:30:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:21,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:30:22,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:30:22,061 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-23 23:30:22,061 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:30:22,099 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-23 23:30:22,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:30:22,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-23 23:30:22,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669219645] [2019-11-23 23:30:22,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:22,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:22,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:22,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:30:22,102 INFO L87 Difference]: Start difference. First operand 1068 states and 1192 transitions. Second operand 3 states. [2019-11-23 23:30:22,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:22,361 INFO L93 Difference]: Finished difference Result 2206 states and 2466 transitions. [2019-11-23 23:30:22,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:22,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-11-23 23:30:22,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:22,367 INFO L225 Difference]: With dead ends: 2206 [2019-11-23 23:30:22,367 INFO L226 Difference]: Without dead ends: 1139 [2019-11-23 23:30:22,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 326 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:30:22,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2019-11-23 23:30:22,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1068. [2019-11-23 23:30:22,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-23 23:30:22,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1165 transitions. [2019-11-23 23:30:22,427 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1165 transitions. Word has length 164 [2019-11-23 23:30:22,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:22,428 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1165 transitions. [2019-11-23 23:30:22,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:22,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1165 transitions. [2019-11-23 23:30:22,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-23 23:30:22,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:22,431 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:22,635 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:30:22,635 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:22,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:22,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1425418322, now seen corresponding path program 1 times [2019-11-23 23:30:22,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:22,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621305829] [2019-11-23 23:30:22,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:22,950 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 161 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:22,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621305829] [2019-11-23 23:30:22,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666451564] [2019-11-23 23:30:22,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:30:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:23,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:30:23,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:30:23,112 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-23 23:30:23,112 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:30:23,137 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-23 23:30:23,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:30:23,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2019-11-23 23:30:23,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993905624] [2019-11-23 23:30:23,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:23,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:23,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:23,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-23 23:30:23,139 INFO L87 Difference]: Start difference. First operand 1068 states and 1165 transitions. Second operand 3 states. [2019-11-23 23:30:23,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:23,438 INFO L93 Difference]: Finished difference Result 2133 states and 2338 transitions. [2019-11-23 23:30:23,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:23,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-11-23 23:30:23,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:23,439 INFO L225 Difference]: With dead ends: 2133 [2019-11-23 23:30:23,439 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:30:23,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 331 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-23 23:30:23,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:30:23,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:30:23,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:30:23,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:30:23,443 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 167 [2019-11-23 23:30:23,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:23,443 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:30:23,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:23,443 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:30:23,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:30:23,650 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:30:23,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:30:23,851 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 96 [2019-11-23 23:30:24,211 WARN L192 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2019-11-23 23:30:24,536 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 44 [2019-11-23 23:30:24,539 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:30:24,540 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:30:24,540 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:30:24,540 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:30:24,540 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:30:24,540 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:30:24,540 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:30:24,540 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:30:24,541 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:30:24,541 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:30:24,541 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-23 23:30:24,541 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:30:24,541 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:30:24,542 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:30:24,542 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:30:24,542 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:30:24,542 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:30:24,542 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:30:24,542 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:30:24,542 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:30:24,544 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse5 (= ~a16~0 4)) (.cse2 (<= ~a20~0 0)) (.cse7 (= ~a17~0 1)) (.cse9 (= 13 ~a8~0)) (.cse4 (not (= 15 ~a8~0))) (.cse3 (= ~a16~0 5)) (.cse6 (not (= 1 ~a7~0))) (.cse0 (<= ~a17~0 0)) (.cse1 (= ~a21~0 1)) (.cse8 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse1 .cse2) (and .cse6 .cse0 .cse1 .cse2) (and .cse5 .cse4 .cse7 .cse1) (and .cse5 .cse4 .cse6 .cse1 .cse8) (and .cse9 .cse7) (and .cse6 .cse7 .cse1 .cse2) (and .cse5 .cse7 .cse1 .cse2) (and .cse6 .cse7 (= ~a12~0 8) .cse1 .cse8 (not (= 1 ULTIMATE.start_calculate_output_~input)) .cse3) (and .cse9 (not .cse3)) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse6 .cse1 .cse3) (and .cse6 .cse0 .cse1 .cse8))) [2019-11-23 23:30:24,544 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:30:24,545 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:30:24,545 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:30:24,545 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:30:24,546 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:30:24,547 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:30:24,547 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:30:24,547 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:30:24,547 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:30:24,547 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:30:24,547 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:30:24,547 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:30:24,547 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:30:24,548 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:30:24,548 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:30:24,548 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:30:24,548 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:30:24,548 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:30:24,548 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:30:24,548 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:30:24,548 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:30:24,548 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:30:24,549 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:30:24,550 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse5 (= ~a16~0 4)) (.cse2 (<= ~a20~0 0)) (.cse7 (= ~a17~0 1)) (.cse9 (= 13 ~a8~0)) (.cse4 (not (= 15 ~a8~0))) (.cse3 (= ~a16~0 5)) (.cse6 (not (= 1 ~a7~0))) (.cse0 (<= ~a17~0 0)) (.cse1 (= ~a21~0 1)) (.cse8 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse1 .cse2) (and .cse6 .cse0 .cse1 .cse2) (and .cse5 .cse4 .cse7 .cse1) (and .cse5 .cse4 .cse6 .cse1 .cse8) (and .cse9 .cse7) (and .cse6 .cse7 .cse1 .cse2) (and .cse5 .cse7 .cse1 .cse2) (and .cse6 (= ~a12~0 8) .cse7 .cse1 .cse8 .cse3) (and .cse9 (not .cse3)) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse6 .cse1 .cse3) (and .cse6 .cse0 .cse1 .cse8))) [2019-11-23 23:30:24,550 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:30:24,550 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:30:24,550 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:30:24,550 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:30:24,551 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:30:24,551 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:30:24,551 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:30:24,551 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:30:24,552 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:30:24,552 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:30:24,552 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:30:24,552 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:30:24,552 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:30:24,552 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:30:24,552 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:30:24,552 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:30:24,552 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:30:24,553 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:30:24,553 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:30:24,553 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:30:24,553 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:30:24,553 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:30:24,553 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:30:24,553 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 536) no Hoare annotation was computed. [2019-11-23 23:30:24,554 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:30:24,554 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:30:24,554 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:30:24,554 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:30:24,554 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:30:24,554 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:30:24,554 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:30:24,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:30:24 BoogieIcfgContainer [2019-11-23 23:30:24,604 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:30:24,606 INFO L168 Benchmark]: Toolchain (without parser) took 12556.59 ms. Allocated memory was 138.9 MB in the beginning and 421.0 MB in the end (delta: 282.1 MB). Free memory was 102.1 MB in the beginning and 174.6 MB in the end (delta: -72.5 MB). Peak memory consumption was 209.6 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:24,607 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-23 23:30:24,610 INFO L168 Benchmark]: CACSL2BoogieTranslator took 861.99 ms. Allocated memory was 138.9 MB in the beginning and 208.7 MB in the end (delta: 69.7 MB). Free memory was 101.9 MB in the beginning and 175.3 MB in the end (delta: -73.4 MB). Peak memory consumption was 35.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:24,611 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.52 ms. Allocated memory is still 208.7 MB. Free memory was 175.3 MB in the beginning and 169.5 MB in the end (delta: 5.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:24,614 INFO L168 Benchmark]: Boogie Preprocessor took 60.59 ms. Allocated memory is still 208.7 MB. Free memory was 169.5 MB in the beginning and 164.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:24,615 INFO L168 Benchmark]: RCFGBuilder took 1995.16 ms. Allocated memory was 208.7 MB in the beginning and 250.6 MB in the end (delta: 41.9 MB). Free memory was 164.5 MB in the beginning and 204.3 MB in the end (delta: -39.8 MB). Peak memory consumption was 113.5 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:24,616 INFO L168 Benchmark]: TraceAbstraction took 9543.06 ms. Allocated memory was 250.6 MB in the beginning and 421.0 MB in the end (delta: 170.4 MB). Free memory was 202.5 MB in the beginning and 174.6 MB in the end (delta: 27.9 MB). Peak memory consumption was 198.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:24,625 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.22 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 861.99 ms. Allocated memory was 138.9 MB in the beginning and 208.7 MB in the end (delta: 69.7 MB). Free memory was 101.9 MB in the beginning and 175.3 MB in the end (delta: -73.4 MB). Peak memory consumption was 35.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 91.52 ms. Allocated memory is still 208.7 MB. Free memory was 175.3 MB in the beginning and 169.5 MB in the end (delta: 5.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.59 ms. Allocated memory is still 208.7 MB. Free memory was 169.5 MB in the beginning and 164.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1995.16 ms. Allocated memory was 208.7 MB in the beginning and 250.6 MB in the end (delta: 41.9 MB). Free memory was 164.5 MB in the beginning and 204.3 MB in the end (delta: -39.8 MB). Peak memory consumption was 113.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9543.06 ms. Allocated memory was 250.6 MB in the beginning and 421.0 MB in the end (delta: 170.4 MB). Free memory was 202.5 MB in the beginning and 174.6 MB in the end (delta: 27.9 MB). Peak memory consumption was 198.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 536]: 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: (((((((((((((((a17 <= 0 && a21 == 1) && a20 <= 0) && a16 == 5) || (((!(15 == a8) && a21 == 1) && a20 <= 0) && a16 == 5)) || (((a16 == 4 && a17 <= 0) && a21 == 1) && a20 <= 0)) || (((!(1 == a7) && a17 <= 0) && a21 == 1) && a20 <= 0)) || (((a16 == 4 && !(15 == a8)) && a17 == 1) && a21 == 1)) || ((((a16 == 4 && !(15 == a8)) && !(1 == a7)) && a21 == 1) && a20 == 1)) || (13 == a8 && a17 == 1)) || (((!(1 == a7) && a17 == 1) && a21 == 1) && a20 <= 0)) || (((a16 == 4 && a17 == 1) && a21 == 1) && a20 <= 0)) || ((((((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1) && a20 == 1) && !(1 == input)) && a16 == 5)) || (13 == a8 && !(a16 == 5))) || (((!(15 == a8) && a17 <= 0) && a21 == 1) && a16 == 5)) || (((!(15 == a8) && !(1 == a7)) && a21 == 1) && a16 == 5)) || (((!(1 == a7) && a17 <= 0) && a21 == 1) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((((((a17 <= 0 && a21 == 1) && a20 <= 0) && a16 == 5) || (((!(15 == a8) && a21 == 1) && a20 <= 0) && a16 == 5)) || (((a16 == 4 && a17 <= 0) && a21 == 1) && a20 <= 0)) || (((!(1 == a7) && a17 <= 0) && a21 == 1) && a20 <= 0)) || (((a16 == 4 && !(15 == a8)) && a17 == 1) && a21 == 1)) || ((((a16 == 4 && !(15 == a8)) && !(1 == a7)) && a21 == 1) && a20 == 1)) || (13 == a8 && a17 == 1)) || (((!(1 == a7) && a17 == 1) && a21 == 1) && a20 <= 0)) || (((a16 == 4 && a17 == 1) && a21 == 1) && a20 <= 0)) || (((((!(1 == a7) && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1) && a16 == 5)) || (13 == a8 && !(a16 == 5))) || (((!(15 == a8) && a17 <= 0) && a21 == 1) && a16 == 5)) || (((!(15 == a8) && !(1 == a7)) && a21 == 1) && a16 == 5)) || (((!(1 == a7) && a17 <= 0) && a21 == 1) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 9.4s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 653 SDtfs, 1352 SDslu, 84 SDs, 0 SdLazy, 3249 SolverSat, 979 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 704 GetRequests, 667 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1139occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 846 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 52 NumberOfFragments, 389 HoareAnnotationTreeSize, 3 FomulaSimplifications, 7848 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1394 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1408 NumberOfCodeBlocks, 1408 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1725 ConstructedInterpolants, 0 QuantifiedInterpolants, 700094 SizeOfPredicates, 2 NumberOfNonLiveVariables, 751 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 1289/1336 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...