/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 00:33:25,740 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:33:25,742 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:33:25,759 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:33:25,759 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:33:25,761 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:33:25,763 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:33:25,772 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:33:25,775 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:33:25,776 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:33:25,777 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:33:25,779 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:33:25,779 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:33:25,782 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:33:25,784 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:33:25,785 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:33:25,787 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:33:25,788 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:33:25,790 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:33:25,795 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:33:25,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:33:25,801 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:33:25,803 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:33:25,804 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:33:25,806 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:33:25,806 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:33:25,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:33:25,807 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:33:25,808 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:33:25,809 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:33:25,810 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:33:25,810 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:33:25,811 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:33:25,812 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:33:25,813 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:33:25,813 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:33:25,814 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:33:25,814 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:33:25,814 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:33:25,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:33:25,815 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:33:25,816 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 00:33:25,841 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:33:25,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:33:25,843 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:33:25,843 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:33:25,843 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:33:25,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:33:25,844 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:33:25,844 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:33:25,844 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:33:25,844 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:33:25,844 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:33:25,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:33:25,845 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:33:25,845 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:33:25,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:33:25,845 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:33:25,846 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:33:25,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:33:25,846 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:33:25,846 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:33:25,846 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:33:25,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:33:25,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:33:25,847 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:33:25,847 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:33:25,847 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:33:25,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:33:25,848 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:33:25,848 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 00:33:26,135 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:33:26,156 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:33:26,159 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:33:26,161 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:33:26,161 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:33:26,162 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2019-11-07 00:33:26,234 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07a547249/e41cb921f0ee4ab3999e0623c040688a/FLAGcc3e53d52 [2019-11-07 00:33:26,701 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:33:26,702 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2019-11-07 00:33:26,709 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07a547249/e41cb921f0ee4ab3999e0623c040688a/FLAGcc3e53d52 [2019-11-07 00:33:27,134 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07a547249/e41cb921f0ee4ab3999e0623c040688a [2019-11-07 00:33:27,156 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:33:27,158 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:33:27,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:33:27,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:33:27,163 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:33:27,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:33:27" (1/1) ... [2019-11-07 00:33:27,167 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3de5d45d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:27, skipping insertion in model container [2019-11-07 00:33:27,167 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:33:27" (1/1) ... [2019-11-07 00:33:27,178 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:33:27,209 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:33:27,496 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:33:27,501 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:33:27,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:33:27,653 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:33:27,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:27 WrapperNode [2019-11-07 00:33:27,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:33:27,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:33:27,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:33:27,655 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:33:27,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:27" (1/1) ... [2019-11-07 00:33:27,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:27" (1/1) ... [2019-11-07 00:33:27,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:27" (1/1) ... [2019-11-07 00:33:27,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:27" (1/1) ... [2019-11-07 00:33:27,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:27" (1/1) ... [2019-11-07 00:33:27,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:27" (1/1) ... [2019-11-07 00:33:27,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:27" (1/1) ... [2019-11-07 00:33:27,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:33:27,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:33:27,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:33:27,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:33:27,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:27" (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-07 00:33:27,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:33:27,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:33:27,759 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:33:27,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:33:27,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 00:33:27,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-07 00:33:27,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-11-07 00:33:27,760 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:33:27,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-07 00:33:27,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-07 00:33:27,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-07 00:33:27,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:33:27,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:33:27,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-07 00:33:28,079 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:33:28,079 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 00:33:28,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:33:28 BoogieIcfgContainer [2019-11-07 00:33:28,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:33:28,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:33:28,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:33:28,085 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:33:28,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:33:27" (1/3) ... [2019-11-07 00:33:28,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb05d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:33:28, skipping insertion in model container [2019-11-07 00:33:28,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:27" (2/3) ... [2019-11-07 00:33:28,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb05d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:33:28, skipping insertion in model container [2019-11-07 00:33:28,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:33:28" (3/3) ... [2019-11-07 00:33:28,089 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+nlh-reducer.c [2019-11-07 00:33:28,100 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:33:28,109 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-07 00:33:28,121 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-07 00:33:28,149 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:33:28,150 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:33:28,150 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:33:28,150 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:33:28,150 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:33:28,151 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:33:28,151 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:33:28,151 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:33:28,176 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-11-07 00:33:28,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-07 00:33:28,183 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:33:28,184 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:33:28,186 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:33:28,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:33:28,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1395858257, now seen corresponding path program 1 times [2019-11-07 00:33:28,199 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:33:28,200 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420723573] [2019-11-07 00:33:28,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:33:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:33:28,409 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-07 00:33:28,410 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420723573] [2019-11-07 00:33:28,411 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:33:28,411 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:33:28,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552129600] [2019-11-07 00:33:28,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:33:28,418 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:33:28,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:33:28,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:33:28,436 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2019-11-07 00:33:28,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:33:28,489 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2019-11-07 00:33:28,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:33:28,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-07 00:33:28,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:33:28,502 INFO L225 Difference]: With dead ends: 51 [2019-11-07 00:33:28,502 INFO L226 Difference]: Without dead ends: 33 [2019-11-07 00:33:28,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:33:28,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-07 00:33:28,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-11-07 00:33:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-07 00:33:28,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-11-07 00:33:28,546 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 13 [2019-11-07 00:33:28,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:33:28,546 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-11-07 00:33:28,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:33:28,547 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-11-07 00:33:28,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-07 00:33:28,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:33:28,548 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:33:28,549 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:33:28,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:33:28,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1868760050, now seen corresponding path program 1 times [2019-11-07 00:33:28,550 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:33:28,550 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822218529] [2019-11-07 00:33:28,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:33:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:33:28,614 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-07 00:33:28,615 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822218529] [2019-11-07 00:33:28,615 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:33:28,616 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:33:28,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530586828] [2019-11-07 00:33:28,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:33:28,618 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:33:28,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:33:28,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:33:28,619 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 4 states. [2019-11-07 00:33:28,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:33:28,698 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2019-11-07 00:33:28,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:33:28,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-07 00:33:28,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:33:28,704 INFO L225 Difference]: With dead ends: 51 [2019-11-07 00:33:28,704 INFO L226 Difference]: Without dead ends: 49 [2019-11-07 00:33:28,705 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-07 00:33:28,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-07 00:33:28,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2019-11-07 00:33:28,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-07 00:33:28,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-11-07 00:33:28,720 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 14 [2019-11-07 00:33:28,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:33:28,721 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-11-07 00:33:28,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:33:28,721 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-11-07 00:33:28,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-07 00:33:28,722 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:33:28,722 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:33:28,723 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:33:28,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:33:28,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1932482999, now seen corresponding path program 1 times [2019-11-07 00:33:28,723 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:33:28,724 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615066978] [2019-11-07 00:33:28,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:33:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:33:28,771 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-07 00:33:28,771 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615066978] [2019-11-07 00:33:28,772 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:33:28,772 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:33:28,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390069142] [2019-11-07 00:33:28,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:33:28,773 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:33:28,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:33:28,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:33:28,774 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 3 states. [2019-11-07 00:33:28,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:33:28,833 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2019-11-07 00:33:28,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:33:28,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-07 00:33:28,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:33:28,835 INFO L225 Difference]: With dead ends: 60 [2019-11-07 00:33:28,835 INFO L226 Difference]: Without dead ends: 40 [2019-11-07 00:33:28,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:33:28,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-07 00:33:28,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-11-07 00:33:28,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-07 00:33:28,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-11-07 00:33:28,843 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2019-11-07 00:33:28,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:33:28,843 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-07 00:33:28,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:33:28,844 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-11-07 00:33:28,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 00:33:28,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:33:28,844 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:33:28,845 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:33:28,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:33:28,845 INFO L82 PathProgramCache]: Analyzing trace with hash -2140784762, now seen corresponding path program 1 times [2019-11-07 00:33:28,846 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:33:28,846 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009969141] [2019-11-07 00:33:28,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:33:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:33:28,911 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-07 00:33:28,911 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009969141] [2019-11-07 00:33:28,912 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:33:28,912 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:33:28,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973119042] [2019-11-07 00:33:28,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:33:28,914 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:33:28,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:33:28,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:33:28,914 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2019-11-07 00:33:28,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:33:28,960 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2019-11-07 00:33:28,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:33:28,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-07 00:33:28,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:33:28,963 INFO L225 Difference]: With dead ends: 54 [2019-11-07 00:33:28,963 INFO L226 Difference]: Without dead ends: 34 [2019-11-07 00:33:28,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:33:28,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-07 00:33:28,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2019-11-07 00:33:28,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-07 00:33:28,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-11-07 00:33:28,969 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 15 [2019-11-07 00:33:28,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:33:28,970 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-11-07 00:33:28,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:33:28,970 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-11-07 00:33:28,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 00:33:28,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:33:28,971 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] [2019-11-07 00:33:28,971 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:33:28,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:33:28,972 INFO L82 PathProgramCache]: Analyzing trace with hash 341027121, now seen corresponding path program 1 times [2019-11-07 00:33:28,972 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:33:28,972 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121898756] [2019-11-07 00:33:28,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:33:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:33:30,000 WARN L191 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 88 [2019-11-07 00:33:30,500 WARN L191 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 91 [2019-11-07 00:33:30,523 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-07 00:33:30,524 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121898756] [2019-11-07 00:33:30,524 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:33:30,524 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 00:33:30,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856356672] [2019-11-07 00:33:30,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 00:33:30,525 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:33:30,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 00:33:30,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-07 00:33:30,526 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 9 states. [2019-11-07 00:33:31,550 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 42 [2019-11-07 00:33:31,719 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 46 [2019-11-07 00:33:31,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:33:31,745 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2019-11-07 00:33:31,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 00:33:31,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-11-07 00:33:31,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:33:31,746 INFO L225 Difference]: With dead ends: 44 [2019-11-07 00:33:31,746 INFO L226 Difference]: Without dead ends: 29 [2019-11-07 00:33:31,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-07 00:33:31,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-07 00:33:31,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-07 00:33:31,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-07 00:33:31,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-11-07 00:33:31,752 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 20 [2019-11-07 00:33:31,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:33:31,752 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-11-07 00:33:31,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 00:33:31,753 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-11-07 00:33:31,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 00:33:31,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:33:31,754 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] [2019-11-07 00:33:31,754 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:33:31,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:33:31,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1330084180, now seen corresponding path program 1 times [2019-11-07 00:33:31,754 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:33:31,755 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037190077] [2019-11-07 00:33:31,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:33:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:33:31,806 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-07 00:33:31,806 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037190077] [2019-11-07 00:33:31,807 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:33:31,807 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:33:31,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900186898] [2019-11-07 00:33:31,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:33:31,808 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:33:31,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:33:31,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:33:31,808 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 6 states. [2019-11-07 00:33:31,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:33:31,885 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-11-07 00:33:31,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 00:33:31,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-07 00:33:31,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:33:31,888 INFO L225 Difference]: With dead ends: 42 [2019-11-07 00:33:31,889 INFO L226 Difference]: Without dead ends: 40 [2019-11-07 00:33:31,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-07 00:33:31,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-07 00:33:31,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2019-11-07 00:33:31,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-07 00:33:31,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-07 00:33:31,898 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 21 [2019-11-07 00:33:31,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:33:31,898 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-07 00:33:31,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:33:31,899 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-11-07 00:33:31,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-07 00:33:31,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:33:31,904 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:33:31,904 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:33:31,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:33:31,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1309636523, now seen corresponding path program 1 times [2019-11-07 00:33:31,905 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:33:31,905 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777294828] [2019-11-07 00:33:31,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:33:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:33:32,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:33:32,088 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777294828] [2019-11-07 00:33:32,088 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065654324] [2019-11-07 00:33:32,088 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-07 00:33:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:33:32,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-07 00:33:32,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:33:32,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:33:32,249 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:33:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:33:32,340 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [598407089] [2019-11-07 00:33:32,346 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 23 [2019-11-07 00:33:32,388 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 00:33:32,388 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 00:33:32,454 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-07 00:33:32,456 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 24 root evaluator evaluations with a maximum evaluation depth of 0. Performed 24 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 38 variables. [2019-11-07 00:33:32,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:33:32,460 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-07 00:33:32,495 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-11-07 00:33:32,496 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-07 00:33:32,497 INFO L553 sIntCurrentIteration]: We unified 21 AI predicates to 21 [2019-11-07 00:33:32,497 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-07 00:33:32,498 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-07 00:33:32,498 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6, 4, 4] total 9 [2019-11-07 00:33:32,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338733385] [2019-11-07 00:33:32,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-07 00:33:32,499 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:33:32,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:33:32,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-07 00:33:32,500 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 2 states. [2019-11-07 00:33:32,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:33:32,502 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-07 00:33:32,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-07 00:33:32,502 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2019-11-07 00:33:32,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:33:32,502 INFO L225 Difference]: With dead ends: 27 [2019-11-07 00:33:32,502 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 00:33:32,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-07 00:33:32,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 00:33:32,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 00:33:32,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 00:33:32,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 00:33:32,504 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-11-07 00:33:32,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:33:32,504 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 00:33:32,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-07 00:33:32,505 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 00:33:32,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 00:33:32,710 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:33:32,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 00:33:32,753 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-11-07 00:33:32,753 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-11-07 00:33:32,753 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:33:32,753 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:33:32,754 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 00:33:32,754 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 00:33:32,754 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 00:33:32,754 INFO L446 ceAbstractionStarter]: At program point L126(lines 93 127) the Hoare annotation is: true [2019-11-07 00:33:32,754 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 9 163) no Hoare annotation was computed. [2019-11-07 00:33:32,754 INFO L439 ceAbstractionStarter]: At program point L151(lines 21 152) the Hoare annotation is: (= main_~main__loop_entered~0 0) [2019-11-07 00:33:32,754 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 128) no Hoare annotation was computed. [2019-11-07 00:33:32,755 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 157) no Hoare annotation was computed. [2019-11-07 00:33:32,755 INFO L439 ceAbstractionStarter]: At program point L114(lines 94 123) the Hoare annotation is: false [2019-11-07 00:33:32,755 INFO L443 ceAbstractionStarter]: For program point L57(lines 57 83) no Hoare annotation was computed. [2019-11-07 00:33:32,755 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 147) no Hoare annotation was computed. [2019-11-07 00:33:32,756 INFO L439 ceAbstractionStarter]: At program point L82(lines 57 83) the Hoare annotation is: false [2019-11-07 00:33:32,756 INFO L443 ceAbstractionStarter]: For program point L16(lines 16 162) no Hoare annotation was computed. [2019-11-07 00:33:32,756 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 133) no Hoare annotation was computed. [2019-11-07 00:33:32,756 INFO L439 ceAbstractionStarter]: At program point L74(lines 41 134) the Hoare annotation is: false [2019-11-07 00:33:32,756 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-11-07 00:33:32,756 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 115) no Hoare annotation was computed. [2019-11-07 00:33:32,756 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-07 00:33:32,756 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 75) no Hoare annotation was computed. [2019-11-07 00:33:32,757 INFO L439 ceAbstractionStarter]: At program point L87(lines 55 88) the Hoare annotation is: false [2019-11-07 00:33:32,758 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 152) no Hoare annotation was computed. [2019-11-07 00:33:32,759 INFO L439 ceAbstractionStarter]: At program point L141(lines 26 142) the Hoare annotation is: false [2019-11-07 00:33:32,759 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 9 163) no Hoare annotation was computed. [2019-11-07 00:33:32,759 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2019-11-07 00:33:32,759 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 9 163) the Hoare annotation is: true [2019-11-07 00:33:32,759 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2019-11-07 00:33:32,759 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 142) no Hoare annotation was computed. [2019-11-07 00:33:32,760 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 88) no Hoare annotation was computed. [2019-11-07 00:33:32,760 INFO L439 ceAbstractionStarter]: At program point L146(lines 24 147) the Hoare annotation is: false [2019-11-07 00:33:32,760 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-07 00:33:32,760 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-07 00:33:32,760 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 134) no Hoare annotation was computed. [2019-11-07 00:33:32,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:33:32 BoogieIcfgContainer [2019-11-07 00:33:32,775 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 00:33:32,778 INFO L168 Benchmark]: Toolchain (without parser) took 5619.48 ms. Allocated memory was 145.2 MB in the beginning and 246.4 MB in the end (delta: 101.2 MB). Free memory was 101.7 MB in the beginning and 129.3 MB in the end (delta: -27.6 MB). Peak memory consumption was 73.6 MB. Max. memory is 7.1 GB. [2019-11-07 00:33:32,784 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-07 00:33:32,786 INFO L168 Benchmark]: CACSL2BoogieTranslator took 495.39 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 101.5 MB in the beginning and 179.6 MB in the end (delta: -78.2 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2019-11-07 00:33:32,787 INFO L168 Benchmark]: Boogie Preprocessor took 40.27 ms. Allocated memory is still 201.9 MB. Free memory was 179.6 MB in the beginning and 177.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-11-07 00:33:32,787 INFO L168 Benchmark]: RCFGBuilder took 385.76 ms. Allocated memory is still 201.9 MB. Free memory was 177.7 MB in the beginning and 159.5 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. [2019-11-07 00:33:32,788 INFO L168 Benchmark]: TraceAbstraction took 4693.13 ms. Allocated memory was 201.9 MB in the beginning and 246.4 MB in the end (delta: 44.6 MB). Free memory was 158.8 MB in the beginning and 129.3 MB in the end (delta: 29.6 MB). Peak memory consumption was 74.1 MB. Max. memory is 7.1 GB. [2019-11-07 00:33:32,798 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 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 495.39 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 101.5 MB in the beginning and 179.6 MB in the end (delta: -78.2 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.27 ms. Allocated memory is still 201.9 MB. Free memory was 179.6 MB in the beginning and 177.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 385.76 ms. Allocated memory is still 201.9 MB. Free memory was 177.7 MB in the beginning and 159.5 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4693.13 ms. Allocated memory was 201.9 MB in the beginning and 246.4 MB in the end (delta: 44.6 MB). Free memory was 158.8 MB in the beginning and 129.3 MB in the end (delta: 29.6 MB). Peak memory consumption was 74.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: main__loop_entered == 0 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 36 locations, 3 error locations. Result: SAFE, OverallTime: 4.6s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 194 SDtfs, 149 SDslu, 246 SDs, 0 SdLazy, 107 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 44 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 15 NumberOfFragments, 14 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 59643 SizeOfPredicates, 3 NumberOfNonLiveVariables, 117 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 3/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 115, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9761904761904762, AVG_VARS_REMOVED_DURING_WEAKENING: 1.5238095238095237, AVG_WEAKENED_CONJUNCTS: 1.0, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...