/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_security.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:24:45,657 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:24:45,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:24:45,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:24:45,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:24:45,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:24:45,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:24:45,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:24:45,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:24:45,678 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:24:45,679 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:24:45,680 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:24:45,681 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:24:45,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:24:45,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:24:45,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:24:45,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:24:45,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:24:45,687 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:24:45,689 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:24:45,691 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:24:45,692 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:24:45,693 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:24:45,694 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:24:45,696 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:24:45,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:24:45,697 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:24:45,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:24:45,698 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:24:45,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:24:45,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:24:45,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:24:45,701 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:24:45,701 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:24:45,702 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:24:45,703 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:24:45,703 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:24:45,704 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:24:45,704 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:24:45,705 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:24:45,705 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:24:45,706 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,720 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:24:45,720 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:24:45,722 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:24:45,722 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:24:45,722 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:24:45,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:24:45,722 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:24:45,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:24:45,723 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:24:45,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:24:45,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:24:45,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:24:45,724 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:24:45,724 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:24:45,724 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:24:45,724 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:24:45,724 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:24:45,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:24:45,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:24:45,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:24:45,725 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:24:45,726 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:24:45,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:24:45,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:24:45,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:24:45,726 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:24:45,727 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:24:45,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:24:45,727 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:24:45,727 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:24:46,009 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:24:46,030 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:24:46,036 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:24:46,038 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:24:46,038 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:24:46,039 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_security.c [2019-11-23 22:24:46,101 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23589b868/1f1a2a309be641bab6b64c4fe690d052/FLAG1369742df [2019-11-23 22:24:46,591 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:24:46,591 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_security.c [2019-11-23 22:24:46,603 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23589b868/1f1a2a309be641bab6b64c4fe690d052/FLAG1369742df [2019-11-23 22:24:46,942 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23589b868/1f1a2a309be641bab6b64c4fe690d052 [2019-11-23 22:24:46,954 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:24:46,956 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:24:46,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:24:46,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:24:46,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:24:46,963 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,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54d898d2 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,966 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,973 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:24:47,003 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:24:47,195 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:24:47,200 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:24:47,239 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:24:47,343 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:24:47,344 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,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:24:47,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:24:47,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:24:47,345 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:24:47,360 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,377 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,409 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:24:47,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:24:47,411 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:24:47,411 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:24:47,419 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,419 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,421 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,421 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,430 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,450 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,452 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,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:24:47,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:24:47,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:24:47,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:24:47,464 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,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:24:47,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:24:48,018 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:24:48,019 INFO L284 CfgBuilder]: Removed 22 assume(true) statements. [2019-11-23 22:24:48,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:24:48 BoogieIcfgContainer [2019-11-23 22:24:48,020 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:24:48,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:24:48,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:24:48,025 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:24:48,025 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:48,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fee928c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:24:48, skipping insertion in model container [2019-11-23 22:24:48,026 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:48,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fee928c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:24:48, skipping insertion in model container [2019-11-23 22:24:48,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:24:48" (3/3) ... [2019-11-23 22:24:48,028 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_security.c [2019-11-23 22:24:48,038 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:24:48,046 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:24:48,056 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:24:48,082 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:24:48,082 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:24:48,082 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:24:48,082 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:24:48,082 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:24:48,083 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:24:48,083 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:24:48,083 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:24:48,098 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2019-11-23 22:24:48,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-23 22:24:48,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:48,104 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:48,105 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:48,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:48,110 INFO L82 PathProgramCache]: Analyzing trace with hash 352571364, now seen corresponding path program 1 times [2019-11-23 22:24:48,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:48,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488555457] [2019-11-23 22:24:48,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:48,222 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,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488555457] [2019-11-23 22:24:48,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:48,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:24:48,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610979384] [2019-11-23 22:24:48,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 22:24:48,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:48,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 22:24:48,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 22:24:48,250 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2019-11-23 22:24:48,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:48,281 INFO L93 Difference]: Finished difference Result 154 states and 292 transitions. [2019-11-23 22:24:48,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 22:24:48,283 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-23 22:24:48,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:48,296 INFO L225 Difference]: With dead ends: 154 [2019-11-23 22:24:48,296 INFO L226 Difference]: Without dead ends: 74 [2019-11-23 22:24:48,300 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,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-23 22:24:48,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-23 22:24:48,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-23 22:24:48,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2019-11-23 22:24:48,350 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 9 [2019-11-23 22:24:48,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:48,350 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 109 transitions. [2019-11-23 22:24:48,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 22:24:48,351 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2019-11-23 22:24:48,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-23 22:24:48,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:48,352 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:48,352 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:48,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:48,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1422697708, now seen corresponding path program 1 times [2019-11-23 22:24:48,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:48,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39340392] [2019-11-23 22:24:48,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:48,388 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,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39340392] [2019-11-23 22:24:48,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:48,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:24:48,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974638081] [2019-11-23 22:24:48,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:48,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:48,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:48,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:48,393 INFO L87 Difference]: Start difference. First operand 74 states and 109 transitions. Second operand 3 states. [2019-11-23 22:24:48,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:48,464 INFO L93 Difference]: Finished difference Result 149 states and 220 transitions. [2019-11-23 22:24:48,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:48,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-23 22:24:48,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:48,467 INFO L225 Difference]: With dead ends: 149 [2019-11-23 22:24:48,467 INFO L226 Difference]: Without dead ends: 77 [2019-11-23 22:24:48,468 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,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-23 22:24:48,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-11-23 22:24:48,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-23 22:24:48,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 112 transitions. [2019-11-23 22:24:48,479 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 112 transitions. Word has length 10 [2019-11-23 22:24:48,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:48,480 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 112 transitions. [2019-11-23 22:24:48,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:48,480 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 112 transitions. [2019-11-23 22:24:48,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 22:24:48,481 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:48,481 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,482 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:48,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:48,482 INFO L82 PathProgramCache]: Analyzing trace with hash 658032583, now seen corresponding path program 1 times [2019-11-23 22:24:48,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:48,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665926792] [2019-11-23 22:24:48,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:48,546 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,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665926792] [2019-11-23 22:24:48,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:48,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:24:48,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221527294] [2019-11-23 22:24:48,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:48,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:48,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:48,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:48,549 INFO L87 Difference]: Start difference. First operand 77 states and 112 transitions. Second operand 3 states. [2019-11-23 22:24:48,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:48,631 INFO L93 Difference]: Finished difference Result 142 states and 209 transitions. [2019-11-23 22:24:48,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:48,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-23 22:24:48,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:48,633 INFO L225 Difference]: With dead ends: 142 [2019-11-23 22:24:48,633 INFO L226 Difference]: Without dead ends: 68 [2019-11-23 22:24:48,634 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,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-23 22:24:48,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-23 22:24:48,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-23 22:24:48,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2019-11-23 22:24:48,650 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 15 [2019-11-23 22:24:48,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:48,652 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2019-11-23 22:24:48,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:48,652 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2019-11-23 22:24:48,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 22:24:48,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:48,654 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:48,655 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:48,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:48,655 INFO L82 PathProgramCache]: Analyzing trace with hash 2066489199, now seen corresponding path program 1 times [2019-11-23 22:24:48,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:48,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771404108] [2019-11-23 22:24:48,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:48,721 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,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771404108] [2019-11-23 22:24:48,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:48,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:24:48,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627791192] [2019-11-23 22:24:48,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:48,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:48,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:48,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:48,724 INFO L87 Difference]: Start difference. First operand 68 states and 98 transitions. Second operand 3 states. [2019-11-23 22:24:48,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:48,839 INFO L93 Difference]: Finished difference Result 188 states and 276 transitions. [2019-11-23 22:24:48,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:48,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-23 22:24:48,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:48,842 INFO L225 Difference]: With dead ends: 188 [2019-11-23 22:24:48,842 INFO L226 Difference]: Without dead ends: 118 [2019-11-23 22:24:48,843 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,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-23 22:24:48,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 104. [2019-11-23 22:24:48,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-23 22:24:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 149 transitions. [2019-11-23 22:24:48,854 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 149 transitions. Word has length 18 [2019-11-23 22:24:48,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:48,855 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 149 transitions. [2019-11-23 22:24:48,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:48,855 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 149 transitions. [2019-11-23 22:24:48,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 22:24:48,856 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:48,857 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:48,857 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:48,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:48,857 INFO L82 PathProgramCache]: Analyzing trace with hash 290326405, now seen corresponding path program 1 times [2019-11-23 22:24:48,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:48,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954045265] [2019-11-23 22:24:48,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:48,883 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,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954045265] [2019-11-23 22:24:48,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:48,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:24:48,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163789940] [2019-11-23 22:24:48,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:48,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:48,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:48,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:48,886 INFO L87 Difference]: Start difference. First operand 104 states and 149 transitions. Second operand 3 states. [2019-11-23 22:24:48,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:48,952 INFO L93 Difference]: Finished difference Result 179 states and 256 transitions. [2019-11-23 22:24:48,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:48,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-23 22:24:48,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:48,954 INFO L225 Difference]: With dead ends: 179 [2019-11-23 22:24:48,955 INFO L226 Difference]: Without dead ends: 83 [2019-11-23 22:24:48,956 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,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-23 22:24:48,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-11-23 22:24:48,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-23 22:24:48,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 113 transitions. [2019-11-23 22:24:48,963 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 113 transitions. Word has length 19 [2019-11-23 22:24:48,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:48,964 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 113 transitions. [2019-11-23 22:24:48,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:48,964 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 113 transitions. [2019-11-23 22:24:48,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:24:48,965 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:48,966 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:48,966 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:48,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:48,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1696736468, now seen corresponding path program 1 times [2019-11-23 22:24:48,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:48,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894311229] [2019-11-23 22:24:48,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:49,003 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:24:49,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894311229] [2019-11-23 22:24:49,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:49,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:24:49,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509193689] [2019-11-23 22:24:49,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:49,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:49,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:49,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:49,008 INFO L87 Difference]: Start difference. First operand 81 states and 113 transitions. Second operand 3 states. [2019-11-23 22:24:49,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:49,051 INFO L93 Difference]: Finished difference Result 130 states and 186 transitions. [2019-11-23 22:24:49,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:49,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 22:24:49,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:49,052 INFO L225 Difference]: With dead ends: 130 [2019-11-23 22:24:49,052 INFO L226 Difference]: Without dead ends: 66 [2019-11-23 22:24:49,054 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:49,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-23 22:24:49,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-23 22:24:49,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-23 22:24:49,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2019-11-23 22:24:49,066 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 92 transitions. Word has length 25 [2019-11-23 22:24:49,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:49,067 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 92 transitions. [2019-11-23 22:24:49,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:49,068 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2019-11-23 22:24:49,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:24:49,069 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:49,069 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] [2019-11-23 22:24:49,070 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:49,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:49,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1712893632, now seen corresponding path program 1 times [2019-11-23 22:24:49,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:49,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072353766] [2019-11-23 22:24:49,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:49,138 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:49,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072353766] [2019-11-23 22:24:49,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:49,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:24:49,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277042248] [2019-11-23 22:24:49,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:49,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:49,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:49,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:49,144 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand 3 states. [2019-11-23 22:24:49,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:49,223 INFO L93 Difference]: Finished difference Result 154 states and 224 transitions. [2019-11-23 22:24:49,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:49,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-23 22:24:49,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:49,225 INFO L225 Difference]: With dead ends: 154 [2019-11-23 22:24:49,225 INFO L226 Difference]: Without dead ends: 107 [2019-11-23 22:24:49,227 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:49,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-23 22:24:49,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2019-11-23 22:24:49,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-23 22:24:49,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 134 transitions. [2019-11-23 22:24:49,241 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 134 transitions. Word has length 26 [2019-11-23 22:24:49,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:49,242 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 134 transitions. [2019-11-23 22:24:49,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:49,242 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 134 transitions. [2019-11-23 22:24:49,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:24:49,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:49,244 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] [2019-11-23 22:24:49,245 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:49,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:49,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1584038971, now seen corresponding path program 1 times [2019-11-23 22:24:49,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:49,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246953604] [2019-11-23 22:24:49,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:49,295 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:49,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246953604] [2019-11-23 22:24:49,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:49,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:24:49,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379515056] [2019-11-23 22:24:49,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:49,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:49,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:49,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:49,298 INFO L87 Difference]: Start difference. First operand 95 states and 134 transitions. Second operand 3 states. [2019-11-23 22:24:49,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:49,344 INFO L93 Difference]: Finished difference Result 162 states and 228 transitions. [2019-11-23 22:24:49,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:49,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 22:24:49,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:49,345 INFO L225 Difference]: With dead ends: 162 [2019-11-23 22:24:49,346 INFO L226 Difference]: Without dead ends: 88 [2019-11-23 22:24:49,346 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:49,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-23 22:24:49,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-11-23 22:24:49,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-23 22:24:49,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 116 transitions. [2019-11-23 22:24:49,360 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 116 transitions. Word has length 27 [2019-11-23 22:24:49,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:49,360 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 116 transitions. [2019-11-23 22:24:49,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:49,360 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 116 transitions. [2019-11-23 22:24:49,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:24:49,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:49,366 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] [2019-11-23 22:24:49,366 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:49,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:49,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1447684816, now seen corresponding path program 1 times [2019-11-23 22:24:49,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:49,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103344378] [2019-11-23 22:24:49,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:49,402 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:49,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103344378] [2019-11-23 22:24:49,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:49,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:24:49,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995963628] [2019-11-23 22:24:49,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:49,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:49,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:49,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:49,406 INFO L87 Difference]: Start difference. First operand 88 states and 116 transitions. Second operand 3 states. [2019-11-23 22:24:49,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:49,442 INFO L93 Difference]: Finished difference Result 135 states and 180 transitions. [2019-11-23 22:24:49,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:49,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 22:24:49,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:49,444 INFO L225 Difference]: With dead ends: 135 [2019-11-23 22:24:49,444 INFO L226 Difference]: Without dead ends: 68 [2019-11-23 22:24:49,445 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:49,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-23 22:24:49,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-23 22:24:49,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-23 22:24:49,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2019-11-23 22:24:49,450 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 27 [2019-11-23 22:24:49,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:49,450 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2019-11-23 22:24:49,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:49,450 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2019-11-23 22:24:49,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 22:24:49,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:49,451 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] [2019-11-23 22:24:49,452 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:49,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:49,452 INFO L82 PathProgramCache]: Analyzing trace with hash -573380405, now seen corresponding path program 1 times [2019-11-23 22:24:49,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:49,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036245619] [2019-11-23 22:24:49,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:49,484 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:49,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036245619] [2019-11-23 22:24:49,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:49,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:24:49,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019712992] [2019-11-23 22:24:49,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:49,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:49,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:49,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:49,487 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand 3 states. [2019-11-23 22:24:49,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:49,541 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2019-11-23 22:24:49,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:49,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-23 22:24:49,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:49,543 INFO L225 Difference]: With dead ends: 70 [2019-11-23 22:24:49,543 INFO L226 Difference]: Without dead ends: 66 [2019-11-23 22:24:49,544 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:49,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-23 22:24:49,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-23 22:24:49,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-23 22:24:49,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2019-11-23 22:24:49,554 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 28 [2019-11-23 22:24:49,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:49,555 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2019-11-23 22:24:49,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:49,558 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2019-11-23 22:24:49,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 22:24:49,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:49,559 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] [2019-11-23 22:24:49,559 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:49,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:49,559 INFO L82 PathProgramCache]: Analyzing trace with hash -583473182, now seen corresponding path program 1 times [2019-11-23 22:24:49,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:49,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822497399] [2019-11-23 22:24:49,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:49,599 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:49,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822497399] [2019-11-23 22:24:49,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:49,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:24:49,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830068354] [2019-11-23 22:24:49,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:49,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:49,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:49,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:49,601 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand 3 states. [2019-11-23 22:24:49,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:49,628 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2019-11-23 22:24:49,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:49,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-23 22:24:49,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:49,629 INFO L225 Difference]: With dead ends: 107 [2019-11-23 22:24:49,629 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:24:49,630 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:49,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:24:49,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:24:49,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:24:49,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:24:49,632 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-11-23 22:24:49,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:49,633 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:24:49,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:49,633 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:24:49,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:24:49,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:24:49,743 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 331) no Hoare annotation was computed. [2019-11-23 22:24:49,743 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 382) no Hoare annotation was computed. [2019-11-23 22:24:49,743 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 261) no Hoare annotation was computed. [2019-11-23 22:24:49,743 INFO L444 ceAbstractionStarter]: For program point L184(lines 184 199) no Hoare annotation was computed. [2019-11-23 22:24:49,744 INFO L444 ceAbstractionStarter]: For program point L118(lines 118 129) no Hoare annotation was computed. [2019-11-23 22:24:49,744 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 377) no Hoare annotation was computed. [2019-11-23 22:24:49,744 INFO L444 ceAbstractionStarter]: For program point L300(lines 300 315) no Hoare annotation was computed. [2019-11-23 22:24:49,744 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 245) no Hoare annotation was computed. [2019-11-23 22:24:49,744 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 113) no Hoare annotation was computed. [2019-11-23 22:24:49,744 INFO L444 ceAbstractionStarter]: For program point L350(lines 350 361) no Hoare annotation was computed. [2019-11-23 22:24:49,744 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 22:24:49,744 INFO L444 ceAbstractionStarter]: For program point L284(lines 284 299) no Hoare annotation was computed. [2019-11-23 22:24:49,744 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 229) no Hoare annotation was computed. [2019-11-23 22:24:49,745 INFO L444 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2019-11-23 22:24:49,745 INFO L444 ceAbstractionStarter]: For program point L334(lines 334 345) no Hoare annotation was computed. [2019-11-23 22:24:49,745 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 213) no Hoare annotation was computed. [2019-11-23 22:24:49,745 INFO L444 ceAbstractionStarter]: For program point L70(lines 70 72) no Hoare annotation was computed. [2019-11-23 22:24:49,746 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 329) no Hoare annotation was computed. [2019-11-23 22:24:49,746 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 197) no Hoare annotation was computed. [2019-11-23 22:24:49,746 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 56) no Hoare annotation was computed. [2019-11-23 22:24:49,746 INFO L444 ceAbstractionStarter]: For program point L302(lines 302 313) no Hoare annotation was computed. [2019-11-23 22:24:49,746 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 172) no Hoare annotation was computed. [2019-11-23 22:24:49,746 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 297) no Hoare annotation was computed. [2019-11-23 22:24:49,746 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 156) no Hoare annotation was computed. [2019-11-23 22:24:49,747 INFO L440 ceAbstractionStarter]: At program point L22-2(lines 22 385) the Hoare annotation is: (or (and (<= 4 ULTIMATE.start_main_~q~0) (= 3 ULTIMATE.start_main_~this_state~0)) (and (<= ULTIMATE.start_main_~this_state~0 0) (= ULTIMATE.start_main_~q~0 0))) [2019-11-23 22:24:49,747 INFO L444 ceAbstractionStarter]: For program point L22-3(lines 22 385) no Hoare annotation was computed. [2019-11-23 22:24:49,747 INFO L444 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2019-11-23 22:24:49,747 INFO L444 ceAbstractionStarter]: For program point L138(lines 138 140) no Hoare annotation was computed. [2019-11-23 22:24:49,747 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 256) no Hoare annotation was computed. [2019-11-23 22:24:49,747 INFO L444 ceAbstractionStarter]: For program point L122(lines 122 124) no Hoare annotation was computed. [2019-11-23 22:24:49,748 INFO L444 ceAbstractionStarter]: For program point L370(lines 370 372) no Hoare annotation was computed. [2019-11-23 22:24:49,748 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 240) no Hoare annotation was computed. [2019-11-23 22:24:49,748 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 108) no Hoare annotation was computed. [2019-11-23 22:24:49,748 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 356) no Hoare annotation was computed. [2019-11-23 22:24:49,748 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 224) no Hoare annotation was computed. [2019-11-23 22:24:49,748 INFO L440 ceAbstractionStarter]: At program point L371(lines 13 390) the Hoare annotation is: false [2019-11-23 22:24:49,748 INFO L444 ceAbstractionStarter]: For program point L338(lines 338 340) no Hoare annotation was computed. [2019-11-23 22:24:49,748 INFO L444 ceAbstractionStarter]: For program point L206(lines 206 208) no Hoare annotation was computed. [2019-11-23 22:24:49,749 INFO L444 ceAbstractionStarter]: For program point L322(lines 322 324) no Hoare annotation was computed. [2019-11-23 22:24:49,749 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 22:24:49,749 INFO L444 ceAbstractionStarter]: For program point L190(lines 190 192) no Hoare annotation was computed. [2019-11-23 22:24:49,750 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 308) no Hoare annotation was computed. [2019-11-23 22:24:49,750 INFO L444 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2019-11-23 22:24:49,750 INFO L444 ceAbstractionStarter]: For program point L27(lines 27 46) no Hoare annotation was computed. [2019-11-23 22:24:49,750 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 22:24:49,750 INFO L444 ceAbstractionStarter]: For program point L28(lines 28 43) no Hoare annotation was computed. [2019-11-23 22:24:49,750 INFO L447 ceAbstractionStarter]: At program point L13(lines 13 390) the Hoare annotation is: true [2019-11-23 22:24:49,750 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 41) no Hoare annotation was computed. [2019-11-23 22:24:49,751 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 95) no Hoare annotation was computed. [2019-11-23 22:24:49,751 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 98) no Hoare annotation was computed. [2019-11-23 22:24:49,751 INFO L444 ceAbstractionStarter]: For program point L64(lines 64 79) no Hoare annotation was computed. [2019-11-23 22:24:49,752 INFO L444 ceAbstractionStarter]: For program point L48(lines 48 63) no Hoare annotation was computed. [2019-11-23 22:24:49,752 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 179) no Hoare annotation was computed. [2019-11-23 22:24:49,752 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 22:24:49,752 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 389) no Hoare annotation was computed. [2019-11-23 22:24:49,752 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 163) no Hoare annotation was computed. [2019-11-23 22:24:49,753 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 93) no Hoare annotation was computed. [2019-11-23 22:24:49,753 INFO L444 ceAbstractionStarter]: For program point L264(lines 264 279) no Hoare annotation was computed. [2019-11-23 22:24:49,753 INFO L444 ceAbstractionStarter]: For program point L132(lines 132 147) no Hoare annotation was computed. [2019-11-23 22:24:49,754 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 182) no Hoare annotation was computed. [2019-11-23 22:24:49,754 INFO L444 ceAbstractionStarter]: For program point L66(lines 66 77) no Hoare annotation was computed. [2019-11-23 22:24:49,754 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 263) no Hoare annotation was computed. [2019-11-23 22:24:49,754 INFO L444 ceAbstractionStarter]: For program point L116(lines 116 131) no Hoare annotation was computed. [2019-11-23 22:24:49,755 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 61) no Hoare annotation was computed. [2019-11-23 22:24:49,756 INFO L444 ceAbstractionStarter]: For program point L364(lines 364 379) no Hoare annotation was computed. [2019-11-23 22:24:49,756 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 247) no Hoare annotation was computed. [2019-11-23 22:24:49,756 INFO L444 ceAbstractionStarter]: For program point L166(lines 166 177) no Hoare annotation was computed. [2019-11-23 22:24:49,756 INFO L444 ceAbstractionStarter]: For program point L100(lines 100 115) no Hoare annotation was computed. [2019-11-23 22:24:49,756 INFO L444 ceAbstractionStarter]: For program point L34(lines 34 36) no Hoare annotation was computed. [2019-11-23 22:24:49,756 INFO L440 ceAbstractionStarter]: At program point L381(lines 22 385) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~this_state~0 0))) (or (and (= ULTIMATE.start_main_~q~0 3) (= 2 ULTIMATE.start_main_~this_state~0)) (and (<= 4 ULTIMATE.start_main_~q~0) (= 3 ULTIMATE.start_main_~this_state~0)) (and .cse0 (= ULTIMATE.start_main_~q~0 2)) (and .cse0 (= ULTIMATE.start_main_~q~0 0)))) [2019-11-23 22:24:49,757 INFO L444 ceAbstractionStarter]: For program point L348(lines 348 363) no Hoare annotation was computed. [2019-11-23 22:24:49,757 INFO L444 ceAbstractionStarter]: For program point L216(lines 216 231) no Hoare annotation was computed. [2019-11-23 22:24:49,757 INFO L444 ceAbstractionStarter]: For program point L183(lines 183 282) no Hoare annotation was computed. [2019-11-23 22:24:49,757 INFO L444 ceAbstractionStarter]: For program point L150(lines 150 161) no Hoare annotation was computed. [2019-11-23 22:24:49,757 INFO L444 ceAbstractionStarter]: For program point L332(lines 332 347) no Hoare annotation was computed. [2019-11-23 22:24:49,757 INFO L444 ceAbstractionStarter]: For program point L266(lines 266 277) no Hoare annotation was computed. [2019-11-23 22:24:49,757 INFO L444 ceAbstractionStarter]: For program point L200(lines 200 215) no Hoare annotation was computed. [2019-11-23 22:24:49,757 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 145) no Hoare annotation was computed. [2019-11-23 22:24:49,783 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,783 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:24:49,786 INFO L168 Benchmark]: Toolchain (without parser) took 2828.92 ms. Allocated memory was 137.4 MB in the beginning and 233.3 MB in the end (delta: 95.9 MB). Free memory was 100.7 MB in the beginning and 112.7 MB in the end (delta: -12.0 MB). Peak memory consumption was 83.9 MB. Max. memory is 7.1 GB. [2019-11-23 22:24:49,787 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 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,792 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.95 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.5 MB in the beginning and 180.4 MB in the end (delta: -80.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:24:49,793 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.35 ms. Allocated memory is still 201.9 MB. Free memory was 180.4 MB in the beginning and 177.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-11-23 22:24:49,794 INFO L168 Benchmark]: Boogie Preprocessor took 45.58 ms. Allocated memory is still 201.9 MB. Free memory was 177.8 MB in the beginning and 176.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:24:49,797 INFO L168 Benchmark]: RCFGBuilder took 558.28 ms. Allocated memory is still 201.9 MB. Free memory was 176.4 MB in the beginning and 148.9 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. [2019-11-23 22:24:49,802 INFO L168 Benchmark]: TraceAbstraction took 1761.71 ms. Allocated memory was 201.9 MB in the beginning and 233.3 MB in the end (delta: 31.5 MB). Free memory was 148.3 MB in the beginning and 112.7 MB in the end (delta: 35.6 MB). Peak memory consumption was 67.1 MB. Max. memory is 7.1 GB. [2019-11-23 22:24:49,810 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.51 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 386.95 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.5 MB in the beginning and 180.4 MB in the end (delta: -80.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.35 ms. Allocated memory is still 201.9 MB. Free memory was 180.4 MB in the beginning and 177.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.58 ms. Allocated memory is still 201.9 MB. Free memory was 177.8 MB in the beginning and 176.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 558.28 ms. Allocated memory is still 201.9 MB. Free memory was 176.4 MB in the beginning and 148.9 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1761.71 ms. Allocated memory was 201.9 MB in the beginning and 233.3 MB in the end (delta: 31.5 MB). Free memory was 148.3 MB in the beginning and 112.7 MB in the end (delta: 35.6 MB). Peak memory consumption was 67.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 389]: 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: 13]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((q == 3 && 2 == this_state) || (4 <= q && 3 == this_state)) || (this_state <= 0 && q == 2)) || (this_state <= 0 && q == 0) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (4 <= q && 3 == this_state) || (this_state <= 0 && q == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 1 error locations. Result: SAFE, OverallTime: 1.6s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 963 SDtfs, 337 SDslu, 415 SDs, 0 SdLazy, 217 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 28 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 11 NumberOfFragments, 46 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 27 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 233 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 8086 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 55/55 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...