./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/sum_10x0_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/recursive-simple/sum_10x0_false-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 03b834537fd67eba3e98faa1fce1fca3851f5bba ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 15:09:29,188 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 15:09:29,190 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 15:09:29,204 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 15:09:29,204 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 15:09:29,206 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 15:09:29,207 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 15:09:29,209 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 15:09:29,211 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 15:09:29,212 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 15:09:29,213 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 15:09:29,214 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 15:09:29,215 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 15:09:29,216 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 15:09:29,217 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 15:09:29,218 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 15:09:29,220 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 15:09:29,222 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 15:09:29,225 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 15:09:29,227 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 15:09:29,228 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 15:09:29,230 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 15:09:29,233 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 15:09:29,233 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 15:09:29,233 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 15:09:29,234 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 15:09:29,235 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 15:09:29,236 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 15:09:29,237 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 15:09:29,239 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 15:09:29,239 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 15:09:29,239 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 15:09:29,240 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 15:09:29,240 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 15:09:29,241 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 15:09:29,242 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 15:09:29,243 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 15:09:29,263 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 15:09:29,263 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 15:09:29,264 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 15:09:29,266 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 15:09:29,266 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 15:09:29,266 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 15:09:29,266 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 15:09:29,267 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 15:09:29,267 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 15:09:29,267 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 15:09:29,267 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 15:09:29,267 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 15:09:29,267 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 15:09:29,268 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 15:09:29,268 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 15:09:29,268 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 15:09:29,268 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 15:09:29,269 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 15:09:29,269 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 15:09:29,269 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 15:09:29,269 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 15:09:29,269 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:09:29,269 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 15:09:29,270 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 15:09:29,271 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 15:09:29,271 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 15:09:29,271 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 15:09:29,271 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 15:09:29,271 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 03b834537fd67eba3e98faa1fce1fca3851f5bba [2019-01-12 15:09:29,331 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 15:09:29,349 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 15:09:29,356 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 15:09:29,358 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 15:09:29,358 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 15:09:29,359 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/sum_10x0_false-unreach-call_true-termination.c [2019-01-12 15:09:29,427 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f369fa0a/638ed34536864aecbb301735a39fcd22/FLAG63407e4c5 [2019-01-12 15:09:29,910 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 15:09:29,910 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/sum_10x0_false-unreach-call_true-termination.c [2019-01-12 15:09:29,917 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f369fa0a/638ed34536864aecbb301735a39fcd22/FLAG63407e4c5 [2019-01-12 15:09:30,246 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f369fa0a/638ed34536864aecbb301735a39fcd22 [2019-01-12 15:09:30,250 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 15:09:30,253 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 15:09:30,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 15:09:30,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 15:09:30,258 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 15:09:30,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:09:30" (1/1) ... [2019-01-12 15:09:30,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1edb4fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:09:30, skipping insertion in model container [2019-01-12 15:09:30,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:09:30" (1/1) ... [2019-01-12 15:09:30,274 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 15:09:30,297 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 15:09:30,511 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:09:30,517 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 15:09:30,538 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:09:30,557 INFO L195 MainTranslator]: Completed translation [2019-01-12 15:09:30,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:09:30 WrapperNode [2019-01-12 15:09:30,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 15:09:30,561 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 15:09:30,561 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 15:09:30,561 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 15:09:30,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:09:30" (1/1) ... [2019-01-12 15:09:30,578 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:09:30" (1/1) ... [2019-01-12 15:09:30,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 15:09:30,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 15:09:30,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 15:09:30,607 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 15:09:30,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:09:30" (1/1) ... [2019-01-12 15:09:30,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:09:30" (1/1) ... [2019-01-12 15:09:30,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:09:30" (1/1) ... [2019-01-12 15:09:30,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:09:30" (1/1) ... [2019-01-12 15:09:30,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:09:30" (1/1) ... [2019-01-12 15:09:30,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:09:30" (1/1) ... [2019-01-12 15:09:30,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:09:30" (1/1) ... [2019-01-12 15:09:30,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 15:09:30,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 15:09:30,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 15:09:30,635 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 15:09:30,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:09:30" (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-01-12 15:09:30,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 15:09:30,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 15:09:30,763 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2019-01-12 15:09:30,763 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2019-01-12 15:09:30,982 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 15:09:30,983 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 15:09:30,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:09:30 BoogieIcfgContainer [2019-01-12 15:09:30,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 15:09:30,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 15:09:30,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 15:09:30,989 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 15:09:30,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:09:30" (1/3) ... [2019-01-12 15:09:30,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c50876e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:09:30, skipping insertion in model container [2019-01-12 15:09:30,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:09:30" (2/3) ... [2019-01-12 15:09:30,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c50876e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:09:30, skipping insertion in model container [2019-01-12 15:09:30,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:09:30" (3/3) ... [2019-01-12 15:09:30,992 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_10x0_false-unreach-call_true-termination.c [2019-01-12 15:09:31,003 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 15:09:31,011 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 15:09:31,027 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 15:09:31,058 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 15:09:31,059 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 15:09:31,059 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 15:09:31,059 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 15:09:31,059 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 15:09:31,059 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 15:09:31,059 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 15:09:31,060 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 15:09:31,060 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 15:09:31,078 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-12 15:09:31,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 15:09:31,085 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:31,086 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:31,089 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:31,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:31,095 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-01-12 15:09:31,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:31,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:31,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:31,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:09:31,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:31,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:09:31,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:09:31,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:09:31,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:09:31,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:09:31,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:09:31,446 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 5 states. [2019-01-12 15:09:31,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:31,566 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-01-12 15:09:31,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:09:31,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-12 15:09:31,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:31,578 INFO L225 Difference]: With dead ends: 24 [2019-01-12 15:09:31,579 INFO L226 Difference]: Without dead ends: 14 [2019-01-12 15:09:31,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 15:09:31,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-12 15:09:31,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-12 15:09:31,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-12 15:09:31,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-01-12 15:09:31,623 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-01-12 15:09:31,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:31,623 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-01-12 15:09:31,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:09:31,624 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-01-12 15:09:31,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 15:09:31,625 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:31,626 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:31,626 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:31,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:31,627 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-01-12 15:09:31,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:31,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:31,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:31,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:09:31,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:31,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 15:09:31,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:31,742 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:31,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:09:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:31,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:31,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 15:09:31,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:31,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-12 15:09:31,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 15:09:31,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 15:09:31,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 15:09:31,887 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 6 states. [2019-01-12 15:09:32,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:32,189 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-01-12 15:09:32,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:09:32,191 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-12 15:09:32,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:32,192 INFO L225 Difference]: With dead ends: 21 [2019-01-12 15:09:32,192 INFO L226 Difference]: Without dead ends: 17 [2019-01-12 15:09:32,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:09:32,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-12 15:09:32,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-12 15:09:32,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-12 15:09:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-12 15:09:32,199 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-01-12 15:09:32,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:32,199 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-12 15:09:32,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 15:09:32,200 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-12 15:09:32,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 15:09:32,201 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:32,201 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:32,201 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:32,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:32,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-01-12 15:09:32,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:32,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:32,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:32,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:09:32,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:32,479 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 15:09:32,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:32,480 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:32,490 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:09:32,521 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:09:32,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:09:32,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:32,545 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 15:09:32,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:32,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-12 15:09:32,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 15:09:32,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 15:09:32,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:09:32,566 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2019-01-12 15:09:32,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:32,783 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-01-12 15:09:32,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 15:09:32,787 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-12 15:09:32,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:32,788 INFO L225 Difference]: With dead ends: 24 [2019-01-12 15:09:32,788 INFO L226 Difference]: Without dead ends: 20 [2019-01-12 15:09:32,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 15:09:32,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-12 15:09:32,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-12 15:09:32,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-12 15:09:32,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-12 15:09:32,795 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-01-12 15:09:32,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:32,795 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-12 15:09:32,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 15:09:32,796 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-12 15:09:32,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 15:09:32,797 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:32,797 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:32,797 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:32,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:32,798 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-01-12 15:09:32,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:32,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:32,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:32,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:09:32,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:32,950 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 15:09:32,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:32,951 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:32,963 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:09:32,994 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-12 15:09:32,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:09:32,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:33,027 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 15:09:33,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:33,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-12 15:09:33,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 15:09:33,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 15:09:33,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:09:33,051 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 8 states. [2019-01-12 15:09:33,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:33,518 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-12 15:09:33,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 15:09:33,519 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-01-12 15:09:33,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:33,521 INFO L225 Difference]: With dead ends: 27 [2019-01-12 15:09:33,521 INFO L226 Difference]: Without dead ends: 23 [2019-01-12 15:09:33,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-12 15:09:33,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-12 15:09:33,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-12 15:09:33,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-12 15:09:33,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-12 15:09:33,534 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-01-12 15:09:33,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:33,534 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-12 15:09:33,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 15:09:33,535 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-12 15:09:33,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 15:09:33,538 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:33,538 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:33,539 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:33,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:33,539 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-01-12 15:09:33,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:33,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:33,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:33,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:09:33,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:33,723 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-12 15:09:33,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:33,724 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:33,742 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:09:33,762 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:09:33,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:09:33,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:33,786 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-12 15:09:33,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:33,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-12 15:09:33,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 15:09:33,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 15:09:33,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-12 15:09:33,807 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2019-01-12 15:09:33,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:33,968 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-01-12 15:09:33,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 15:09:33,968 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-01-12 15:09:33,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:33,970 INFO L225 Difference]: With dead ends: 30 [2019-01-12 15:09:33,970 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 15:09:33,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-12 15:09:33,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 15:09:33,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 15:09:33,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 15:09:33,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-01-12 15:09:33,977 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-01-12 15:09:33,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:33,978 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-01-12 15:09:33,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 15:09:33,978 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-01-12 15:09:33,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 15:09:33,979 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:33,980 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:33,980 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:33,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:33,980 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-01-12 15:09:33,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:33,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:33,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:33,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:09:33,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:34,210 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-12 15:09:34,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:34,211 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:34,227 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:09:34,331 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-12 15:09:34,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:09:34,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:34,382 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-12 15:09:34,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:34,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-12 15:09:34,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 15:09:34,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 15:09:34,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 15:09:34,412 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 10 states. [2019-01-12 15:09:34,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:34,598 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-01-12 15:09:34,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 15:09:34,599 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-01-12 15:09:34,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:34,600 INFO L225 Difference]: With dead ends: 33 [2019-01-12 15:09:34,600 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 15:09:34,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-12 15:09:34,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 15:09:34,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-12 15:09:34,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 15:09:34,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-12 15:09:34,607 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-01-12 15:09:34,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:34,608 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-12 15:09:34,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 15:09:34,608 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-12 15:09:34,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-12 15:09:34,610 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:34,610 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:34,610 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:34,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:34,611 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-01-12 15:09:34,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:34,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:34,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:34,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:09:34,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:34,867 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-12 15:09:34,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:34,868 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:34,878 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:09:34,921 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-12 15:09:34,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:09:34,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:34,957 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-12 15:09:34,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:34,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-01-12 15:09:34,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 15:09:34,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 15:09:34,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-12 15:09:34,980 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 11 states. [2019-01-12 15:09:35,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:35,217 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-01-12 15:09:35,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 15:09:35,218 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2019-01-12 15:09:35,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:35,221 INFO L225 Difference]: With dead ends: 36 [2019-01-12 15:09:35,221 INFO L226 Difference]: Without dead ends: 32 [2019-01-12 15:09:35,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-12 15:09:35,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-12 15:09:35,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-12 15:09:35,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-12 15:09:35,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-01-12 15:09:35,228 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-01-12 15:09:35,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:35,229 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-01-12 15:09:35,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 15:09:35,229 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-01-12 15:09:35,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 15:09:35,231 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:35,231 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:35,231 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:35,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:35,232 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-01-12 15:09:35,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:35,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:35,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:35,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:09:35,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:35,406 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-01-12 15:09:35,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:35,406 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:35,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:09:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:35,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:35,489 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-01-12 15:09:35,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:35,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-12 15:09:35,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 15:09:35,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 15:09:35,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-12 15:09:35,510 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 12 states. [2019-01-12 15:09:35,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:35,882 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-01-12 15:09:35,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 15:09:35,884 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-01-12 15:09:35,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:35,887 INFO L225 Difference]: With dead ends: 39 [2019-01-12 15:09:35,887 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 15:09:35,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-12 15:09:35,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 15:09:35,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-12 15:09:35,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-12 15:09:35,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-12 15:09:35,895 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-01-12 15:09:35,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:35,896 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-12 15:09:35,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 15:09:35,896 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-12 15:09:35,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-12 15:09:35,898 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:35,898 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:35,898 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:35,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:35,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-01-12 15:09:35,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:35,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:35,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:35,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:09:35,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:36,572 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-12 15:09:36,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:36,573 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:36,583 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:09:36,609 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:09:36,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:09:36,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:36,649 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-12 15:09:36,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:36,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-01-12 15:09:36,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 15:09:36,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 15:09:36,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-12 15:09:36,672 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 13 states. [2019-01-12 15:09:36,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:36,882 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-01-12 15:09:36,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 15:09:36,883 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-01-12 15:09:36,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:36,885 INFO L225 Difference]: With dead ends: 42 [2019-01-12 15:09:36,885 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 15:09:36,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2019-01-12 15:09:36,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 15:09:36,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-12 15:09:36,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-12 15:09:36,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-01-12 15:09:36,893 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2019-01-12 15:09:36,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:36,893 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-01-12 15:09:36,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 15:09:36,894 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-01-12 15:09:36,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 15:09:36,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:36,895 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:36,895 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:36,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:36,896 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2019-01-12 15:09:36,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:36,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:36,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:36,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:09:36,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:37,224 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-01-12 15:09:37,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:37,225 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:37,237 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:09:37,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-12 15:09:37,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:09:37,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:37,350 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-01-12 15:09:37,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:37,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-01-12 15:09:37,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 15:09:37,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 15:09:37,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-12 15:09:37,372 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 14 states. [2019-01-12 15:09:37,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:37,582 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-01-12 15:09:37,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 15:09:37,583 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2019-01-12 15:09:37,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:37,584 INFO L225 Difference]: With dead ends: 45 [2019-01-12 15:09:37,585 INFO L226 Difference]: Without dead ends: 41 [2019-01-12 15:09:37,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2019-01-12 15:09:37,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-12 15:09:37,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-12 15:09:37,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-12 15:09:37,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-12 15:09:37,593 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2019-01-12 15:09:37,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:37,593 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-12 15:09:37,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 15:09:37,594 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-12 15:09:37,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 15:09:37,595 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:37,595 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:37,595 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:37,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:37,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2019-01-12 15:09:37,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:37,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:37,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:37,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:09:37,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 15:09:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 15:09:37,648 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 15:09:37,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:09:37 BoogieIcfgContainer [2019-01-12 15:09:37,686 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 15:09:37,687 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 15:09:37,687 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 15:09:37,687 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 15:09:37,688 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:09:30" (3/4) ... [2019-01-12 15:09:37,692 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 15:09:37,785 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 15:09:37,789 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 15:09:37,792 INFO L168 Benchmark]: Toolchain (without parser) took 7540.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.7 MB). Free memory was 948.7 MB in the beginning and 1.0 GB in the end (delta: -92.2 MB). Peak memory consumption was 96.6 MB. Max. memory is 11.5 GB. [2019-01-12 15:09:37,796 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:09:37,797 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.48 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 15:09:37,801 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.02 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:09:37,805 INFO L168 Benchmark]: Boogie Preprocessor took 28.04 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:09:37,806 INFO L168 Benchmark]: RCFGBuilder took 349.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-01-12 15:09:37,806 INFO L168 Benchmark]: TraceAbstraction took 6700.80 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.3 MB). Peak memory consumption was 113.8 MB. Max. memory is 11.5 GB. [2019-01-12 15:09:37,808 INFO L168 Benchmark]: Witness Printer took 103.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2019-01-12 15:09:37,818 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 306.48 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.02 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.04 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 349.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6700.80 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.3 MB). Peak memory consumption was 113.8 MB. Max. memory is 11.5 GB. * Witness Printer took 103.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 10; [L13] int b = 0; [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=10, m=0, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=9, m=1, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=8, m=2, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=7, m=3, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=6, m=4, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=5, m=5, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=4, m=6, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=3, m=7, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=2, m=8, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=1, m=9, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=10, \old(n)=0, \result=10, m=10, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=1, m=9, n=1, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=2, m=8, n=2, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=3, m=7, n=3, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=4, m=6, n=4, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=5, m=5, n=5, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=6, m=4, n=6, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=7, m=3, n=7, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=8, m=2, n=8, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=9, m=1, n=9, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=10, m=0, n=10, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) [L14] int result = sum(a, b); [L15] COND TRUE result == a + b [L16] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. UNSAFE Result, 6.6s OverallTime, 11 OverallIterations, 11 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 82 SDtfs, 164 SDslu, 319 SDs, 0 SdLazy, 458 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 537 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 780 NumberOfCodeBlocks, 775 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 692 ConstructedInterpolants, 0 QuantifiedInterpolants, 77312 SizeOfPredicates, 63 NumberOfNonLiveVariables, 1051 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 900/1800 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...