/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/psyco/psyco_io_1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:24:45,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:24:45,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:24:45,291 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:24:45,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:24:45,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:24:45,295 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:24:45,308 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:24:45,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:24:45,311 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:24:45,312 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:24:45,314 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:24:45,314 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:24:45,318 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:24:45,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:24:45,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:24:45,325 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:24:45,328 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:24:45,329 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:24:45,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:24:45,340 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:24:45,341 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:24:45,343 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:24:45,343 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:24:45,346 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:24:45,347 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:24:45,347 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:24:45,349 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:24:45,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:24:45,352 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:24:45,352 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:24:45,353 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:24:45,353 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:24:45,354 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:24:45,356 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:24:45,356 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:24:45,357 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:24:45,357 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:24:45,357 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:24:45,362 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:24:45,363 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:24:45,364 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-23 22:24:45,380 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:24:45,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:24:45,382 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:24:45,382 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:24:45,382 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:24:45,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:24:45,383 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:24:45,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:24:45,383 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:24:45,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:24:45,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:24:45,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:24:45,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:24:45,384 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:24:45,384 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:24:45,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:24:45,385 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:24:45,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:24:45,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:24:45,385 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:24:45,385 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:24:45,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:24:45,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:24:45,386 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:24:45,386 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:24:45,386 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:24:45,387 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:24:45,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:24:45,387 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:24:45,387 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:24:45,660 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:24:45,675 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:24:45,680 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:24:45,682 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:24:45,682 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:24:45,683 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_io_1.c [2019-11-23 22:24:45,759 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93f36dd6e/857228ecee0e4e3f8a9c0b523975ceaf/FLAG23e611ec7 [2019-11-23 22:24:46,244 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:24:46,244 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_io_1.c [2019-11-23 22:24:46,252 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93f36dd6e/857228ecee0e4e3f8a9c0b523975ceaf/FLAG23e611ec7 [2019-11-23 22:24:46,641 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93f36dd6e/857228ecee0e4e3f8a9c0b523975ceaf [2019-11-23 22:24:46,651 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:24:46,652 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:24:46,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:24:46,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:24:46,657 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:24:46,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:24:46" (1/1) ... [2019-11-23 22:24:46,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ea18467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:46, skipping insertion in model container [2019-11-23 22:24:46,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:24:46" (1/1) ... [2019-11-23 22:24:46,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:24:46,703 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:24:46,937 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:24:46,942 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:24:46,986 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:24:47,088 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:24:47,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:47 WrapperNode [2019-11-23 22:24:47,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:24:47,090 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:24:47,090 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:24:47,090 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:24:47,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:47" (1/1) ... [2019-11-23 22:24:47,107 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:47" (1/1) ... [2019-11-23 22:24:47,134 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:24:47,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:24:47,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:24:47,135 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:24:47,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:47" (1/1) ... [2019-11-23 22:24:47,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:47" (1/1) ... [2019-11-23 22:24:47,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:47" (1/1) ... [2019-11-23 22:24:47,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:47" (1/1) ... [2019-11-23 22:24:47,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:47" (1/1) ... [2019-11-23 22:24:47,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:47" (1/1) ... [2019-11-23 22:24:47,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:47" (1/1) ... [2019-11-23 22:24:47,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:24:47,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:24:47,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:24:47,166 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:24:47,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:24:47,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:24:47,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:24:47,712 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:24:47,713 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-23 22:24:47,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:24:47 BoogieIcfgContainer [2019-11-23 22:24:47,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:24:47,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:24:47,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:24:47,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:24:47,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:24:46" (1/3) ... [2019-11-23 22:24:47,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5505edea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:24:47, skipping insertion in model container [2019-11-23 22:24:47,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:47" (2/3) ... [2019-11-23 22:24:47,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5505edea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:24:47, skipping insertion in model container [2019-11-23 22:24:47,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:24:47" (3/3) ... [2019-11-23 22:24:47,723 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_io_1.c [2019-11-23 22:24:47,733 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:24:47,739 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:24:47,750 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:24:47,776 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:24:47,777 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:24:47,777 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:24:47,777 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:24:47,777 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:24:47,777 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:24:47,778 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:24:47,778 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:24:47,793 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2019-11-23 22:24:47,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-23 22:24:47,798 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:47,799 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:47,799 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:47,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:47,805 INFO L82 PathProgramCache]: Analyzing trace with hash 352571312, now seen corresponding path program 1 times [2019-11-23 22:24:47,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:47,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790563203] [2019-11-23 22:24:47,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:47,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:47,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790563203] [2019-11-23 22:24:47,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:47,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:24:47,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81921106] [2019-11-23 22:24:47,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 22:24:47,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:47,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 22:24:47,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 22:24:47,969 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 2 states. [2019-11-23 22:24:47,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:47,995 INFO L93 Difference]: Finished difference Result 130 states and 244 transitions. [2019-11-23 22:24:47,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 22:24:47,996 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-23 22:24:47,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:48,006 INFO L225 Difference]: With dead ends: 130 [2019-11-23 22:24:48,006 INFO L226 Difference]: Without dead ends: 57 [2019-11-23 22:24:48,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 22:24:48,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-23 22:24:48,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-11-23 22:24:48,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-23 22:24:48,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 87 transitions. [2019-11-23 22:24:48,053 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 87 transitions. Word has length 9 [2019-11-23 22:24:48,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:48,054 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 87 transitions. [2019-11-23 22:24:48,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 22:24:48,054 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 87 transitions. [2019-11-23 22:24:48,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-23 22:24:48,055 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:48,055 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:48,056 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:48,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:48,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1422697760, now seen corresponding path program 1 times [2019-11-23 22:24:48,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:48,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240204014] [2019-11-23 22:24:48,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:48,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:48,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240204014] [2019-11-23 22:24:48,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:48,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:24:48,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883831008] [2019-11-23 22:24:48,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:48,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:48,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:48,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:48,102 INFO L87 Difference]: Start difference. First operand 57 states and 87 transitions. Second operand 3 states. [2019-11-23 22:24:48,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:48,176 INFO L93 Difference]: Finished difference Result 115 states and 176 transitions. [2019-11-23 22:24:48,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:48,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-23 22:24:48,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:48,178 INFO L225 Difference]: With dead ends: 115 [2019-11-23 22:24:48,181 INFO L226 Difference]: Without dead ends: 60 [2019-11-23 22:24:48,183 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:48,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-23 22:24:48,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-11-23 22:24:48,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-23 22:24:48,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 90 transitions. [2019-11-23 22:24:48,202 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 90 transitions. Word has length 10 [2019-11-23 22:24:48,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:48,202 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 90 transitions. [2019-11-23 22:24:48,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:48,205 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 90 transitions. [2019-11-23 22:24:48,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 22:24:48,206 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:48,207 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:48,207 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:48,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:48,207 INFO L82 PathProgramCache]: Analyzing trace with hash 658032531, now seen corresponding path program 1 times [2019-11-23 22:24:48,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:48,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771893514] [2019-11-23 22:24:48,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:48,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:48,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771893514] [2019-11-23 22:24:48,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:48,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:24:48,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325888878] [2019-11-23 22:24:48,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:48,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:48,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:48,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:48,319 INFO L87 Difference]: Start difference. First operand 60 states and 90 transitions. Second operand 3 states. [2019-11-23 22:24:48,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:48,383 INFO L93 Difference]: Finished difference Result 109 states and 165 transitions. [2019-11-23 22:24:48,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:48,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-23 22:24:48,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:48,384 INFO L225 Difference]: With dead ends: 109 [2019-11-23 22:24:48,385 INFO L226 Difference]: Without dead ends: 52 [2019-11-23 22:24:48,385 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:48,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-23 22:24:48,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-11-23 22:24:48,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-23 22:24:48,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2019-11-23 22:24:48,393 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 15 [2019-11-23 22:24:48,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:48,393 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2019-11-23 22:24:48,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:48,394 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2019-11-23 22:24:48,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 22:24:48,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:48,395 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:48,395 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:48,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:48,395 INFO L82 PathProgramCache]: Analyzing trace with hash 2017993163, now seen corresponding path program 1 times [2019-11-23 22:24:48,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:48,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66619538] [2019-11-23 22:24:48,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:48,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:48,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66619538] [2019-11-23 22:24:48,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:48,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:24:48,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925304820] [2019-11-23 22:24:48,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:48,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:48,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:48,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:48,486 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand 3 states. [2019-11-23 22:24:48,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:48,572 INFO L93 Difference]: Finished difference Result 136 states and 206 transitions. [2019-11-23 22:24:48,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:48,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-23 22:24:48,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:48,574 INFO L225 Difference]: With dead ends: 136 [2019-11-23 22:24:48,574 INFO L226 Difference]: Without dead ends: 90 [2019-11-23 22:24:48,575 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:48,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-23 22:24:48,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2019-11-23 22:24:48,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-23 22:24:48,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 128 transitions. [2019-11-23 22:24:48,585 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 128 transitions. Word has length 20 [2019-11-23 22:24:48,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:48,585 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 128 transitions. [2019-11-23 22:24:48,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:48,586 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 128 transitions. [2019-11-23 22:24:48,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 22:24:48,587 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:48,587 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] [2019-11-23 22:24:48,587 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:48,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:48,588 INFO L82 PathProgramCache]: Analyzing trace with hash 398483104, now seen corresponding path program 1 times [2019-11-23 22:24:48,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:48,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621908400] [2019-11-23 22:24:48,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:48,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:48,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621908400] [2019-11-23 22:24:48,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:48,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:24:48,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185742852] [2019-11-23 22:24:48,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:48,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:48,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:48,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:48,632 INFO L87 Difference]: Start difference. First operand 87 states and 128 transitions. Second operand 3 states. [2019-11-23 22:24:48,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:48,677 INFO L93 Difference]: Finished difference Result 176 states and 258 transitions. [2019-11-23 22:24:48,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:48,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 22:24:48,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:48,679 INFO L225 Difference]: With dead ends: 176 [2019-11-23 22:24:48,680 INFO L226 Difference]: Without dead ends: 97 [2019-11-23 22:24:48,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:48,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-23 22:24:48,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2019-11-23 22:24:48,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-23 22:24:48,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 136 transitions. [2019-11-23 22:24:48,699 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 136 transitions. Word has length 21 [2019-11-23 22:24:48,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:48,702 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 136 transitions. [2019-11-23 22:24:48,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:48,703 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 136 transitions. [2019-11-23 22:24:48,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:24:48,704 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:48,704 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:48,706 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:48,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:48,706 INFO L82 PathProgramCache]: Analyzing trace with hash -162530645, now seen corresponding path program 1 times [2019-11-23 22:24:48,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:48,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394634155] [2019-11-23 22:24:48,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:48,817 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:24:48,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394634155] [2019-11-23 22:24:48,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:48,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:24:48,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704923578] [2019-11-23 22:24:48,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:48,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:48,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:48,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:48,822 INFO L87 Difference]: Start difference. First operand 95 states and 136 transitions. Second operand 3 states. [2019-11-23 22:24:48,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:48,850 INFO L93 Difference]: Finished difference Result 160 states and 230 transitions. [2019-11-23 22:24:48,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:48,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-23 22:24:48,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:48,852 INFO L225 Difference]: With dead ends: 160 [2019-11-23 22:24:48,852 INFO L226 Difference]: Without dead ends: 73 [2019-11-23 22:24:48,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:48,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-23 22:24:48,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-11-23 22:24:48,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-23 22:24:48,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2019-11-23 22:24:48,860 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 32 [2019-11-23 22:24:48,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:48,860 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2019-11-23 22:24:48,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:48,861 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2019-11-23 22:24:48,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 22:24:48,862 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:48,862 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:48,862 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:48,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:48,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1521721792, now seen corresponding path program 1 times [2019-11-23 22:24:48,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:48,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882040251] [2019-11-23 22:24:48,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:48,948 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:24:48,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882040251] [2019-11-23 22:24:48,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:48,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:24:48,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544260055] [2019-11-23 22:24:48,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:24:48,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:48,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:24:48,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:24:48,957 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand 4 states. [2019-11-23 22:24:49,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:49,014 INFO L93 Difference]: Finished difference Result 76 states and 104 transitions. [2019-11-23 22:24:49,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:24:49,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-23 22:24:49,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:49,016 INFO L225 Difference]: With dead ends: 76 [2019-11-23 22:24:49,016 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:24:49,016 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-23 22:24:49,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:24:49,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:24:49,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:24:49,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:24:49,018 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-11-23 22:24:49,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:49,018 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:24:49,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:24:49,018 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:24:49,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:24:49,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:24:49,141 INFO L444 ceAbstractionStarter]: For program point L36(lines 36 47) no Hoare annotation was computed. [2019-11-23 22:24:49,141 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 22:24:49,141 INFO L444 ceAbstractionStarter]: For program point L86(lines 86 101) no Hoare annotation was computed. [2019-11-23 22:24:49,141 INFO L444 ceAbstractionStarter]: For program point L53(lines 53 104) no Hoare annotation was computed. [2019-11-23 22:24:49,141 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 217) no Hoare annotation was computed. [2019-11-23 22:24:49,141 INFO L444 ceAbstractionStarter]: For program point L70(lines 70 85) no Hoare annotation was computed. [2019-11-23 22:24:49,142 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 333) no Hoare annotation was computed. [2019-11-23 22:24:49,142 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 201) no Hoare annotation was computed. [2019-11-23 22:24:49,142 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 69) no Hoare annotation was computed. [2019-11-23 22:24:49,142 INFO L440 ceAbstractionStarter]: At program point L335(lines 23 339) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~this_sink~0 0))) (or (and .cse0 (= ULTIMATE.start_main_~q~0 2)) (and (or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0)) (<= 3 ULTIMATE.start_main_~q~0)) (and .cse0 (= ULTIMATE.start_main_~q~0 0)))) [2019-11-23 22:24:49,142 INFO L444 ceAbstractionStarter]: For program point L302(lines 302 317) no Hoare annotation was computed. [2019-11-23 22:24:49,143 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 185) no Hoare annotation was computed. [2019-11-23 22:24:49,143 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 301) no Hoare annotation was computed. [2019-11-23 22:24:49,143 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 169) no Hoare annotation was computed. [2019-11-23 22:24:49,143 INFO L444 ceAbstractionStarter]: For program point L88(lines 88 99) no Hoare annotation was computed. [2019-11-23 22:24:49,143 INFO L444 ceAbstractionStarter]: For program point L270(lines 270 285) no Hoare annotation was computed. [2019-11-23 22:24:49,143 INFO L444 ceAbstractionStarter]: For program point L204(lines 204 215) no Hoare annotation was computed. [2019-11-23 22:24:49,143 INFO L444 ceAbstractionStarter]: For program point L138(lines 138 153) no Hoare annotation was computed. [2019-11-23 22:24:49,143 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 220) no Hoare annotation was computed. [2019-11-23 22:24:49,144 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 83) no Hoare annotation was computed. [2019-11-23 22:24:49,144 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 331) no Hoare annotation was computed. [2019-11-23 22:24:49,144 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 269) no Hoare annotation was computed. [2019-11-23 22:24:49,144 INFO L444 ceAbstractionStarter]: For program point L221(lines 221 336) no Hoare annotation was computed. [2019-11-23 22:24:49,144 INFO L444 ceAbstractionStarter]: For program point L188(lines 188 199) no Hoare annotation was computed. [2019-11-23 22:24:49,144 INFO L444 ceAbstractionStarter]: For program point L122(lines 122 137) no Hoare annotation was computed. [2019-11-23 22:24:49,144 INFO L444 ceAbstractionStarter]: For program point L56(lines 56 67) no Hoare annotation was computed. [2019-11-23 22:24:49,144 INFO L440 ceAbstractionStarter]: At program point L23-2(lines 23 339) the Hoare annotation is: (or (and (or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0)) (<= 3 ULTIMATE.start_main_~q~0)) (and (= ULTIMATE.start_main_~this_sink~0 0) (= ULTIMATE.start_main_~q~0 0))) [2019-11-23 22:24:49,145 INFO L444 ceAbstractionStarter]: For program point L23-3(lines 23 339) no Hoare annotation was computed. [2019-11-23 22:24:49,145 INFO L444 ceAbstractionStarter]: For program point L304(lines 304 315) no Hoare annotation was computed. [2019-11-23 22:24:49,145 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 253) no Hoare annotation was computed. [2019-11-23 22:24:49,145 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 183) no Hoare annotation was computed. [2019-11-23 22:24:49,145 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 121) no Hoare annotation was computed. [2019-11-23 22:24:49,145 INFO L444 ceAbstractionStarter]: For program point L40(lines 40 42) no Hoare annotation was computed. [2019-11-23 22:24:49,145 INFO L444 ceAbstractionStarter]: For program point L288(lines 288 299) no Hoare annotation was computed. [2019-11-23 22:24:49,146 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 237) no Hoare annotation was computed. [2019-11-23 22:24:49,146 INFO L444 ceAbstractionStarter]: For program point L156(lines 156 167) no Hoare annotation was computed. [2019-11-23 22:24:49,146 INFO L444 ceAbstractionStarter]: For program point L272(lines 272 283) no Hoare annotation was computed. [2019-11-23 22:24:49,146 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 151) no Hoare annotation was computed. [2019-11-23 22:24:49,146 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 22:24:49,146 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 267) no Hoare annotation was computed. [2019-11-23 22:24:49,146 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 135) no Hoare annotation was computed. [2019-11-23 22:24:49,147 INFO L444 ceAbstractionStarter]: For program point L240(lines 240 251) no Hoare annotation was computed. [2019-11-23 22:24:49,147 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 119) no Hoare annotation was computed. [2019-11-23 22:24:49,147 INFO L444 ceAbstractionStarter]: For program point L224(lines 224 235) no Hoare annotation was computed. [2019-11-23 22:24:49,147 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 94) no Hoare annotation was computed. [2019-11-23 22:24:49,147 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 210) no Hoare annotation was computed. [2019-11-23 22:24:49,147 INFO L444 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2019-11-23 22:24:49,147 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2019-11-23 22:24:49,147 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 194) no Hoare annotation was computed. [2019-11-23 22:24:49,148 INFO L444 ceAbstractionStarter]: For program point L60(lines 60 62) no Hoare annotation was computed. [2019-11-23 22:24:49,148 INFO L444 ceAbstractionStarter]: For program point L308(lines 308 310) no Hoare annotation was computed. [2019-11-23 22:24:49,148 INFO L444 ceAbstractionStarter]: For program point L176(lines 176 178) no Hoare annotation was computed. [2019-11-23 22:24:49,148 INFO L440 ceAbstractionStarter]: At program point L325(lines 13 344) the Hoare annotation is: false [2019-11-23 22:24:49,148 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 294) no Hoare annotation was computed. [2019-11-23 22:24:49,148 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 162) no Hoare annotation was computed. [2019-11-23 22:24:49,149 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 22:24:49,149 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 278) no Hoare annotation was computed. [2019-11-23 22:24:49,149 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 146) no Hoare annotation was computed. [2019-11-23 22:24:49,149 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 262) no Hoare annotation was computed. [2019-11-23 22:24:49,149 INFO L444 ceAbstractionStarter]: For program point L128(lines 128 130) no Hoare annotation was computed. [2019-11-23 22:24:49,149 INFO L444 ceAbstractionStarter]: For program point L244(lines 244 246) no Hoare annotation was computed. [2019-11-23 22:24:49,149 INFO L444 ceAbstractionStarter]: For program point L112(lines 112 114) no Hoare annotation was computed. [2019-11-23 22:24:49,150 INFO L447 ceAbstractionStarter]: At program point L13(lines 13 344) the Hoare annotation is: true [2019-11-23 22:24:49,150 INFO L444 ceAbstractionStarter]: For program point L228(lines 228 230) no Hoare annotation was computed. [2019-11-23 22:24:49,150 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 22:24:49,150 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 343) no Hoare annotation was computed. [2019-11-23 22:24:49,150 INFO L444 ceAbstractionStarter]: For program point L33(lines 33 52) no Hoare annotation was computed. [2019-11-23 22:24:49,150 INFO L444 ceAbstractionStarter]: For program point L34(lines 34 49) no Hoare annotation was computed. [2019-11-23 22:24:49,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:24:49 BoogieIcfgContainer [2019-11-23 22:24:49,165 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:24:49,167 INFO L168 Benchmark]: Toolchain (without parser) took 2514.40 ms. Allocated memory was 145.8 MB in the beginning and 235.9 MB in the end (delta: 90.2 MB). Free memory was 103.2 MB in the beginning and 166.0 MB in the end (delta: -62.8 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. [2019-11-23 22:24:49,168 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 22:24:49,170 INFO L168 Benchmark]: CACSL2BoogieTranslator took 435.89 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 103.0 MB in the beginning and 181.4 MB in the end (delta: -78.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2019-11-23 22:24:49,170 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.44 ms. Allocated memory is still 202.9 MB. Free memory was 181.4 MB in the beginning and 179.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:24:49,171 INFO L168 Benchmark]: Boogie Preprocessor took 30.53 ms. Allocated memory is still 202.9 MB. Free memory was 179.4 MB in the beginning and 177.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:24:49,172 INFO L168 Benchmark]: RCFGBuilder took 549.26 ms. Allocated memory is still 202.9 MB. Free memory was 177.4 MB in the beginning and 151.2 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-11-23 22:24:49,173 INFO L168 Benchmark]: TraceAbstraction took 1449.63 ms. Allocated memory was 202.9 MB in the beginning and 235.9 MB in the end (delta: 33.0 MB). Free memory was 150.6 MB in the beginning and 166.0 MB in the end (delta: -15.5 MB). Peak memory consumption was 17.6 MB. Max. memory is 7.1 GB. [2019-11-23 22:24:49,178 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.50 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 435.89 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 103.0 MB in the beginning and 181.4 MB in the end (delta: -78.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.44 ms. Allocated memory is still 202.9 MB. Free memory was 181.4 MB in the beginning and 179.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.53 ms. Allocated memory is still 202.9 MB. Free memory was 179.4 MB in the beginning and 177.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 549.26 ms. Allocated memory is still 202.9 MB. Free memory was 177.4 MB in the beginning and 151.2 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1449.63 ms. Allocated memory was 202.9 MB in the beginning and 235.9 MB in the end (delta: 33.0 MB). Free memory was 150.6 MB in the beginning and 166.0 MB in the end (delta: -15.5 MB). Peak memory consumption was 17.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 343]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((this_sink + 1 <= 0 || 1 <= this_sink) && 3 <= q) || (this_sink == 0 && q == 0) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((this_sink == 0 && q == 2) || ((this_sink + 1 <= 0 || 1 <= this_sink) && 3 <= q)) || (this_sink == 0 && q == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 68 locations, 1 error locations. Result: SAFE, OverallTime: 1.3s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 520 SDtfs, 190 SDslu, 262 SDs, 0 SdLazy, 88 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 12 NumberOfFragments, 51 HoareAnnotationTreeSize, 4 FomulaSimplifications, 34 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 9 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 7219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 27/27 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...