./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e 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/fibo_2calls_8_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 e21c3699338992ddad7e6d15f4351c8cc3315b0b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-91b1670 [2018-11-28 18:50:58,225 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:50:58,229 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:50:58,242 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:50:58,243 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:50:58,244 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:50:58,245 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:50:58,248 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:50:58,250 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:50:58,251 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:50:58,252 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:50:58,252 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:50:58,253 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:50:58,254 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:50:58,256 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:50:58,257 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:50:58,258 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:50:58,260 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:50:58,262 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:50:58,264 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:50:58,266 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:50:58,268 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:50:58,271 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:50:58,271 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:50:58,271 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:50:58,272 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:50:58,274 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:50:58,275 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:50:58,275 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:50:58,280 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:50:58,280 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:50:58,281 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:50:58,281 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:50:58,281 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:50:58,284 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:50:58,286 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:50:58,287 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 18:50:58,320 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:50:58,320 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:50:58,321 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:50:58,321 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:50:58,322 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:50:58,322 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:50:58,322 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:50:58,322 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:50:58,323 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:50:58,324 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:50:58,324 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:50:58,325 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:50:58,325 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:50:58,325 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:50:58,326 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:50:58,326 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:50:58,326 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:50:58,326 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:50:58,326 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:50:58,326 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:50:58,327 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:50:58,327 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:50:58,327 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:50:58,327 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:50:58,327 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:50:58,328 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:50:58,330 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:50:58,330 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:50:58,331 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:50:58,331 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:50:58,331 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 -> e21c3699338992ddad7e6d15f4351c8cc3315b0b [2018-11-28 18:50:58,377 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:50:58,391 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:50:58,395 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:50:58,397 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:50:58,397 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:50:58,398 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c [2018-11-28 18:50:58,462 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/072529c27/95f382380f114a75a3b0d9142bbadb93/FLAG602e22f86 [2018-11-28 18:50:58,960 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:50:58,961 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c [2018-11-28 18:50:58,969 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/072529c27/95f382380f114a75a3b0d9142bbadb93/FLAG602e22f86 [2018-11-28 18:50:59,283 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/072529c27/95f382380f114a75a3b0d9142bbadb93 [2018-11-28 18:50:59,288 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:50:59,289 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:50:59,291 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:50:59,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:50:59,295 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:50:59,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:50:59" (1/1) ... [2018-11-28 18:50:59,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e804404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:59, skipping insertion in model container [2018-11-28 18:50:59,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:50:59" (1/1) ... [2018-11-28 18:50:59,311 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:50:59,333 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:50:59,600 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:50:59,607 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:50:59,632 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:50:59,651 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:50:59,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:59 WrapperNode [2018-11-28 18:50:59,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:50:59,653 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:50:59,653 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:50:59,653 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:50:59,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:59" (1/1) ... [2018-11-28 18:50:59,669 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:59" (1/1) ... [2018-11-28 18:50:59,677 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:50:59,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:50:59,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:50:59,678 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:50:59,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:59" (1/1) ... [2018-11-28 18:50:59,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:59" (1/1) ... [2018-11-28 18:50:59,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:59" (1/1) ... [2018-11-28 18:50:59,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:59" (1/1) ... [2018-11-28 18:50:59,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:59" (1/1) ... [2018-11-28 18:50:59,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:59" (1/1) ... [2018-11-28 18:50:59,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:59" (1/1) ... [2018-11-28 18:50:59,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:50:59,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:50:59,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:50:59,704 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:50:59,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:59" (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 [2018-11-28 18:50:59,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:50:59,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:50:59,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:50:59,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:50:59,835 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:50:59,835 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:50:59,835 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-11-28 18:50:59,835 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-11-28 18:50:59,835 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-11-28 18:50:59,835 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-11-28 18:51:00,181 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:51:00,181 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 18:51:00,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:51:00 BoogieIcfgContainer [2018-11-28 18:51:00,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:51:00,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:51:00,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:51:00,187 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:51:00,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:50:59" (1/3) ... [2018-11-28 18:51:00,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7886b264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:51:00, skipping insertion in model container [2018-11-28 18:51:00,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:59" (2/3) ... [2018-11-28 18:51:00,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7886b264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:51:00, skipping insertion in model container [2018-11-28 18:51:00,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:51:00" (3/3) ... [2018-11-28 18:51:00,192 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8_false-unreach-call_true-termination.c [2018-11-28 18:51:00,203 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:51:00,213 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 18:51:00,231 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 18:51:00,264 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:51:00,265 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:51:00,265 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:51:00,265 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:51:00,266 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:51:00,266 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:51:00,266 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:51:00,266 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:51:00,266 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:51:00,286 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-28 18:51:00,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 18:51:00,292 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:00,293 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:00,295 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:00,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:00,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-11-28 18:51:00,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:00,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:00,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:00,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:00,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:00,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:51:00,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:51:00,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:51:00,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:51:00,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:51:00,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:51:00,565 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-11-28 18:51:00,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:00,745 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-28 18:51:00,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:51:00,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-28 18:51:00,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:00,757 INFO L225 Difference]: With dead ends: 44 [2018-11-28 18:51:00,758 INFO L226 Difference]: Without dead ends: 30 [2018-11-28 18:51:00,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:51:00,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-28 18:51:00,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-28 18:51:00,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 18:51:00,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-28 18:51:00,806 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-11-28 18:51:00,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:00,807 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-28 18:51:00,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:51:00,808 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-28 18:51:00,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 18:51:00,810 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:00,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:00,810 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:00,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:00,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-11-28 18:51:00,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:00,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:00,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:00,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:00,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:51:00,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:51:00,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:51:00,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:51:00,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:51:00,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:51:00,912 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-11-28 18:51:01,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:01,231 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-28 18:51:01,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:51:01,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-28 18:51:01,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:01,235 INFO L225 Difference]: With dead ends: 36 [2018-11-28 18:51:01,235 INFO L226 Difference]: Without dead ends: 32 [2018-11-28 18:51:01,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:51:01,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-28 18:51:01,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-28 18:51:01,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 18:51:01,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-28 18:51:01,248 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-11-28 18:51:01,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:01,249 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-28 18:51:01,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:51:01,249 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-28 18:51:01,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 18:51:01,251 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:01,252 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:01,252 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:01,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:01,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-11-28 18:51:01,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:01,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:01,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:01,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:01,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:01,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:51:01,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:01,384 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 [2018-11-28 18:51:01,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:01,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:01,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:51:01,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:01,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-11-28 18:51:01,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 18:51:01,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 18:51:01,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:51:01,638 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 9 states. [2018-11-28 18:51:02,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:02,373 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2018-11-28 18:51:02,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:51:02,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-11-28 18:51:02,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:02,378 INFO L225 Difference]: With dead ends: 58 [2018-11-28 18:51:02,378 INFO L226 Difference]: Without dead ends: 34 [2018-11-28 18:51:02,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-28 18:51:02,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-28 18:51:02,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-28 18:51:02,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 18:51:02,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-11-28 18:51:02,399 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2018-11-28 18:51:02,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:02,401 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-28 18:51:02,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 18:51:02,401 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2018-11-28 18:51:02,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 18:51:02,407 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:02,407 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:02,408 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:02,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:02,409 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2018-11-28 18:51:02,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:02,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:02,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:02,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:02,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:02,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:51:02,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:02,589 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 [2018-11-28 18:51:02,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:02,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:02,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:51:02,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:02,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-28 18:51:02,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 18:51:02,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 18:51:02,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:51:02,678 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 7 states. [2018-11-28 18:51:02,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:02,909 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2018-11-28 18:51:02,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:51:02,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-28 18:51:02,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:02,913 INFO L225 Difference]: With dead ends: 43 [2018-11-28 18:51:02,913 INFO L226 Difference]: Without dead ends: 39 [2018-11-28 18:51:02,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:51:02,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-28 18:51:02,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-28 18:51:02,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 18:51:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2018-11-28 18:51:02,928 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 27 [2018-11-28 18:51:02,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:02,928 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2018-11-28 18:51:02,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 18:51:02,929 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2018-11-28 18:51:02,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 18:51:02,930 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:02,931 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:02,931 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:02,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:02,931 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-11-28 18:51:02,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:02,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:02,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:02,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:02,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:03,098 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 18:51:03,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:03,098 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 [2018-11-28 18:51:03,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:03,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:03,272 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 18:51:03,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:03,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2018-11-28 18:51:03,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 18:51:03,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 18:51:03,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:51:03,300 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 10 states. [2018-11-28 18:51:03,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:03,699 INFO L93 Difference]: Finished difference Result 70 states and 100 transitions. [2018-11-28 18:51:03,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 18:51:03,700 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-11-28 18:51:03,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:03,703 INFO L225 Difference]: With dead ends: 70 [2018-11-28 18:51:03,703 INFO L226 Difference]: Without dead ends: 39 [2018-11-28 18:51:03,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-11-28 18:51:03,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-28 18:51:03,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-28 18:51:03,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 18:51:03,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2018-11-28 18:51:03,714 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 39 [2018-11-28 18:51:03,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:03,715 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-11-28 18:51:03,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 18:51:03,715 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2018-11-28 18:51:03,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 18:51:03,717 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:03,717 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:03,717 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:03,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:03,718 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2018-11-28 18:51:03,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:03,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:03,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:03,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:03,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:03,805 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 18:51:03,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:03,806 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 [2018-11-28 18:51:03,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:03,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:03,961 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 18:51:03,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:03,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2018-11-28 18:51:03,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 18:51:03,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 18:51:03,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:51:03,999 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 10 states. [2018-11-28 18:51:04,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:04,266 INFO L93 Difference]: Finished difference Result 61 states and 90 transitions. [2018-11-28 18:51:04,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:51:04,267 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-11-28 18:51:04,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:04,269 INFO L225 Difference]: With dead ends: 61 [2018-11-28 18:51:04,270 INFO L226 Difference]: Without dead ends: 57 [2018-11-28 18:51:04,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-28 18:51:04,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-28 18:51:04,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2018-11-28 18:51:04,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 18:51:04,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2018-11-28 18:51:04,284 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 40 [2018-11-28 18:51:04,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:04,284 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2018-11-28 18:51:04,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 18:51:04,285 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2018-11-28 18:51:04,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 18:51:04,287 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:04,287 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:04,287 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:04,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:04,288 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2018-11-28 18:51:04,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:04,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:04,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:04,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:04,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:04,406 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-28 18:51:04,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:04,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 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 [2018-11-28 18:51:04,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:04,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:04,545 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-28 18:51:04,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:04,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 10 [2018-11-28 18:51:04,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 18:51:04,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 18:51:04,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:51:04,569 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand 10 states. [2018-11-28 18:51:05,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:05,034 INFO L93 Difference]: Finished difference Result 71 states and 118 transitions. [2018-11-28 18:51:05,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:51:05,035 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-11-28 18:51:05,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:05,038 INFO L225 Difference]: With dead ends: 71 [2018-11-28 18:51:05,038 INFO L226 Difference]: Without dead ends: 67 [2018-11-28 18:51:05,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-28 18:51:05,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-28 18:51:05,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 49. [2018-11-28 18:51:05,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-28 18:51:05,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2018-11-28 18:51:05,055 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 54 [2018-11-28 18:51:05,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:05,055 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2018-11-28 18:51:05,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 18:51:05,056 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2018-11-28 18:51:05,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 18:51:05,059 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:05,059 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:05,060 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:05,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:05,060 INFO L82 PathProgramCache]: Analyzing trace with hash 671849284, now seen corresponding path program 2 times [2018-11-28 18:51:05,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:05,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:05,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:05,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:05,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:05,233 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 25 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-28 18:51:05,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:05,234 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 [2018-11-28 18:51:05,251 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:51:05,311 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:51:05,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:51:05,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:05,693 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 12 proven. 63 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-28 18:51:05,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:05,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-11-28 18:51:05,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 18:51:05,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 18:51:05,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-11-28 18:51:05,715 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand 16 states. [2018-11-28 18:51:06,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:06,596 INFO L93 Difference]: Finished difference Result 146 states and 299 transitions. [2018-11-28 18:51:06,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 18:51:06,597 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 80 [2018-11-28 18:51:06,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:06,603 INFO L225 Difference]: With dead ends: 146 [2018-11-28 18:51:06,603 INFO L226 Difference]: Without dead ends: 103 [2018-11-28 18:51:06,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2018-11-28 18:51:06,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-28 18:51:06,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 87. [2018-11-28 18:51:06,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-28 18:51:06,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 157 transitions. [2018-11-28 18:51:06,630 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 157 transitions. Word has length 80 [2018-11-28 18:51:06,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:06,631 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 157 transitions. [2018-11-28 18:51:06,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 18:51:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 157 transitions. [2018-11-28 18:51:06,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-28 18:51:06,639 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:06,639 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:06,639 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:06,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:06,641 INFO L82 PathProgramCache]: Analyzing trace with hash 2059253460, now seen corresponding path program 1 times [2018-11-28 18:51:06,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:06,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:06,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:06,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:51:06,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:07,001 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 66 proven. 113 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-11-28 18:51:07,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:07,002 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 [2018-11-28 18:51:07,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:07,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:07,748 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 29 proven. 176 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-11-28 18:51:07,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:07,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-11-28 18:51:07,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 18:51:07,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 18:51:07,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-11-28 18:51:07,772 INFO L87 Difference]: Start difference. First operand 87 states and 157 transitions. Second operand 18 states. [2018-11-28 18:51:08,606 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-28 18:51:09,095 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-11-28 18:51:09,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:09,868 INFO L93 Difference]: Finished difference Result 232 states and 520 transitions. [2018-11-28 18:51:09,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-28 18:51:09,872 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2018-11-28 18:51:09,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:09,876 INFO L225 Difference]: With dead ends: 232 [2018-11-28 18:51:09,877 INFO L226 Difference]: Without dead ends: 129 [2018-11-28 18:51:09,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 18:51:09,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-28 18:51:09,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 118. [2018-11-28 18:51:09,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-28 18:51:09,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 184 transitions. [2018-11-28 18:51:09,906 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 184 transitions. Word has length 135 [2018-11-28 18:51:09,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:09,907 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 184 transitions. [2018-11-28 18:51:09,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 18:51:09,907 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 184 transitions. [2018-11-28 18:51:09,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-11-28 18:51:09,914 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:09,915 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 16, 16, 16, 14, 12, 12, 12, 12, 12, 12, 12, 11, 8, 8, 8, 8, 8, 8, 8, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:09,915 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:09,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:09,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1547830767, now seen corresponding path program 1 times [2018-11-28 18:51:09,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:09,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:09,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:09,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:09,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:10,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2267 backedges. 142 proven. 366 refuted. 0 times theorem prover too weak. 1759 trivial. 0 not checked. [2018-11-28 18:51:10,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:10,300 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 [2018-11-28 18:51:10,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:10,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:10,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2267 backedges. 96 proven. 556 refuted. 0 times theorem prover too weak. 1615 trivial. 0 not checked. [2018-11-28 18:51:10,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:10,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 18 [2018-11-28 18:51:10,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 18:51:10,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 18:51:10,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-11-28 18:51:10,960 INFO L87 Difference]: Start difference. First operand 118 states and 184 transitions. Second operand 18 states. [2018-11-28 18:51:12,050 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-11-28 18:51:12,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:12,429 INFO L93 Difference]: Finished difference Result 290 states and 587 transitions. [2018-11-28 18:51:12,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-28 18:51:12,430 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 283 [2018-11-28 18:51:12,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:12,434 INFO L225 Difference]: With dead ends: 290 [2018-11-28 18:51:12,434 INFO L226 Difference]: Without dead ends: 179 [2018-11-28 18:51:12,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=235, Invalid=1171, Unknown=0, NotChecked=0, Total=1406 [2018-11-28 18:51:12,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-28 18:51:12,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 154. [2018-11-28 18:51:12,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-28 18:51:12,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 252 transitions. [2018-11-28 18:51:12,461 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 252 transitions. Word has length 283 [2018-11-28 18:51:12,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:12,461 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 252 transitions. [2018-11-28 18:51:12,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 18:51:12,461 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 252 transitions. [2018-11-28 18:51:12,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2018-11-28 18:51:12,470 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:12,471 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 30, 30, 28, 25, 17, 17, 17, 17, 17, 17, 17, 15, 15, 15, 15, 15, 15, 15, 13, 8, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:12,471 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:12,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:12,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1557586727, now seen corresponding path program 2 times [2018-11-28 18:51:12,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:12,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:12,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:12,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:12,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:12,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:12,949 INFO L134 CoverageAnalysis]: Checked inductivity of 5762 backedges. 342 proven. 511 refuted. 0 times theorem prover too weak. 4909 trivial. 0 not checked. [2018-11-28 18:51:12,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:12,949 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 [2018-11-28 18:51:12,959 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:51:13,092 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:51:13,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:51:13,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:13,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5762 backedges. 237 proven. 723 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2018-11-28 18:51:13,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:13,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-11-28 18:51:13,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 18:51:13,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 18:51:13,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-11-28 18:51:13,453 INFO L87 Difference]: Start difference. First operand 154 states and 252 transitions. Second operand 19 states. [2018-11-28 18:51:15,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:15,622 INFO L93 Difference]: Finished difference Result 415 states and 873 transitions. [2018-11-28 18:51:15,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-28 18:51:15,623 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 450 [2018-11-28 18:51:15,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:15,630 INFO L225 Difference]: With dead ends: 415 [2018-11-28 18:51:15,630 INFO L226 Difference]: Without dead ends: 260 [2018-11-28 18:51:15,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2018-11-28 18:51:15,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-11-28 18:51:15,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 201. [2018-11-28 18:51:15,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-28 18:51:15,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 378 transitions. [2018-11-28 18:51:15,685 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 378 transitions. Word has length 450 [2018-11-28 18:51:15,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:15,686 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 378 transitions. [2018-11-28 18:51:15,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 18:51:15,686 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 378 transitions. [2018-11-28 18:51:15,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2018-11-28 18:51:15,700 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:15,701 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 34, 34, 30, 30, 20, 20, 20, 20, 20, 20, 20, 17, 17, 17, 17, 17, 17, 17, 13, 11, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:15,701 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:15,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:15,702 INFO L82 PathProgramCache]: Analyzing trace with hash -795150218, now seen corresponding path program 3 times [2018-11-28 18:51:15,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:15,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:15,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:15,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:51:15,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:16,484 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-11-28 18:51:16,762 INFO L134 CoverageAnalysis]: Checked inductivity of 7698 backedges. 733 proven. 728 refuted. 0 times theorem prover too weak. 6237 trivial. 0 not checked. [2018-11-28 18:51:16,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:16,762 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:51:16,775 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 18:51:16,851 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-28 18:51:16,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:51:16,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:17,097 INFO L134 CoverageAnalysis]: Checked inductivity of 7698 backedges. 2373 proven. 31 refuted. 0 times theorem prover too weak. 5294 trivial. 0 not checked. [2018-11-28 18:51:17,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:17,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 19 [2018-11-28 18:51:17,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 18:51:17,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 18:51:17,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-11-28 18:51:17,120 INFO L87 Difference]: Start difference. First operand 201 states and 378 transitions. Second operand 19 states. [2018-11-28 18:51:18,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:18,116 INFO L93 Difference]: Finished difference Result 419 states and 889 transitions. [2018-11-28 18:51:18,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-28 18:51:18,122 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 517 [2018-11-28 18:51:18,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:18,127 INFO L225 Difference]: With dead ends: 419 [2018-11-28 18:51:18,128 INFO L226 Difference]: Without dead ends: 225 [2018-11-28 18:51:18,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 514 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=222, Invalid=1110, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 18:51:18,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-11-28 18:51:18,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 185. [2018-11-28 18:51:18,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-11-28 18:51:18,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 303 transitions. [2018-11-28 18:51:18,157 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 303 transitions. Word has length 517 [2018-11-28 18:51:18,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:18,158 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 303 transitions. [2018-11-28 18:51:18,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 18:51:18,158 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 303 transitions. [2018-11-28 18:51:18,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-11-28 18:51:18,163 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:18,163 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 22, 22, 20, 18, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 9, 6, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:18,164 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:18,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:18,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1086306760, now seen corresponding path program 4 times [2018-11-28 18:51:18,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:18,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:18,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:18,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:51:18,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:18,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2951 backedges. 426 proven. 141 refuted. 0 times theorem prover too weak. 2384 trivial. 0 not checked. [2018-11-28 18:51:18,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:18,412 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:51:18,438 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 18:51:18,511 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 18:51:18,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:51:18,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:18,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2951 backedges. 241 proven. 424 refuted. 0 times theorem prover too weak. 2286 trivial. 0 not checked. [2018-11-28 18:51:18,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:18,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 14 [2018-11-28 18:51:18,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 18:51:18,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 18:51:18,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-28 18:51:18,730 INFO L87 Difference]: Start difference. First operand 185 states and 303 transitions. Second operand 14 states. [2018-11-28 18:51:19,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:19,153 INFO L93 Difference]: Finished difference Result 204 states and 347 transitions. [2018-11-28 18:51:19,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 18:51:19,154 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 327 [2018-11-28 18:51:19,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:19,161 INFO L225 Difference]: With dead ends: 204 [2018-11-28 18:51:19,162 INFO L226 Difference]: Without dead ends: 200 [2018-11-28 18:51:19,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2018-11-28 18:51:19,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-28 18:51:19,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 195. [2018-11-28 18:51:19,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-28 18:51:19,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 333 transitions. [2018-11-28 18:51:19,194 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 333 transitions. Word has length 327 [2018-11-28 18:51:19,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:19,195 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 333 transitions. [2018-11-28 18:51:19,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 18:51:19,195 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 333 transitions. [2018-11-28 18:51:19,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-11-28 18:51:19,201 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:19,201 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 30, 30, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 12, 12, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:19,201 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:19,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:19,202 INFO L82 PathProgramCache]: Analyzing trace with hash -182763091, now seen corresponding path program 5 times [2018-11-28 18:51:19,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:19,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:19,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:19,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:51:19,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:19,695 INFO L134 CoverageAnalysis]: Checked inductivity of 7278 backedges. 1021 proven. 315 refuted. 0 times theorem prover too weak. 5942 trivial. 0 not checked. [2018-11-28 18:51:19,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:19,695 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:51:19,704 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 18:51:19,879 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2018-11-28 18:51:19,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:51:19,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 7278 backedges. 3959 proven. 234 refuted. 0 times theorem prover too weak. 3085 trivial. 0 not checked. [2018-11-28 18:51:20,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:20,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2018-11-28 18:51:20,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-28 18:51:20,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-28 18:51:20,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-28 18:51:20,320 INFO L87 Difference]: Start difference. First operand 195 states and 333 transitions. Second operand 22 states. [2018-11-28 18:51:21,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:21,774 INFO L93 Difference]: Finished difference Result 472 states and 908 transitions. [2018-11-28 18:51:21,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-28 18:51:21,775 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 505 [2018-11-28 18:51:21,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:21,780 INFO L225 Difference]: With dead ends: 472 [2018-11-28 18:51:21,780 INFO L226 Difference]: Without dead ends: 257 [2018-11-28 18:51:21,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 503 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=313, Invalid=1849, Unknown=0, NotChecked=0, Total=2162 [2018-11-28 18:51:21,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-11-28 18:51:21,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 225. [2018-11-28 18:51:21,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-11-28 18:51:21,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 370 transitions. [2018-11-28 18:51:21,808 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 370 transitions. Word has length 505 [2018-11-28 18:51:21,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:21,809 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 370 transitions. [2018-11-28 18:51:21,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-28 18:51:21,809 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 370 transitions. [2018-11-28 18:51:21,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2018-11-28 18:51:21,816 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:21,816 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 31, 30, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 13, 11, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:21,816 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:21,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:21,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1202625464, now seen corresponding path program 6 times [2018-11-28 18:51:21,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:21,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:21,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:21,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:51:21,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:22,382 INFO L134 CoverageAnalysis]: Checked inductivity of 7672 backedges. 957 proven. 763 refuted. 0 times theorem prover too weak. 5952 trivial. 0 not checked. [2018-11-28 18:51:22,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:22,382 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:51:22,392 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 18:51:22,743 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2018-11-28 18:51:22,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:51:22,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:23,515 INFO L134 CoverageAnalysis]: Checked inductivity of 7672 backedges. 812 proven. 127 refuted. 0 times theorem prover too weak. 6733 trivial. 0 not checked. [2018-11-28 18:51:23,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:23,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 20 [2018-11-28 18:51:23,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 18:51:23,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 18:51:23,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-11-28 18:51:23,540 INFO L87 Difference]: Start difference. First operand 225 states and 370 transitions. Second operand 20 states. [2018-11-28 18:51:25,381 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-11-28 18:51:26,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:26,247 INFO L93 Difference]: Finished difference Result 481 states and 865 transitions. [2018-11-28 18:51:26,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-28 18:51:26,248 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 518 [2018-11-28 18:51:26,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:26,253 INFO L225 Difference]: With dead ends: 481 [2018-11-28 18:51:26,253 INFO L226 Difference]: Without dead ends: 259 [2018-11-28 18:51:26,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=267, Invalid=1455, Unknown=0, NotChecked=0, Total=1722 [2018-11-28 18:51:26,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-11-28 18:51:26,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 235. [2018-11-28 18:51:26,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-11-28 18:51:26,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 378 transitions. [2018-11-28 18:51:26,282 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 378 transitions. Word has length 518 [2018-11-28 18:51:26,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:26,283 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 378 transitions. [2018-11-28 18:51:26,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 18:51:26,284 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 378 transitions. [2018-11-28 18:51:26,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-11-28 18:51:26,290 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:26,290 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:26,291 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:26,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:26,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1326629730, now seen corresponding path program 7 times [2018-11-28 18:51:26,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:26,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:26,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:26,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:51:26,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:51:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:51:26,445 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 18:51:26,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:51:26 BoogieIcfgContainer [2018-11-28 18:51:26,561 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:51:26,562 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:51:26,562 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:51:26,562 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:51:26,562 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:51:00" (3/4) ... [2018-11-28 18:51:26,566 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 18:51:26,744 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:51:26,744 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:51:26,747 INFO L168 Benchmark]: Toolchain (without parser) took 27458.71 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 558.4 MB). Free memory was 947.3 MB in the beginning and 852.9 MB in the end (delta: 94.4 MB). Peak memory consumption was 652.8 MB. Max. memory is 11.5 GB. [2018-11-28 18:51:26,748 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:51:26,748 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.65 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:51:26,748 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.55 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:51:26,749 INFO L168 Benchmark]: Boogie Preprocessor took 25.25 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:51:26,749 INFO L168 Benchmark]: RCFGBuilder took 478.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-28 18:51:26,749 INFO L168 Benchmark]: TraceAbstraction took 26377.81 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 425.7 MB). Free memory was 1.1 GB in the beginning and 867.7 MB in the end (delta: 243.2 MB). Peak memory consumption was 668.9 MB. Max. memory is 11.5 GB. [2018-11-28 18:51:26,750 INFO L168 Benchmark]: Witness Printer took 182.94 ms. Allocated memory is still 1.6 GB. Free memory was 867.7 MB in the beginning and 852.9 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-28 18:51:26,755 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 361.65 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 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 24.55 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.25 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 478.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26377.81 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 425.7 MB). Free memory was 1.1 GB in the beginning and 867.7 MB in the end (delta: 243.2 MB). Peak memory consumption was 668.9 MB. Max. memory is 11.5 GB. * Witness Printer took 182.94 ms. Allocated memory is still 1.6 GB. Free memory was 867.7 MB in the beginning and 852.9 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 8; VAL [x=8] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L18] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L20] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=21, x=8] [L37] int result = fibo1(x); [L38] COND TRUE result == 21 VAL [result=21, x=8] [L39] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 26.3s OverallTime, 16 OverallIterations, 41 TraceHistogramMax, 14.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 448 SDtfs, 900 SDslu, 2978 SDs, 0 SdLazy, 4788 SolverSat, 982 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3327 GetRequests, 2981 SyntacticMatches, 2 SemanticMatches, 344 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1968 ImplicationChecksByTransitivity, 10.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=235occurred in iteration=15, 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.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 249 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 6492 NumberOfCodeBlocks, 5706 NumberOfCodeBlocksAsserted, 76 NumberOfCheckSat, 6001 ConstructedInterpolants, 0 QuantifiedInterpolants, 2934195 SizeOfPredicates, 74 NumberOfNonLiveVariables, 4912 ConjunctsInSsa, 148 ConjunctsInUnsatCore, 28 InterpolantComputations, 2 PerfectInterpolantSequences, 63193/68554 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...