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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/float-benchs/filter1.c.p+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 01:31:17,121 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 01:31:17,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 01:31:17,135 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 01:31:17,135 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 01:31:17,136 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 01:31:17,137 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 01:31:17,139 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 01:31:17,141 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 01:31:17,142 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 01:31:17,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 01:31:17,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 01:31:17,144 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 01:31:17,145 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 01:31:17,146 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 01:31:17,147 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 01:31:17,148 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 01:31:17,149 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 01:31:17,150 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 01:31:17,155 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 01:31:17,158 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 01:31:17,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 01:31:17,161 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 01:31:17,163 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 01:31:17,169 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 01:31:17,169 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 01:31:17,170 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 01:31:17,171 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 01:31:17,171 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 01:31:17,172 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 01:31:17,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 01:31:17,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 01:31:17,177 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 01:31:17,179 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 01:31:17,180 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 01:31:17,180 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 01:31:17,181 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 01:31:17,181 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 01:31:17,181 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 01:31:17,183 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 01:31:17,183 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 01:31:17,184 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 01:31:17,219 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 01:31:17,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 01:31:17,220 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 01:31:17,220 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 01:31:17,220 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 01:31:17,221 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 01:31:17,221 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 01:31:17,221 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 01:31:17,222 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 01:31:17,222 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 01:31:17,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 01:31:17,223 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 01:31:17,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 01:31:17,224 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 01:31:17,224 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 01:31:17,224 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 01:31:17,225 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 01:31:17,225 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 01:31:17,226 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 01:31:17,226 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 01:31:17,226 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 01:31:17,226 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 01:31:17,226 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 01:31:17,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:31:17,227 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 01:31:17,227 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 01:31:17,228 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 01:31:17,228 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 01:31:17,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 01:31:17,228 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 01:31:17,283 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 01:31:17,299 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 01:31:17,304 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 01:31:17,308 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 01:31:17,308 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 01:31:17,310 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/filter1.c.p+cfa-reducer.c [2019-09-10 01:31:17,375 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f248f27/a2521df4e94d42a5bb43787757fc0052/FLAG5808af2a1 [2019-09-10 01:31:17,798 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 01:31:17,799 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/filter1.c.p+cfa-reducer.c [2019-09-10 01:31:17,805 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f248f27/a2521df4e94d42a5bb43787757fc0052/FLAG5808af2a1 [2019-09-10 01:31:18,197 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f248f27/a2521df4e94d42a5bb43787757fc0052 [2019-09-10 01:31:18,211 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 01:31:18,213 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 01:31:18,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 01:31:18,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 01:31:18,219 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 01:31:18,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:31:18" (1/1) ... [2019-09-10 01:31:18,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@350286e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:18, skipping insertion in model container [2019-09-10 01:31:18,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:31:18" (1/1) ... [2019-09-10 01:31:18,231 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 01:31:18,251 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 01:31:18,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:31:18,479 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 01:31:18,511 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:31:18,627 INFO L192 MainTranslator]: Completed translation [2019-09-10 01:31:18,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:18 WrapperNode [2019-09-10 01:31:18,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 01:31:18,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 01:31:18,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 01:31:18,629 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 01:31:18,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:18" (1/1) ... [2019-09-10 01:31:18,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:18" (1/1) ... [2019-09-10 01:31:18,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:18" (1/1) ... [2019-09-10 01:31:18,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:18" (1/1) ... [2019-09-10 01:31:18,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:18" (1/1) ... [2019-09-10 01:31:18,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:18" (1/1) ... [2019-09-10 01:31:18,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:18" (1/1) ... [2019-09-10 01:31:18,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 01:31:18,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 01:31:18,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 01:31:18,680 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 01:31:18,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:18" (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-09-10 01:31:18,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 01:31:18,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 01:31:18,729 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 01:31:18,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 01:31:18,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 01:31:18,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2019-09-10 01:31:18,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 01:31:18,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 01:31:18,730 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 01:31:18,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 01:31:18,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 01:31:18,948 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 01:31:18,948 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 01:31:18,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:31:18 BoogieIcfgContainer [2019-09-10 01:31:18,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 01:31:18,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 01:31:18,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 01:31:18,956 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 01:31:18,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:31:18" (1/3) ... [2019-09-10 01:31:18,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c785629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:31:18, skipping insertion in model container [2019-09-10 01:31:18,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:18" (2/3) ... [2019-09-10 01:31:18,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c785629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:31:18, skipping insertion in model container [2019-09-10 01:31:18,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:31:18" (3/3) ... [2019-09-10 01:31:18,979 INFO L109 eAbstractionObserver]: Analyzing ICFG filter1.c.p+cfa-reducer.c [2019-09-10 01:31:19,003 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 01:31:19,013 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 01:31:19,031 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 01:31:19,071 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 01:31:19,072 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 01:31:19,072 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 01:31:19,072 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 01:31:19,072 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 01:31:19,072 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 01:31:19,072 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 01:31:19,073 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 01:31:19,088 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-09-10 01:31:19,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 01:31:19,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:31:19,099 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:31:19,101 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:31:19,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:31:19,105 INFO L82 PathProgramCache]: Analyzing trace with hash 604588517, now seen corresponding path program 1 times [2019-09-10 01:31:19,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:31:19,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:19,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:31:19,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:19,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:31:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:31:19,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:31:19,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:31:19,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:31:19,244 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:31:19,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:31:19,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:31:19,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:31:19,262 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2019-09-10 01:31:19,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:31:19,299 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2019-09-10 01:31:19,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:31:19,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-10 01:31:19,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:31:19,310 INFO L225 Difference]: With dead ends: 27 [2019-09-10 01:31:19,310 INFO L226 Difference]: Without dead ends: 19 [2019-09-10 01:31:19,313 INFO L628 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-09-10 01:31:19,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-10 01:31:19,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-10 01:31:19,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-10 01:31:19,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-09-10 01:31:19,349 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 17 [2019-09-10 01:31:19,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:31:19,350 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-09-10 01:31:19,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:31:19,351 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-09-10 01:31:19,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 01:31:19,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:31:19,352 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:31:19,352 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:31:19,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:31:19,353 INFO L82 PathProgramCache]: Analyzing trace with hash 715558858, now seen corresponding path program 1 times [2019-09-10 01:31:19,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:31:19,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:19,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:31:19,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:19,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:31:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:31:19,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:31:19,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:31:19,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 01:31:19,426 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:31:19,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:31:19,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:31:19,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:31:19,429 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 4 states. [2019-09-10 01:31:19,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:31:19,482 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2019-09-10 01:31:19,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:31:19,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-09-10 01:31:19,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:31:19,484 INFO L225 Difference]: With dead ends: 32 [2019-09-10 01:31:19,484 INFO L226 Difference]: Without dead ends: 32 [2019-09-10 01:31:19,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-09-10 01:31:19,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-10 01:31:19,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 21. [2019-09-10 01:31:19,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-10 01:31:19,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-09-10 01:31:19,490 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 17 [2019-09-10 01:31:19,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:31:19,491 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-09-10 01:31:19,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:31:19,491 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-09-10 01:31:19,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 01:31:19,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:31:19,492 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:31:19,493 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:31:19,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:31:19,493 INFO L82 PathProgramCache]: Analyzing trace with hash 731616207, now seen corresponding path program 1 times [2019-09-10 01:31:19,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:31:19,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:19,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:31:19,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:19,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:31:19,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:31:19,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:31:19,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:31:19,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:31:19,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:31:19,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:31:19,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:31:19,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:31:19,533 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 3 states. [2019-09-10 01:31:19,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:31:19,566 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2019-09-10 01:31:19,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:31:19,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-10 01:31:19,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:31:19,569 INFO L225 Difference]: With dead ends: 36 [2019-09-10 01:31:19,570 INFO L226 Difference]: Without dead ends: 36 [2019-09-10 01:31:19,571 INFO L628 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-09-10 01:31:19,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-10 01:31:19,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 23. [2019-09-10 01:31:19,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-10 01:31:19,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-09-10 01:31:19,576 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 17 [2019-09-10 01:31:19,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:31:19,577 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-09-10 01:31:19,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:31:19,577 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-09-10 01:31:19,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 01:31:19,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:31:19,578 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:31:19,578 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:31:19,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:31:19,579 INFO L82 PathProgramCache]: Analyzing trace with hash 556868071, now seen corresponding path program 1 times [2019-09-10 01:31:19,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:31:19,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:19,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:31:19,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:19,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:31:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:31:19,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:31:19,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:31:19,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:31:19,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:31:19,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:31:19,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:31:19,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:31:19,655 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 5 states. [2019-09-10 01:31:19,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:31:19,775 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2019-09-10 01:31:19,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 01:31:19,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-10 01:31:19,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:31:19,777 INFO L225 Difference]: With dead ends: 49 [2019-09-10 01:31:19,778 INFO L226 Difference]: Without dead ends: 49 [2019-09-10 01:31:19,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-10 01:31:19,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-10 01:31:19,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 28. [2019-09-10 01:31:19,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-10 01:31:19,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-09-10 01:31:19,783 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2019-09-10 01:31:19,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:31:19,784 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-09-10 01:31:19,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:31:19,784 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-09-10 01:31:19,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 01:31:19,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:31:19,785 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:31:19,785 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:31:19,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:31:19,786 INFO L82 PathProgramCache]: Analyzing trace with hash 717018360, now seen corresponding path program 1 times [2019-09-10 01:31:19,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:31:19,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:19,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:31:19,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:19,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:31:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:31:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:31:19,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:31:19,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:31:19,814 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:31:19,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:31:19,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:31:19,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:31:19,815 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2019-09-10 01:31:19,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:31:19,842 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-09-10 01:31:19,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:31:19,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-10 01:31:19,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:31:19,847 INFO L225 Difference]: With dead ends: 43 [2019-09-10 01:31:19,847 INFO L226 Difference]: Without dead ends: 43 [2019-09-10 01:31:19,847 INFO L628 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-09-10 01:31:19,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-10 01:31:19,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-09-10 01:31:19,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-10 01:31:19,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-09-10 01:31:19,857 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 18 [2019-09-10 01:31:19,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:31:19,858 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-09-10 01:31:19,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:31:19,858 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-09-10 01:31:19,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 01:31:19,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:31:19,859 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:31:19,859 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:31:19,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:31:19,860 INFO L82 PathProgramCache]: Analyzing trace with hash -405206560, now seen corresponding path program 1 times [2019-09-10 01:31:19,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:31:19,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:19,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:31:19,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:19,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:31:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:31:19,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:31:19,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:31:19,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:31:19,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:31:19,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:31:19,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:31:19,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:31:19,937 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 5 states. [2019-09-10 01:31:20,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:31:20,030 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-09-10 01:31:20,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 01:31:20,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-10 01:31:20,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:31:20,031 INFO L225 Difference]: With dead ends: 45 [2019-09-10 01:31:20,031 INFO L226 Difference]: Without dead ends: 45 [2019-09-10 01:31:20,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-10 01:31:20,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-10 01:31:20,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 29. [2019-09-10 01:31:20,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-10 01:31:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-09-10 01:31:20,037 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 18 [2019-09-10 01:31:20,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:31:20,037 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-09-10 01:31:20,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:31:20,037 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-09-10 01:31:20,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-10 01:31:20,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:31:20,039 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:31:20,039 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:31:20,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:31:20,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1201166603, now seen corresponding path program 1 times [2019-09-10 01:31:20,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:31:20,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:20,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:31:20,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:20,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:31:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:31:20,143 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:31:20,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:31:20,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:31:20,146 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2019-09-10 01:31:20,153 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [15], [19], [22], [24], [27], [30], [32], [35], [36], [38], [42], [44], [46], [57], [58], [59] [2019-09-10 01:31:20,202 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:31:20,202 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:31:20,298 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator COMPLT has no precise implementation. [2019-09-10 01:31:20,434 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 01:31:20,440 INFO L272 AbstractInterpreter]: Visited 21 different actions 118 times. Merged at 15 different actions 81 times. Widened at 4 different actions 8 times. Performed 374 root evaluator evaluations with a maximum evaluation depth of 4. Performed 374 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 18 fixpoints after 6 different actions. Largest state had 13 variables. [2019-09-10 01:31:20,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:31:20,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 01:31:20,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:31:20,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:31:20,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:31:20,471 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:31:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:31:20,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 01:31:20,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:31:20,613 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:31:20,613 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:31:20,723 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:31:20,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:31:20,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2019-09-10 01:31:20,728 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:31:20,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 01:31:20,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 01:31:20,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-09-10 01:31:20,730 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 11 states. [2019-09-10 01:31:20,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:31:20,946 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2019-09-10 01:31:20,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 01:31:20,946 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-09-10 01:31:20,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:31:20,947 INFO L225 Difference]: With dead ends: 30 [2019-09-10 01:31:20,948 INFO L226 Difference]: Without dead ends: 30 [2019-09-10 01:31:20,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2019-09-10 01:31:20,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-10 01:31:20,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-10 01:31:20,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-10 01:31:20,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-09-10 01:31:20,952 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 27 [2019-09-10 01:31:20,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:31:20,952 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-09-10 01:31:20,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 01:31:20,952 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-09-10 01:31:20,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-10 01:31:20,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:31:20,954 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:31:20,954 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:31:20,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:31:20,954 INFO L82 PathProgramCache]: Analyzing trace with hash 930293394, now seen corresponding path program 1 times [2019-09-10 01:31:20,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:31:20,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:20,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:31:20,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:20,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:31:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:31:21,044 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:31:21,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:31:21,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:31:21,045 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2019-09-10 01:31:21,046 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [15], [19], [22], [24], [27], [30], [32], [35], [36], [38], [40], [42], [46], [57], [58], [59] [2019-09-10 01:31:21,048 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:31:21,048 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:31:21,056 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator COMPGT has no precise implementation. [2019-09-10 01:31:21,121 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 01:31:21,122 INFO L272 AbstractInterpreter]: Visited 21 different actions 116 times. Merged at 15 different actions 80 times. Widened at 4 different actions 10 times. Performed 352 root evaluator evaluations with a maximum evaluation depth of 4. Performed 352 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 16 fixpoints after 5 different actions. Largest state had 13 variables. [2019-09-10 01:31:21,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:31:21,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 01:31:21,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:31:21,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:31:21,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:31:21,146 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:31:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:31:21,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 01:31:21,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:31:21,244 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:31:21,245 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:31:21,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:31:21,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:31:21,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2019-09-10 01:31:21,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:31:21,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 01:31:21,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 01:31:21,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-09-10 01:31:21,338 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 11 states. [2019-09-10 01:31:21,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:31:21,546 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-09-10 01:31:21,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 01:31:21,546 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-09-10 01:31:21,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:31:21,547 INFO L225 Difference]: With dead ends: 25 [2019-09-10 01:31:21,547 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 01:31:21,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-09-10 01:31:21,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 01:31:21,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 01:31:21,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 01:31:21,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 01:31:21,549 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2019-09-10 01:31:21,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:31:21,549 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 01:31:21,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 01:31:21,549 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 01:31:21,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 01:31:21,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 01:31:21 BoogieIcfgContainer [2019-09-10 01:31:21,556 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 01:31:21,559 INFO L168 Benchmark]: Toolchain (without parser) took 3344.68 ms. Allocated memory was 134.2 MB in the beginning and 255.9 MB in the end (delta: 121.6 MB). Free memory was 90.5 MB in the beginning and 224.7 MB in the end (delta: -134.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-09-10 01:31:21,560 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 134.2 MB. Free memory was 108.7 MB in the beginning and 108.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 01:31:21,561 INFO L168 Benchmark]: CACSL2BoogieTranslator took 412.90 ms. Allocated memory was 134.2 MB in the beginning and 200.3 MB in the end (delta: 66.1 MB). Free memory was 90.3 MB in the beginning and 177.8 MB in the end (delta: -87.5 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2019-09-10 01:31:21,562 INFO L168 Benchmark]: Boogie Preprocessor took 50.80 ms. Allocated memory is still 200.3 MB. Free memory was 177.8 MB in the beginning and 175.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-09-10 01:31:21,563 INFO L168 Benchmark]: RCFGBuilder took 270.56 ms. Allocated memory is still 200.3 MB. Free memory was 175.6 MB in the beginning and 163.3 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2019-09-10 01:31:21,564 INFO L168 Benchmark]: TraceAbstraction took 2603.65 ms. Allocated memory was 200.3 MB in the beginning and 255.9 MB in the end (delta: 55.6 MB). Free memory was 162.7 MB in the beginning and 224.7 MB in the end (delta: -62.0 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-09-10 01:31:21,568 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 134.2 MB. Free memory was 108.7 MB in the beginning and 108.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 412.90 ms. Allocated memory was 134.2 MB in the beginning and 200.3 MB in the end (delta: 66.1 MB). Free memory was 90.3 MB in the beginning and 177.8 MB in the end (delta: -87.5 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.80 ms. Allocated memory is still 200.3 MB. Free memory was 177.8 MB in the beginning and 175.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 270.56 ms. Allocated memory is still 200.3 MB. Free memory was 175.6 MB in the beginning and 163.3 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2603.65 ms. Allocated memory was 200.3 MB in the beginning and 255.9 MB in the end (delta: 55.6 MB). Free memory was 162.7 MB in the beginning and 224.7 MB in the end (delta: -62.0 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 24 locations, 1 error locations. SAFE Result, 2.5s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 173 SDtfs, 202 SDslu, 260 SDs, 0 SdLazy, 132 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 74 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 257 ConstructedInterpolants, 0 QuantifiedInterpolants, 22139 SizeOfPredicates, 14 NumberOfNonLiveVariables, 153 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 27/57 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...