./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Fibonacci05.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 18ab16c8226f43cf595901df83a1f895912e466b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-29 16:17:40,876 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-29 16:17:40,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-29 16:17:40,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-29 16:17:40,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-29 16:17:40,923 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-29 16:17:40,925 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-29 16:17:40,931 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-29 16:17:40,934 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-29 16:17:40,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-29 16:17:40,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-29 16:17:40,945 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-29 16:17:40,946 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-29 16:17:40,949 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-29 16:17:40,950 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-29 16:17:40,954 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-29 16:17:40,956 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-29 16:17:40,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-29 16:17:40,959 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-29 16:17:40,966 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-29 16:17:40,968 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-29 16:17:40,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-29 16:17:40,971 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-29 16:17:40,972 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-29 16:17:40,978 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-29 16:17:40,978 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-29 16:17:40,979 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-29 16:17:40,980 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-29 16:17:40,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-29 16:17:40,981 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-29 16:17:40,982 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-29 16:17:40,982 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-29 16:17:40,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-29 16:17:40,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-29 16:17:40,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-29 16:17:40,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-29 16:17:40,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-29 16:17:40,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-29 16:17:40,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-29 16:17:40,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-29 16:17:40,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-29 16:17:40,990 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-29 16:17:41,023 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-29 16:17:41,023 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-29 16:17:41,025 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-29 16:17:41,025 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-29 16:17:41,027 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-29 16:17:41,027 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-29 16:17:41,027 INFO L138 SettingsManager]: * Use SBE=true [2021-08-29 16:17:41,027 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-29 16:17:41,027 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-29 16:17:41,028 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-29 16:17:41,028 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-29 16:17:41,029 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-29 16:17:41,029 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-29 16:17:41,029 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-29 16:17:41,029 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-29 16:17:41,029 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-29 16:17:41,029 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-29 16:17:41,030 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-29 16:17:41,030 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-29 16:17:41,030 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-29 16:17:41,030 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-29 16:17:41,030 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-29 16:17:41,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 16:17:41,041 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-29 16:17:41,041 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-29 16:17:41,041 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-29 16:17:41,041 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-29 16:17:41,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-29 16:17:41,042 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-29 16:17:41,042 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-29 16:17:41,042 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> 18ab16c8226f43cf595901df83a1f895912e466b [2021-08-29 16:17:41,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-29 16:17:41,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-29 16:17:41,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-29 16:17:41,387 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-29 16:17:41,387 INFO L275 PluginConnector]: CDTParser initialized [2021-08-29 16:17:41,389 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci05.c [2021-08-29 16:17:41,461 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24ddf2352/5ceebd0a6f64463db76a0590c4de3abb/FLAGff366f9eb [2021-08-29 16:17:41,883 INFO L306 CDTParser]: Found 1 translation units. [2021-08-29 16:17:41,883 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c [2021-08-29 16:17:41,889 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24ddf2352/5ceebd0a6f64463db76a0590c4de3abb/FLAGff366f9eb [2021-08-29 16:17:42,298 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24ddf2352/5ceebd0a6f64463db76a0590c4de3abb [2021-08-29 16:17:42,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-29 16:17:42,305 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-29 16:17:42,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-29 16:17:42,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-29 16:17:42,311 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-29 16:17:42,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 04:17:42" (1/1) ... [2021-08-29 16:17:42,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@564ff51a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:17:42, skipping insertion in model container [2021-08-29 16:17:42,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 04:17:42" (1/1) ... [2021-08-29 16:17:42,318 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-29 16:17:42,328 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-29 16:17:42,430 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2021-08-29 16:17:42,433 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 16:17:42,451 INFO L203 MainTranslator]: Completed pre-run [2021-08-29 16:17:42,463 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2021-08-29 16:17:42,464 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 16:17:42,474 INFO L208 MainTranslator]: Completed translation [2021-08-29 16:17:42,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:17:42 WrapperNode [2021-08-29 16:17:42,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-29 16:17:42,476 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-29 16:17:42,476 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-29 16:17:42,476 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-29 16:17:42,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:17:42" (1/1) ... [2021-08-29 16:17:42,487 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:17:42" (1/1) ... [2021-08-29 16:17:42,523 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-29 16:17:42,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-29 16:17:42,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-29 16:17:42,526 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-29 16:17:42,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:17:42" (1/1) ... [2021-08-29 16:17:42,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:17:42" (1/1) ... [2021-08-29 16:17:42,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:17:42" (1/1) ... [2021-08-29 16:17:42,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:17:42" (1/1) ... [2021-08-29 16:17:42,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:17:42" (1/1) ... [2021-08-29 16:17:42,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:17:42" (1/1) ... [2021-08-29 16:17:42,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:17:42" (1/1) ... [2021-08-29 16:17:42,556 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-29 16:17:42,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-29 16:17:42,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-29 16:17:42,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-29 16:17:42,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:17:42" (1/1) ... [2021-08-29 16:17:42,566 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 16:17:42,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 16:17:42,594 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-29 16:17:42,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-29 16:17:42,632 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2021-08-29 16:17:42,632 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2021-08-29 16:17:42,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-29 16:17:42,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-29 16:17:42,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-29 16:17:42,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-29 16:17:42,810 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-29 16:17:42,811 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-08-29 16:17:42,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 04:17:42 BoogieIcfgContainer [2021-08-29 16:17:42,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-29 16:17:42,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-29 16:17:42,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-29 16:17:42,818 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-29 16:17:42,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 04:17:42" (1/3) ... [2021-08-29 16:17:42,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@198ad236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 04:17:42, skipping insertion in model container [2021-08-29 16:17:42,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:17:42" (2/3) ... [2021-08-29 16:17:42,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@198ad236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 04:17:42, skipping insertion in model container [2021-08-29 16:17:42,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 04:17:42" (3/3) ... [2021-08-29 16:17:42,822 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2021-08-29 16:17:42,828 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-29 16:17:42,828 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-29 16:17:42,881 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-29 16:17:42,896 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-29 16:17:42,896 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-29 16:17:42,914 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-29 16:17:42,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-29 16:17:42,931 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:17:42,932 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:17:42,932 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:17:42,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:17:42,939 INFO L82 PathProgramCache]: Analyzing trace with hash 117289724, now seen corresponding path program 1 times [2021-08-29 16:17:42,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:17:42,946 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215826987] [2021-08-29 16:17:42,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:17:42,947 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:17:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:43,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-29 16:17:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:17:43,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:17:43,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215826987] [2021-08-29 16:17:43,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215826987] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:17:43,234 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:17:43,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 16:17:43,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926656386] [2021-08-29 16:17:43,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 16:17:43,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:17:43,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 16:17:43,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:17:43,288 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-29 16:17:43,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:17:43,428 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2021-08-29 16:17:43,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 16:17:43,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-08-29 16:17:43,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:17:43,440 INFO L225 Difference]: With dead ends: 31 [2021-08-29 16:17:43,440 INFO L226 Difference]: Without dead ends: 18 [2021-08-29 16:17:43,442 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 57.47ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-29 16:17:43,446 INFO L928 BasicCegarLoop]: 3 mSDtfsCounter, 11 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 78.38ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.93ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 100.00ms IncrementalHoareTripleChecker+Time [2021-08-29 16:17:43,447 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 4 Invalid, 73 Unknown, 0 Unchecked, 1.93ms Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 100.00ms Time] [2021-08-29 16:17:43,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-08-29 16:17:43,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-08-29 16:17:43,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-29 16:17:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-08-29 16:17:43,478 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2021-08-29 16:17:43,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:17:43,478 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-08-29 16:17:43,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-29 16:17:43,479 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-08-29 16:17:43,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-29 16:17:43,480 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:17:43,480 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:17:43,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-29 16:17:43,481 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:17:43,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:17:43,482 INFO L82 PathProgramCache]: Analyzing trace with hash 36927066, now seen corresponding path program 1 times [2021-08-29 16:17:43,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:17:43,482 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341325202] [2021-08-29 16:17:43,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:17:43,482 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:17:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:43,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-29 16:17:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:43,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:17:43,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:17:43,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341325202] [2021-08-29 16:17:43,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341325202] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:17:43,532 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:17:43,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 16:17:43,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744745936] [2021-08-29 16:17:43,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 16:17:43,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:17:43,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 16:17:43,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:17:43,535 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-29 16:17:43,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:17:43,604 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2021-08-29 16:17:43,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 16:17:43,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-08-29 16:17:43,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:17:43,608 INFO L225 Difference]: With dead ends: 24 [2021-08-29 16:17:43,608 INFO L226 Difference]: Without dead ends: 20 [2021-08-29 16:17:43,609 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.69ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-29 16:17:43,610 INFO L928 BasicCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.91ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.93ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 56.74ms IncrementalHoareTripleChecker+Time [2021-08-29 16:17:43,625 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 4 Invalid, 61 Unknown, 0 Unchecked, 0.93ms Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 56.74ms Time] [2021-08-29 16:17:43,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-08-29 16:17:43,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-08-29 16:17:43,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-29 16:17:43,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-08-29 16:17:43,631 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2021-08-29 16:17:43,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:17:43,632 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-08-29 16:17:43,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-29 16:17:43,632 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-08-29 16:17:43,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-29 16:17:43,633 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:17:43,633 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:17:43,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-29 16:17:43,634 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:17:43,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:17:43,635 INFO L82 PathProgramCache]: Analyzing trace with hash 703243533, now seen corresponding path program 1 times [2021-08-29 16:17:43,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:17:43,635 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438308469] [2021-08-29 16:17:43,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:17:43,636 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:17:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:43,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-29 16:17:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:43,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:43,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-29 16:17:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:43,794 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-29 16:17:43,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:17:43,794 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438308469] [2021-08-29 16:17:43,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438308469] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 16:17:43,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741970853] [2021-08-29 16:17:43,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:17:43,795 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:17:43,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 16:17:43,803 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 16:17:43,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-29 16:17:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:43,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-29 16:17:43,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 16:17:44,010 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-29 16:17:44,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 16:17:44,235 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-29 16:17:44,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741970853] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 16:17:44,236 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 16:17:44,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2021-08-29 16:17:44,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979675790] [2021-08-29 16:17:44,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-29 16:17:44,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:17:44,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-29 16:17:44,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-08-29 16:17:44,239 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2021-08-29 16:17:44,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:17:44,452 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2021-08-29 16:17:44,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-29 16:17:44,452 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 23 [2021-08-29 16:17:44,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:17:44,457 INFO L225 Difference]: With dead ends: 46 [2021-08-29 16:17:44,457 INFO L226 Difference]: Without dead ends: 29 [2021-08-29 16:17:44,461 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 129.57ms TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2021-08-29 16:17:44,463 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 48 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 100.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.68ms SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 126.85ms IncrementalHoareTripleChecker+Time [2021-08-29 16:17:44,465 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 6 Invalid, 236 Unknown, 0 Unchecked, 5.68ms Time], IncrementalHoareTripleChecker [52 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 126.85ms Time] [2021-08-29 16:17:44,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-08-29 16:17:44,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-08-29 16:17:44,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2021-08-29 16:17:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2021-08-29 16:17:44,485 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 23 [2021-08-29 16:17:44,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:17:44,486 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2021-08-29 16:17:44,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2021-08-29 16:17:44,487 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2021-08-29 16:17:44,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-08-29 16:17:44,493 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:17:44,493 INFO L513 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:17:44,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-08-29 16:17:44,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:17:44,705 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:17:44,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:17:44,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1937134450, now seen corresponding path program 1 times [2021-08-29 16:17:44,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:17:44,706 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872949698] [2021-08-29 16:17:44,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:17:44,707 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:17:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:44,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-29 16:17:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:44,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:44,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:44,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:44,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:17:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:45,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:45,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:45,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:45,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:45,063 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-08-29 16:17:45,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:17:45,064 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872949698] [2021-08-29 16:17:45,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872949698] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 16:17:45,065 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630566311] [2021-08-29 16:17:45,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:17:45,065 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:17:45,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 16:17:45,081 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 16:17:45,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-29 16:17:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:45,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-29 16:17:45,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 16:17:45,331 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2021-08-29 16:17:45,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 16:17:45,749 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 82 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-08-29 16:17:45,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630566311] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 16:17:45,750 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 16:17:45,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2021-08-29 16:17:45,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024671778] [2021-08-29 16:17:45,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-29 16:17:45,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:17:45,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-29 16:17:45,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2021-08-29 16:17:45,753 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2021-08-29 16:17:46,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:17:46,046 INFO L93 Difference]: Finished difference Result 73 states and 123 transitions. [2021-08-29 16:17:46,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-29 16:17:46,047 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 65 [2021-08-29 16:17:46,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:17:46,050 INFO L225 Difference]: With dead ends: 73 [2021-08-29 16:17:46,050 INFO L226 Difference]: Without dead ends: 44 [2021-08-29 16:17:46,051 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 185.67ms TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2021-08-29 16:17:46,052 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 38 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 144.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.03ms SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 185.94ms IncrementalHoareTripleChecker+Time [2021-08-29 16:17:46,052 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 6 Invalid, 328 Unknown, 0 Unchecked, 4.03ms Time], IncrementalHoareTripleChecker [58 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 185.94ms Time] [2021-08-29 16:17:46,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-08-29 16:17:46,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-08-29 16:17:46,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (24), 9 states have call predecessors, (24), 7 states have call successors, (24) [2021-08-29 16:17:46,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 66 transitions. [2021-08-29 16:17:46,061 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 66 transitions. Word has length 65 [2021-08-29 16:17:46,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:17:46,066 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 66 transitions. [2021-08-29 16:17:46,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2021-08-29 16:17:46,069 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 66 transitions. [2021-08-29 16:17:46,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-08-29 16:17:46,074 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:17:46,075 INFO L513 BasicCegarLoop]: trace histogram [25, 25, 17, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:17:46,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-29 16:17:46,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-08-29 16:17:46,294 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:17:46,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:17:46,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1389805118, now seen corresponding path program 2 times [2021-08-29 16:17:46,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:17:46,295 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617287015] [2021-08-29 16:17:46,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:17:46,295 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:17:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:46,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-29 16:17:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:46,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:46,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:46,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:46,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:46,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:46,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:17:46,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:46,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-29 16:17:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:46,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:46,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:46,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-08-29 16:17:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:46,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:46,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:46,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:46,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:46,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:17:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:46,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-29 16:17:46,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:46,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:46,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:46,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:46,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:46,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:17:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:46,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-29 16:17:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:46,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:46,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:46,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 253 proven. 368 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2021-08-29 16:17:46,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:17:46,703 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617287015] [2021-08-29 16:17:46,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617287015] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 16:17:46,704 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519747680] [2021-08-29 16:17:46,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-29 16:17:46,705 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:17:46,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 16:17:46,709 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 16:17:46,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-29 16:17:46,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-29 16:17:46,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 16:17:46,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-29 16:17:46,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 16:17:47,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 459 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2021-08-29 16:17:47,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 16:17:48,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 485 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2021-08-29 16:17:48,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519747680] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 16:17:48,248 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 16:17:48,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 23 [2021-08-29 16:17:48,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510789367] [2021-08-29 16:17:48,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-08-29 16:17:48,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:17:48,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-08-29 16:17:48,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2021-08-29 16:17:48,251 INFO L87 Difference]: Start difference. First operand 44 states and 66 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2021-08-29 16:17:48,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:17:48,870 INFO L93 Difference]: Finished difference Result 119 states and 223 transitions. [2021-08-29 16:17:48,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-08-29 16:17:48,871 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) Word has length 171 [2021-08-29 16:17:48,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:17:48,873 INFO L225 Difference]: With dead ends: 119 [2021-08-29 16:17:48,873 INFO L226 Difference]: Without dead ends: 76 [2021-08-29 16:17:48,875 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 428.39ms TimeCoverageRelationStatistics Valid=515, Invalid=1291, Unknown=0, NotChecked=0, Total=1806 [2021-08-29 16:17:48,875 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 148 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 244.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.98ms SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 311.66ms IncrementalHoareTripleChecker+Time [2021-08-29 16:17:48,876 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 7 Invalid, 617 Unknown, 0 Unchecked, 4.98ms Time], IncrementalHoareTripleChecker [267 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 311.66ms Time] [2021-08-29 16:17:48,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-08-29 16:17:48,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2021-08-29 16:17:48,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 12 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (37), 13 states have call predecessors, (37), 12 states have call successors, (37) [2021-08-29 16:17:48,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 105 transitions. [2021-08-29 16:17:48,901 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 105 transitions. Word has length 171 [2021-08-29 16:17:48,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:17:48,902 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 105 transitions. [2021-08-29 16:17:48,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2021-08-29 16:17:48,903 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 105 transitions. [2021-08-29 16:17:48,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2021-08-29 16:17:48,916 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:17:48,916 INFO L513 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:17:48,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-29 16:17:49,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:17:49,133 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:17:49,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:17:49,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1020156483, now seen corresponding path program 3 times [2021-08-29 16:17:49,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:17:49,134 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843926392] [2021-08-29 16:17:49,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:17:49,134 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:17:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-29 16:17:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:17:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:17:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:17:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:17:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-29 16:17:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:17:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:17:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-08-29 16:17:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:17:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:17:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:17:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:17:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-29 16:17:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:17:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:17:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:49,983 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 844 proven. 1612 refuted. 0 times theorem prover too weak. 4664 trivial. 0 not checked. [2021-08-29 16:17:49,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:17:49,984 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843926392] [2021-08-29 16:17:49,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843926392] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 16:17:49,984 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842321093] [2021-08-29 16:17:49,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-29 16:17:49,985 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:17:49,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 16:17:49,989 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 16:17:50,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-29 16:17:50,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2021-08-29 16:17:50,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 16:17:50,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-29 16:17:50,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 16:17:50,798 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1491 refuted. 0 times theorem prover too weak. 5415 trivial. 0 not checked. [2021-08-29 16:17:50,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 16:17:53,028 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1548 refuted. 0 times theorem prover too weak. 5358 trivial. 0 not checked. [2021-08-29 16:17:53,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842321093] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 16:17:53,028 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 16:17:53,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11, 17] total 33 [2021-08-29 16:17:53,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757842435] [2021-08-29 16:17:53,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-08-29 16:17:53,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:17:53,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-08-29 16:17:53,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2021-08-29 16:17:53,032 INFO L87 Difference]: Start difference. First operand 66 states and 105 transitions. Second operand has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) [2021-08-29 16:17:53,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:17:53,646 INFO L93 Difference]: Finished difference Result 172 states and 339 transitions. [2021-08-29 16:17:53,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-08-29 16:17:53,648 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) Word has length 351 [2021-08-29 16:17:53,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:17:53,661 INFO L225 Difference]: With dead ends: 172 [2021-08-29 16:17:53,661 INFO L226 Difference]: Without dead ends: 109 [2021-08-29 16:17:53,666 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 794 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 412.59ms TimeCoverageRelationStatistics Valid=654, Invalid=1896, Unknown=0, NotChecked=0, Total=2550 [2021-08-29 16:17:53,668 INFO L928 BasicCegarLoop]: 8 mSDtfsCounter, 187 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 295.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.29ms SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 376.76ms IncrementalHoareTripleChecker+Time [2021-08-29 16:17:53,669 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 10 Invalid, 850 Unknown, 0 Unchecked, 5.29ms Time], IncrementalHoareTripleChecker [283 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 376.76ms Time] [2021-08-29 16:17:53,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-08-29 16:17:53,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2021-08-29 16:17:53,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 64 states have (on average 1.109375) internal successors, (71), 62 states have internal predecessors, (71), 17 states have call successors, (17), 12 states have call predecessors, (17), 9 states have return successors, (38), 16 states have call predecessors, (38), 17 states have call successors, (38) [2021-08-29 16:17:53,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 126 transitions. [2021-08-29 16:17:53,695 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 126 transitions. Word has length 351 [2021-08-29 16:17:53,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:17:53,697 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 126 transitions. [2021-08-29 16:17:53,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) [2021-08-29 16:17:53,698 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 126 transitions. [2021-08-29 16:17:53,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2021-08-29 16:17:53,708 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:17:53,709 INFO L513 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:17:53,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-29 16:17:53,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:17:53,931 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:17:53,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:17:53,931 INFO L82 PathProgramCache]: Analyzing trace with hash -4939658, now seen corresponding path program 4 times [2021-08-29 16:17:53,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:17:53,931 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998740514] [2021-08-29 16:17:53,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:17:53,932 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:17:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-29 16:17:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:17:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:17:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:17:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:17:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-29 16:17:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:17:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:17:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-08-29 16:17:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:17:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:17:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:17:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:17:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-08-29 16:17:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:17:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:54,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:17:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:55,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:55,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:55,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:17:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:55,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:55,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:55,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:55,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:17:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:55,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-29 16:17:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:55,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:55,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:55,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:55,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:55,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:17:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:55,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:17:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:55,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:55,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:55,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-08-29 16:17:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:55,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:55,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:55,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:55,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:55,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:17:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:55,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:17:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:55,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:55,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:17:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2818 proven. 2810 refuted. 0 times theorem prover too weak. 10779 trivial. 0 not checked. [2021-08-29 16:17:55,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:17:55,165 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998740514] [2021-08-29 16:17:55,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998740514] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 16:17:55,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497298356] [2021-08-29 16:17:55,166 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-29 16:17:55,166 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:17:55,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 16:17:55,169 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 16:17:55,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-29 16:17:55,353 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-29 16:17:55,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 16:17:55,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 30 conjunts are in the unsatisfiable core [2021-08-29 16:17:55,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 16:17:56,385 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1939 proven. 3346 refuted. 0 times theorem prover too weak. 11122 trivial. 0 not checked. [2021-08-29 16:17:56,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 16:18:00,753 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1939 proven. 3454 refuted. 0 times theorem prover too weak. 11014 trivial. 0 not checked. [2021-08-29 16:18:00,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497298356] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 16:18:00,753 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 16:18:00,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19, 31] total 45 [2021-08-29 16:18:00,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878797163] [2021-08-29 16:18:00,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-08-29 16:18:00,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:18:00,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-08-29 16:18:00,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1527, Unknown=0, NotChecked=0, Total=1980 [2021-08-29 16:18:00,761 INFO L87 Difference]: Start difference. First operand 91 states and 126 transitions. Second operand has 45 states, 45 states have (on average 2.688888888888889) internal successors, (121), 45 states have internal predecessors, (121), 39 states have call successors, (43), 1 states have call predecessors, (43), 16 states have return successors, (64), 26 states have call predecessors, (64), 39 states have call successors, (64) [2021-08-29 16:18:01,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:18:01,681 INFO L93 Difference]: Finished difference Result 217 states and 398 transitions. [2021-08-29 16:18:01,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-08-29 16:18:01,682 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.688888888888889) internal successors, (121), 45 states have internal predecessors, (121), 39 states have call successors, (43), 1 states have call predecessors, (43), 16 states have return successors, (64), 26 states have call predecessors, (64), 39 states have call successors, (64) Word has length 528 [2021-08-29 16:18:01,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:18:01,684 INFO L225 Difference]: With dead ends: 217 [2021-08-29 16:18:01,684 INFO L226 Difference]: Without dead ends: 129 [2021-08-29 16:18:01,686 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 1269 GetRequests, 1197 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1575 ImplicationChecksByTransitivity, 693.09ms TimeCoverageRelationStatistics Valid=1241, Invalid=3871, Unknown=0, NotChecked=0, Total=5112 [2021-08-29 16:18:01,687 INFO L928 BasicCegarLoop]: 12 mSDtfsCounter, 244 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 455.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.20ms SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 573.55ms IncrementalHoareTripleChecker+Time [2021-08-29 16:18:01,687 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 13 Invalid, 1512 Unknown, 0 Unchecked, 7.20ms Time], IncrementalHoareTripleChecker [509 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 573.55ms Time] [2021-08-29 16:18:01,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-08-29 16:18:01,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 109. [2021-08-29 16:18:01,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 75 states have internal predecessors, (81), 21 states have call successors, (21), 17 states have call predecessors, (21), 9 states have return successors, (51), 16 states have call predecessors, (51), 21 states have call successors, (51) [2021-08-29 16:18:01,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 153 transitions. [2021-08-29 16:18:01,703 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 153 transitions. Word has length 528 [2021-08-29 16:18:01,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:18:01,704 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 153 transitions. [2021-08-29 16:18:01,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.688888888888889) internal successors, (121), 45 states have internal predecessors, (121), 39 states have call successors, (43), 1 states have call predecessors, (43), 16 states have return successors, (64), 26 states have call predecessors, (64), 39 states have call successors, (64) [2021-08-29 16:18:01,705 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 153 transitions. [2021-08-29 16:18:01,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2021-08-29 16:18:01,711 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:18:01,712 INFO L513 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:18:01,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-29 16:18:01,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:18:01,937 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:18:01,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:18:01,937 INFO L82 PathProgramCache]: Analyzing trace with hash 670316307, now seen corresponding path program 5 times [2021-08-29 16:18:01,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:18:01,938 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667495387] [2021-08-29 16:18:01,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:18:01,938 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:18:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 16:18:02,011 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-29 16:18:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 16:18:02,186 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-29 16:18:02,186 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-08-29 16:18:02,187 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-08-29 16:18:02,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-29 16:18:02,196 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-29 16:18:02,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 04:18:02 BoogieIcfgContainer [2021-08-29 16:18:02,351 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-29 16:18:02,352 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-29 16:18:02,352 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-29 16:18:02,352 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-29 16:18:02,357 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 04:17:42" (3/4) ... [2021-08-29 16:18:02,359 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-29 16:18:02,492 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-29 16:18:02,493 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-29 16:18:02,493 INFO L158 Benchmark]: Toolchain (without parser) took 20188.00ms. Allocated memory was 54.5MB in the beginning and 180.4MB in the end (delta: 125.8MB). Free memory was 33.1MB in the beginning and 135.5MB in the end (delta: -102.5MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2021-08-29 16:18:02,494 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 54.5MB. Free memory was 36.3MB in the beginning and 36.2MB in the end (delta: 43.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 16:18:02,494 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.02ms. Allocated memory is still 54.5MB. Free memory was 32.9MB in the beginning and 37.2MB in the end (delta: -4.3MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2021-08-29 16:18:02,494 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.29ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 37.2MB in the beginning and 53.4MB in the end (delta: -16.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-08-29 16:18:02,495 INFO L158 Benchmark]: Boogie Preprocessor took 31.74ms. Allocated memory is still 69.2MB. Free memory was 53.3MB in the beginning and 52.3MB in the end (delta: 986.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 16:18:02,495 INFO L158 Benchmark]: RCFGBuilder took 255.04ms. Allocated memory is still 69.2MB. Free memory was 52.3MB in the beginning and 43.5MB in the end (delta: 8.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-08-29 16:18:02,495 INFO L158 Benchmark]: TraceAbstraction took 19536.31ms. Allocated memory was 69.2MB in the beginning and 180.4MB in the end (delta: 111.1MB). Free memory was 43.1MB in the beginning and 154.4MB in the end (delta: -111.4MB). Peak memory consumption was 101.7MB. Max. memory is 16.1GB. [2021-08-29 16:18:02,496 INFO L158 Benchmark]: Witness Printer took 140.78ms. Allocated memory is still 180.4MB. Free memory was 154.4MB in the beginning and 135.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-08-29 16:18:02,498 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 54.5MB. Free memory was 36.3MB in the beginning and 36.2MB in the end (delta: 43.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 168.02ms. Allocated memory is still 54.5MB. Free memory was 32.9MB in the beginning and 37.2MB in the end (delta: -4.3MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.29ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 37.2MB in the beginning and 53.4MB in the end (delta: -16.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.74ms. Allocated memory is still 69.2MB. Free memory was 53.3MB in the beginning and 52.3MB in the end (delta: 986.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 255.04ms. Allocated memory is still 69.2MB. Free memory was 52.3MB in the beginning and 43.5MB in the end (delta: 8.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 19536.31ms. Allocated memory was 69.2MB in the beginning and 180.4MB in the end (delta: 111.1MB). Free memory was 43.1MB in the beginning and 154.4MB in the end (delta: -111.4MB). Peak memory consumption was 101.7MB. Max. memory is 16.1GB. * Witness Printer took 140.78ms. Allocated memory is still 180.4MB. Free memory was 154.4MB in the beginning and 135.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 33]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L17] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) [L33] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19313.08ms, OverallIterations: 8, TraceHistogramMax: 77, EmptinessCheckTime: 62.59ms, AutomataDifference: 3019.71ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 13.95ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 698 SdHoareTripleChecker+Valid, 1731.49ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 683 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 1367.53ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 641 mSDsCounter, 1170 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2507 IncrementalHoareTripleChecker+Invalid, 3677 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1170 mSolverCounterUnsat, 39 mSDtfsCounter, 2507 mSolverCounterSat, 30.04ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2787 GetRequests, 2573 SyntacticMatches, 5 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2730 ImplicationChecksByTransitivity, 1920.46ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=7, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 115.50ms AutomataMinimizationTime, 7 MinimizatonAttempts, 50 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 115.09ms SsaConstructionTime, 636.68ms SatisfiabilityAnalysisTime, 13654.53ms InterpolantComputationTime, 2757 NumberOfCodeBlocks, 2580 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3418 ConstructedInterpolants, 0 QuantifiedInterpolants, 5454 SizeOfPredicates, 31 NumberOfNonLiveVariables, 2202 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 17 InterpolantComputations, 2 PerfectInterpolantSequences, 60175/75984 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-29 16:18:02,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...