./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/recursive/Fibonacci05.c --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/Fibonacci05.yml/witness.yml --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26998269 Calling Ultimate with: /root/.sdkman/candidates/java/current/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/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/Fibonacci05.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-2699826-m [2024-08-14 14:34:02,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 14:34:02,633 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-08-14 14:34:02,637 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 14:34:02,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 14:34:02,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 14:34:02,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 14:34:02,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 14:34:02,655 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-14 14:34:02,655 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-14 14:34:02,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 14:34:02,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 14:34:02,657 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 14:34:02,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 14:34:02,657 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 14:34:02,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 14:34:02,658 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 14:34:02,658 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-14 14:34:02,659 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-14 14:34:02,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-14 14:34:02,659 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 14:34:02,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 14:34:02,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 14:34:02,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 14:34:02,661 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 14:34:02,661 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-14 14:34:02,661 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 14:34:02,662 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 14:34:02,662 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 14:34:02,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 14:34:02,662 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 14:34:02,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 14:34:02,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-14 14:34:02,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 14:34:02,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 14:34:02,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 14:34:02,664 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-14 14:34:02,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-14 14:34:02,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 14:34:02,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-14 14:34:02,665 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 14:34:02,666 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-14 14:34:02,667 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-14 14:34:02,667 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-14 14:34:02,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 14:34:02,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 14:34:02,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 14:34:02,915 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 14:34:02,916 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 14:34:02,918 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/Fibonacci05.yml/witness.yml [2024-08-14 14:34:03,126 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 14:34:03,126 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 14:34:03,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2024-08-14 14:34:04,529 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 14:34:04,791 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 14:34:04,795 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci05.c [2024-08-14 14:34:04,806 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2df9b84b6/45aa54919f37425e982297548601608b/FLAGba77a2a03 [2024-08-14 14:34:04,836 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2df9b84b6/45aa54919f37425e982297548601608b [2024-08-14 14:34:04,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 14:34:04,842 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-14 14:34:04,844 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 14:34:04,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 14:34:04,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 14:34:04,858 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:34:03" (1/2) ... [2024-08-14 14:34:04,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75132d22 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:34:04, skipping insertion in model container [2024-08-14 14:34:04,860 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:34:03" (1/2) ... [2024-08-14 14:34:04,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@59b5aa42 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:34:04, skipping insertion in model container [2024-08-14 14:34:04,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:34:04" (2/2) ... [2024-08-14 14:34:04,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75132d22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:34:04, skipping insertion in model container [2024-08-14 14:34:04,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:34:04" (2/2) ... [2024-08-14 14:34:04,894 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-14 14:34:05,195 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci05.c[746,759] [2024-08-14 14:34:05,201 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:34:05,221 INFO L200 MainTranslator]: Completed pre-run [2024-08-14 14:34:05,231 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci05.c[746,759] [2024-08-14 14:34:05,231 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:34:05,243 INFO L204 MainTranslator]: Completed translation [2024-08-14 14:34:05,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:34:05 WrapperNode [2024-08-14 14:34:05,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 14:34:05,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 14:34:05,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 14:34:05,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 14:34:05,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:34:05" (1/1) ... [2024-08-14 14:34:05,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:34:05" (1/1) ... [2024-08-14 14:34:05,266 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:34:05" (1/1) ... [2024-08-14 14:34:05,283 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-08-14 14:34:05,283 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:34:05" (1/1) ... [2024-08-14 14:34:05,284 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:34:05" (1/1) ... [2024-08-14 14:34:05,286 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:34:05" (1/1) ... [2024-08-14 14:34:05,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:34:05" (1/1) ... [2024-08-14 14:34:05,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:34:05" (1/1) ... [2024-08-14 14:34:05,289 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 14:34:05,289 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-14 14:34:05,290 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-14 14:34:05,290 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-14 14:34:05,290 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:34:05" (1/1) ... [2024-08-14 14:34:05,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-14 14:34:05,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:34:05,321 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-14 14:34:05,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-14 14:34:05,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-14 14:34:05,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 14:34:05,361 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-14 14:34:05,361 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2024-08-14 14:34:05,361 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-14 14:34:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-14 14:34:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-14 14:34:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-14 14:34:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 14:34:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2024-08-14 14:34:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2024-08-14 14:34:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-14 14:34:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-14 14:34:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-14 14:34:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 14:34:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-14 14:34:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-14 14:34:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 14:34:05,420 INFO L273 CfgBuilder]: Building ICFG [2024-08-14 14:34:05,422 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 14:34:05,490 INFO L1266 $ProcedureCfgBuilder]: dead code at ProgramPoint L22: havoc #t~ret4;havoc #t~ret5; [2024-08-14 14:34:05,536 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-08-14 14:34:05,536 INFO L327 CfgBuilder]: Performing block encoding [2024-08-14 14:34:05,544 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 14:34:05,544 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 14:34:05,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:34:05 BoogieIcfgContainer [2024-08-14 14:34:05,545 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-14 14:34:05,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 14:34:05,546 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 14:34:05,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 14:34:05,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:34:03" (1/4) ... [2024-08-14 14:34:05,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5beaec58 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:34:05, skipping insertion in model container [2024-08-14 14:34:05,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:34:04" (2/4) ... [2024-08-14 14:34:05,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5beaec58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:34:05, skipping insertion in model container [2024-08-14 14:34:05,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:34:05" (3/4) ... [2024-08-14 14:34:05,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5beaec58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:34:05, skipping insertion in model container [2024-08-14 14:34:05,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:34:05" (4/4) ... [2024-08-14 14:34:05,552 INFO L119 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2024-08-14 14:34:05,552 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-14 14:34:05,572 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 14:34:05,573 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-14 14:34:05,595 INFO L92 WitnessUtils]: Constructing product of automaton with 25 states and violation witness of the following lengths: [257] [2024-08-14 14:34:05,599 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-08-14 14:34:07,108 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 2937 states to 1428 states. [2024-08-14 14:34:07,122 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-14 14:34:07,127 INFO L357 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@30c900b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 14:34:07,128 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 14:34:07,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states. [2024-08-14 14:34:07,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 794 [2024-08-14 14:34:07,715 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:34:07,716 INFO L195 NwaCegarLoop]: trace histogram [117, 117, 83, 58, 58, 58, 58, 58, 58, 58, 34, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:34:07,717 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:34:07,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:34:07,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1136669340, now seen corresponding path program 1 times [2024-08-14 14:34:07,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:34:07,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962991441] [2024-08-14 14:34:07,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:34:07,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:34:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:09,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:34:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:09,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-08-14 14:34:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:09,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:09,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:09,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:09,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:09,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-08-14 14:34:10,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-08-14 14:34:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-14 14:34:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-08-14 14:34:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-08-14 14:34:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-08-14 14:34:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-14 14:34:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-08-14 14:34:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-08-14 14:34:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-08-14 14:34:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-08-14 14:34:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-14 14:34:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-08-14 14:34:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-08-14 14:34:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-08-14 14:34:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-14 14:34:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-08-14 14:34:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-08-14 14:34:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-08-14 14:34:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-14 14:34:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-08-14 14:34:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-08-14 14:34:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-08-14 14:34:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-08-14 14:34:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-08-14 14:34:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-14 14:34:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-08-14 14:34:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-08-14 14:34:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-14 14:34:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-08-14 14:34:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-08-14 14:34:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-08-14 14:34:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-14 14:34:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-08-14 14:34:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2024-08-14 14:34:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-08-14 14:34:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2024-08-14 14:34:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-08-14 14:34:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 384 [2024-08-14 14:34:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-08-14 14:34:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 410 [2024-08-14 14:34:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:10,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-14 14:34:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-08-14 14:34:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-08-14 14:34:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-14 14:34:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-08-14 14:34:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-08-14 14:34:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-14 14:34:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-08-14 14:34:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-08-14 14:34:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-08-14 14:34:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-08-14 14:34:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-08-14 14:34:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-08-14 14:34:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-14 14:34:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-08-14 14:34:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-08-14 14:34:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-14 14:34:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,154 INFO L134 CoverageAnalysis]: Checked inductivity of 37159 backedges. 499 proven. 3090 refuted. 0 times theorem prover too weak. 33570 trivial. 0 not checked. [2024-08-14 14:34:11,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:34:11,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962991441] [2024-08-14 14:34:11,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962991441] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:34:11,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055685378] [2024-08-14 14:34:11,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:34:11,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:34:11,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:34:11,158 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) [2024-08-14 14:34:11,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-08-14 14:34:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:11,474 INFO L262 TraceCheckSpWp]: Trace formula consists of 1782 conjuncts, 18 conjunts are in the unsatisfiable core [2024-08-14 14:34:11,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:34:11,754 INFO L134 CoverageAnalysis]: Checked inductivity of 37159 backedges. 367 proven. 4328 refuted. 0 times theorem prover too weak. 32464 trivial. 0 not checked. [2024-08-14 14:34:11,755 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:34:15,995 INFO L134 CoverageAnalysis]: Checked inductivity of 37159 backedges. 367 proven. 4398 refuted. 0 times theorem prover too weak. 32394 trivial. 0 not checked. [2024-08-14 14:34:15,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055685378] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:34:15,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:34:15,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 19] total 27 [2024-08-14 14:34:15,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223541886] [2024-08-14 14:34:15,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:34:16,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-08-14 14:34:16,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:34:16,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-08-14 14:34:16,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=529, Unknown=0, NotChecked=0, Total=702 [2024-08-14 14:34:16,030 INFO L87 Difference]: Start difference. First operand 1428 states. Second operand has 27 states, 27 states have (on average 3.0) internal successors, (81), 27 states have internal predecessors, (81), 21 states have call successors, (26), 1 states have call predecessors, (26), 12 states have return successors, (34), 15 states have call predecessors, (34), 21 states have call successors, (34) [2024-08-14 14:34:16,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:34:16,532 INFO L93 Difference]: Finished difference Result 2619 states and 4412 transitions. [2024-08-14 14:34:16,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-08-14 14:34:16,535 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.0) internal successors, (81), 27 states have internal predecessors, (81), 21 states have call successors, (26), 1 states have call predecessors, (26), 12 states have return successors, (34), 15 states have call predecessors, (34), 21 states have call successors, (34) Word has length 793 [2024-08-14 14:34:16,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:34:16,569 INFO L225 Difference]: With dead ends: 2619 [2024-08-14 14:34:16,569 INFO L226 Difference]: Without dead ends: 2158 [2024-08-14 14:34:16,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1858 GetRequests, 1801 SyntacticMatches, 9 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=673, Invalid=1777, Unknown=0, NotChecked=0, Total=2450 [2024-08-14 14:34:16,574 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 101 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-08-14 14:34:16,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 189 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-08-14 14:34:16,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2024-08-14 14:34:16,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 1987. [2024-08-14 14:34:16,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1987 states, 1426 states have (on average 1.0855539971949508) internal successors, (1548), 1360 states have internal predecessors, (1548), 312 states have call successors, (312), 301 states have call predecessors, (312), 248 states have return successors, (1293), 325 states have call predecessors, (1293), 311 states have call successors, (1293) [2024-08-14 14:34:16,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 3153 transitions. [2024-08-14 14:34:16,723 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 3153 transitions. Word has length 793 [2024-08-14 14:34:16,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:34:16,723 INFO L495 AbstractCegarLoop]: Abstraction has 1987 states and 3153 transitions. [2024-08-14 14:34:16,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.0) internal successors, (81), 27 states have internal predecessors, (81), 21 states have call successors, (26), 1 states have call predecessors, (26), 12 states have return successors, (34), 15 states have call predecessors, (34), 21 states have call successors, (34) [2024-08-14 14:34:16,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 3153 transitions. [2024-08-14 14:34:16,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2024-08-14 14:34:16,739 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:34:16,740 INFO L195 NwaCegarLoop]: trace histogram [73, 73, 59, 36, 36, 36, 36, 36, 36, 36, 23, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:34:16,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-08-14 14:34:16,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-08-14 14:34:16,941 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:34:16,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:34:16,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1434221450, now seen corresponding path program 2 times [2024-08-14 14:34:16,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:34:16,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525192066] [2024-08-14 14:34:16,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:34:16,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:34:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:17,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:34:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:17,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-08-14 14:34:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-14 14:34:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-08-14 14:34:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-08-14 14:34:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-14 14:34:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-08-14 14:34:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-14 14:34:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-08-14 14:34:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-08-14 14:34:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-14 14:34:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-08-14 14:34:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-08-14 14:34:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-14 14:34:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-08-14 14:34:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-14 14:34:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-08-14 14:34:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-08-14 14:34:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-14 14:34:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-08-14 14:34:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-14 14:34:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-08-14 14:34:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-08-14 14:34:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:18,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-14 14:34:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:19,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-08-14 14:34:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:19,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-08-14 14:34:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:19,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:19,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-14 14:34:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:19,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-08-14 14:34:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:19,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:19,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:19,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-14 14:34:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:19,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-08-14 14:34:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:19,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-08-14 14:34:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:19,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:19,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:19,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-14 14:34:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:19,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-08-14 14:34:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:19,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-08-14 14:34:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:19,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:19,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:19,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:19,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-14 14:34:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:19,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-08-14 14:34:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:19,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-08-14 14:34:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:19,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-14 14:34:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:19,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-14 14:34:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:34:19,181 INFO L134 CoverageAnalysis]: Checked inductivity of 14743 backedges. 2284 proven. 2631 refuted. 0 times theorem prover too weak. 9828 trivial. 0 not checked. [2024-08-14 14:34:19,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:34:19,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525192066] [2024-08-14 14:34:19,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525192066] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:34:19,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458873590] [2024-08-14 14:34:19,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-14 14:34:19,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:34:19,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:34:19,184 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) [2024-08-14 14:34:19,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-08-14 14:34:19,365 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-14 14:34:19,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 14:34:19,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 1140 conjuncts, 30 conjunts are in the unsatisfiable core [2024-08-14 14:34:19,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:34:19,577 INFO L134 CoverageAnalysis]: Checked inductivity of 14743 backedges. 1905 proven. 3060 refuted. 0 times theorem prover too weak. 9778 trivial. 0 not checked. [2024-08-14 14:34:19,577 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:34:23,637 INFO L134 CoverageAnalysis]: Checked inductivity of 14743 backedges. 1905 proven. 3168 refuted. 0 times theorem prover too weak. 9670 trivial. 0 not checked. [2024-08-14 14:34:23,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458873590] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:34:23,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:34:23,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19, 31] total 44 [2024-08-14 14:34:23,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082567066] [2024-08-14 14:34:23,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:34:23,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-08-14 14:34:23,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:34:23,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-08-14 14:34:23,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=1468, Unknown=0, NotChecked=0, Total=1892 [2024-08-14 14:34:23,641 INFO L87 Difference]: Start difference. First operand 1987 states and 3153 transitions. Second operand has 44 states, 44 states have (on average 2.772727272727273) internal successors, (122), 44 states have internal predecessors, (122), 39 states have call successors, (45), 1 states have call predecessors, (45), 16 states have return successors, (65), 25 states have call predecessors, (65), 39 states have call successors, (65) [2024-08-14 14:34:24,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:34:24,278 INFO L93 Difference]: Finished difference Result 770 states and 904 transitions. [2024-08-14 14:34:24,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-08-14 14:34:24,279 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.772727272727273) internal successors, (122), 44 states have internal predecessors, (122), 39 states have call successors, (45), 1 states have call predecessors, (45), 16 states have return successors, (65), 25 states have call predecessors, (65), 39 states have call successors, (65) Word has length 505 [2024-08-14 14:34:24,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:34:24,282 INFO L225 Difference]: With dead ends: 770 [2024-08-14 14:34:24,283 INFO L226 Difference]: Without dead ends: 770 [2024-08-14 14:34:24,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1215 GetRequests, 1131 SyntacticMatches, 15 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1973 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1207, Invalid=3763, Unknown=0, NotChecked=0, Total=4970 [2024-08-14 14:34:24,285 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 237 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-08-14 14:34:24,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 319 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-08-14 14:34:24,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2024-08-14 14:34:24,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 733. [2024-08-14 14:34:24,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 518 states have (on average 1.0115830115830116) internal successors, (524), 513 states have internal predecessors, (524), 116 states have call successors, (116), 111 states have call predecessors, (116), 98 states have return successors, (209), 108 states have call predecessors, (209), 115 states have call successors, (209) [2024-08-14 14:34:24,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 849 transitions. [2024-08-14 14:34:24,314 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 849 transitions. Word has length 505 [2024-08-14 14:34:24,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:34:24,315 INFO L495 AbstractCegarLoop]: Abstraction has 733 states and 849 transitions. [2024-08-14 14:34:24,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.772727272727273) internal successors, (122), 44 states have internal predecessors, (122), 39 states have call successors, (45), 1 states have call predecessors, (45), 16 states have return successors, (65), 25 states have call predecessors, (65), 39 states have call successors, (65) [2024-08-14 14:34:24,316 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 849 transitions. [2024-08-14 14:34:24,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2024-08-14 14:34:24,328 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:34:24,328 INFO L195 NwaCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:34:24,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-08-14 14:34:24,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-08-14 14:34:24,533 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:34:24,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:34:24,534 INFO L85 PathProgramCache]: Analyzing trace with hash -113502465, now seen corresponding path program 3 times [2024-08-14 14:34:24,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:34:24,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132118908] [2024-08-14 14:34:24,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:34:24,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:34:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:34:24,602 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 14:34:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:34:24,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-14 14:34:24,673 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 14:34:24,673 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-14 14:34:24,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-08-14 14:34:24,677 INFO L445 BasicCegarLoop]: Path program histogram: [3] [2024-08-14 14:34:24,680 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 14:34:24,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 02:34:24 BoogieIcfgContainer [2024-08-14 14:34:24,767 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 14:34:24,768 INFO L158 Benchmark]: Toolchain (without parser) took 19925.94ms. Allocated memory was 199.2MB in the beginning and 1.0GB in the end (delta: 815.8MB). Free memory was 121.1MB in the beginning and 695.0MB in the end (delta: -573.9MB). Peak memory consumption was 244.6MB. Max. memory is 16.1GB. [2024-08-14 14:34:24,768 INFO L158 Benchmark]: Witness Parser took 0.21ms. Allocated memory is still 109.1MB. Free memory is still 71.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:34:24,768 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 199.2MB. Free memory is still 165.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:34:24,768 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.56ms. Allocated memory is still 199.2MB. Free memory was 120.9MB in the beginning and 172.0MB in the end (delta: -51.0MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2024-08-14 14:34:24,768 INFO L158 Benchmark]: Boogie Preprocessor took 43.29ms. Allocated memory is still 199.2MB. Free memory was 172.0MB in the beginning and 169.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-14 14:34:24,768 INFO L158 Benchmark]: IcfgBuilder took 255.31ms. Allocated memory is still 199.2MB. Free memory was 169.9MB in the beginning and 158.1MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-08-14 14:34:24,769 INFO L158 Benchmark]: TraceAbstraction took 19221.12ms. Allocated memory was 199.2MB in the beginning and 1.0GB in the end (delta: 815.8MB). Free memory was 157.3MB in the beginning and 695.0MB in the end (delta: -537.7MB). Peak memory consumption was 277.9MB. Max. memory is 16.1GB. [2024-08-14 14:34:24,770 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.21ms. Allocated memory is still 109.1MB. Free memory is still 71.7MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.12ms. Allocated memory is still 199.2MB. Free memory is still 165.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.56ms. Allocated memory is still 199.2MB. Free memory was 120.9MB in the beginning and 172.0MB in the end (delta: -51.0MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.29ms. Allocated memory is still 199.2MB. Free memory was 172.0MB in the beginning and 169.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 255.31ms. Allocated memory is still 199.2MB. Free memory was 169.9MB in the beginning and 158.1MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 19221.12ms. Allocated memory was 199.2MB in the beginning and 1.0GB in the end (delta: 815.8MB). Free memory was 157.3MB in the beginning and 695.0MB in the end (delta: -537.7MB). Peak memory consumption was 277.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.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s 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] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, 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] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, 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] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, 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] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, 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] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, 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] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, 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] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, 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] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, 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] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, 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] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, 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] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, 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] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, 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] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) VAL [x=8] [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) [L33] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.1s, OverallIterations: 3, TraceHistogramMax: 117, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.6s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 338 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 338 mSDsluCounter, 508 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 440 mSDsCounter, 344 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 759 IncrementalHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 344 mSolverCounterUnsat, 68 mSDtfsCounter, 759 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3073 GetRequests, 2932 SyntacticMatches, 24 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2667 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1987occurred in iteration=1, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 2 MinimizatonAttempts, 208 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 3060 NumberOfCodeBlocks, 3060 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 3888 ConstructedInterpolants, 0 QuantifiedInterpolants, 5156 SizeOfPredicates, 20 NumberOfNonLiveVariables, 2922 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 6 InterpolantComputations, 0 PerfectInterpolantSequences, 135031/155706 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! [2024-08-14 14:34:24,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE