./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 42036c90cf17a9bca9878c7ba1e2de2c7beff8028a525d1b2b84e3f8cdd299d5 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 04:25:50,018 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:25:50,133 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 04:25:50,148 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:25:50,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:25:50,199 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:25:50,201 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:25:50,201 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:25:50,202 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:25:50,202 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:25:50,203 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:25:50,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:25:50,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:25:50,205 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:25:50,205 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:25:50,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:25:50,206 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 04:25:50,206 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 04:25:50,207 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:25:50,207 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 04:25:50,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:25:50,207 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 04:25:50,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:25:50,208 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 04:25:50,208 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 04:25:50,208 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 04:25:50,208 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:25:50,208 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:25:50,208 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:25:50,209 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:25:50,209 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:25:50,209 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:25:50,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:25:50,210 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:25:50,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:25:50,210 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:25:50,210 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:25:50,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:25:50,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:25:50,211 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:25:50,211 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 04:25:50,211 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 04:25:50,211 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 04:25:50,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 04:25:50,212 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:25:50,212 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:25:50,212 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:25:50,212 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:25:50,213 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 42036c90cf17a9bca9878c7ba1e2de2c7beff8028a525d1b2b84e3f8cdd299d5 [2024-11-28 04:25:50,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:25:50,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:25:50,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:25:50,634 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:25:50,635 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:25:50,638 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/recursive/Fibonacci05.c [2024-11-28 04:25:54,353 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/data/bdb864bff/3c2b24b1a63e4cb0b2117107844dca55/FLAGaf41992f6 [2024-11-28 04:25:54,717 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:25:54,718 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/sv-benchmarks/c/recursive/Fibonacci05.c [2024-11-28 04:25:54,734 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/data/bdb864bff/3c2b24b1a63e4cb0b2117107844dca55/FLAGaf41992f6 [2024-11-28 04:25:54,761 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/data/bdb864bff/3c2b24b1a63e4cb0b2117107844dca55 [2024-11-28 04:25:54,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:25:54,770 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:25:54,771 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:25:54,771 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:25:54,778 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:25:54,779 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:25:54" (1/1) ... [2024-11-28 04:25:54,783 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69df985f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:54, skipping insertion in model container [2024-11-28 04:25:54,784 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:25:54" (1/1) ... [2024-11-28 04:25:54,805 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:25:55,024 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/sv-benchmarks/c/recursive/Fibonacci05.c[788,801] [2024-11-28 04:25:55,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:25:55,043 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:25:55,066 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/sv-benchmarks/c/recursive/Fibonacci05.c[788,801] [2024-11-28 04:25:55,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:25:55,086 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:25:55,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:55 WrapperNode [2024-11-28 04:25:55,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:25:55,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:25:55,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:25:55,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:25:55,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:55" (1/1) ... [2024-11-28 04:25:55,108 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:55" (1/1) ... [2024-11-28 04:25:55,127 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2024-11-28 04:25:55,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:25:55,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:25:55,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:25:55,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:25:55,141 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:55" (1/1) ... [2024-11-28 04:25:55,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:55" (1/1) ... [2024-11-28 04:25:55,144 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:55" (1/1) ... [2024-11-28 04:25:55,161 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-11-28 04:25:55,161 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:55" (1/1) ... [2024-11-28 04:25:55,164 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:55" (1/1) ... [2024-11-28 04:25:55,167 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:55" (1/1) ... [2024-11-28 04:25:55,168 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:55" (1/1) ... [2024-11-28 04:25:55,171 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:55" (1/1) ... [2024-11-28 04:25:55,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:55" (1/1) ... [2024-11-28 04:25:55,177 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:55" (1/1) ... [2024-11-28 04:25:55,179 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:25:55,180 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:25:55,180 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:25:55,180 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:25:55,181 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:55" (1/1) ... [2024-11-28 04:25:55,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:25:55,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:25:55,225 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:25:55,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:25:55,262 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2024-11-28 04:25:55,262 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2024-11-28 04:25:55,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:25:55,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:25:55,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:25:55,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 04:25:55,330 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:25:55,333 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:25:55,480 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-28 04:25:55,480 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:25:55,491 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:25:55,491 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-28 04:25:55,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:25:55 BoogieIcfgContainer [2024-11-28 04:25:55,492 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:25:55,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:25:55,495 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:25:55,502 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:25:55,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:25:54" (1/3) ... [2024-11-28 04:25:55,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@462e44b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:25:55, skipping insertion in model container [2024-11-28 04:25:55,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:55" (2/3) ... [2024-11-28 04:25:55,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@462e44b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:25:55, skipping insertion in model container [2024-11-28 04:25:55,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:25:55" (3/3) ... [2024-11-28 04:25:55,505 INFO L128 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2024-11-28 04:25:55,525 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:25:55,527 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Fibonacci05.c that has 2 procedures, 20 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-28 04:25:55,593 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:25:55,608 INFO L333 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, 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;@7e56ff4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:25:55,608 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 04:25:55,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:25:55,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 04:25:55,621 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:25:55,622 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:25:55,622 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:25:55,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:25:55,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1939714822, now seen corresponding path program 1 times [2024-11-28 04:25:55,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:25:55,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757400232] [2024-11-28 04:25:55,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:25:55,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:25:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:25:56,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:25:56,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:25:56,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757400232] [2024-11-28 04:25:56,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757400232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:25:56,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:25:56,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:25:56,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18327724] [2024-11-28 04:25:56,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:25:56,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:25:56,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:25:56,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:25:56,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:25:56,059 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:25:56,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:25:56,206 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2024-11-28 04:25:56,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:25:56,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-28 04:25:56,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:25:56,221 INFO L225 Difference]: With dead ends: 31 [2024-11-28 04:25:56,222 INFO L226 Difference]: Without dead ends: 21 [2024-11-28 04:25:56,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:25:56,229 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:25:56,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 51 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:25:56,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-28 04:25:56,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2024-11-28 04:25:56,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-28 04:25:56,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-11-28 04:25:56,284 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2024-11-28 04:25:56,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:25:56,285 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-11-28 04:25:56,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:25:56,285 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-11-28 04:25:56,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 04:25:56,288 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:25:56,288 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:25:56,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 04:25:56,290 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:25:56,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:25:56,290 INFO L85 PathProgramCache]: Analyzing trace with hash 692912656, now seen corresponding path program 1 times [2024-11-28 04:25:56,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:25:56,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399302525] [2024-11-28 04:25:56,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:25:56,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:25:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:25:56,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:25:56,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:25:56,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399302525] [2024-11-28 04:25:56,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399302525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:25:56,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:25:56,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:25:56,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515757949] [2024-11-28 04:25:56,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:25:56,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:25:56,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:25:56,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:25:56,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:25:56,471 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:25:56,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:25:56,592 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2024-11-28 04:25:56,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:25:56,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-28 04:25:56,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:25:56,596 INFO L225 Difference]: With dead ends: 25 [2024-11-28 04:25:56,596 INFO L226 Difference]: Without dead ends: 21 [2024-11-28 04:25:56,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:25:56,597 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:25:56,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 39 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:25:56,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-28 04:25:56,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2024-11-28 04:25:56,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-28 04:25:56,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-11-28 04:25:56,619 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2024-11-28 04:25:56,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:25:56,620 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-11-28 04:25:56,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:25:56,620 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-11-28 04:25:56,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-28 04:25:56,623 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:25:56,623 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:25:56,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 04:25:56,624 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:25:56,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:25:56,624 INFO L85 PathProgramCache]: Analyzing trace with hash 453332055, now seen corresponding path program 1 times [2024-11-28 04:25:56,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:25:56,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101559419] [2024-11-28 04:25:56,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:25:56,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:25:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:25:56,837 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:25:56,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:25:56,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101559419] [2024-11-28 04:25:56,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101559419] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:25:56,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091567249] [2024-11-28 04:25:56,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:25:56,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:25:56,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:25:56,846 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:25:56,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 04:25:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:25:56,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 04:25:56,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:25:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:25:57,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:25:57,530 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 04:25:57,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091567249] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:25:57,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:25:57,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2024-11-28 04:25:57,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159823102] [2024-11-28 04:25:57,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:25:57,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 04:25:57,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:25:57,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 04:25:57,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-28 04:25:57,537 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-28 04:25:57,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:25:57,771 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2024-11-28 04:25:57,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:25:57,771 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 24 [2024-11-28 04:25:57,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:25:57,773 INFO L225 Difference]: With dead ends: 43 [2024-11-28 04:25:57,773 INFO L226 Difference]: Without dead ends: 26 [2024-11-28 04:25:57,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:25:57,775 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:25:57,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 70 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:25:57,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-28 04:25:57,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-28 04:25:57,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-28 04:25:57,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2024-11-28 04:25:57,785 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 24 [2024-11-28 04:25:57,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:25:57,786 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2024-11-28 04:25:57,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-28 04:25:57,787 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2024-11-28 04:25:57,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-28 04:25:57,789 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:25:57,789 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:25:57,801 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 04:25:57,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:25:57,994 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:25:57,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:25:57,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1186000891, now seen corresponding path program 1 times [2024-11-28 04:25:57,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:25:57,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611638410] [2024-11-28 04:25:57,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:25:57,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:25:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:25:58,322 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 48 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-28 04:25:58,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:25:58,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611638410] [2024-11-28 04:25:58,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611638410] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:25:58,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862413675] [2024-11-28 04:25:58,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:25:58,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:25:58,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:25:58,327 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:25:58,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 04:25:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:25:58,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 04:25:58,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:25:58,518 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 48 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-28 04:25:58,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:25:59,163 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-28 04:25:59,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862413675] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:25:59,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:25:59,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 12 [2024-11-28 04:25:59,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158045316] [2024-11-28 04:25:59,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:25:59,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 04:25:59,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:25:59,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 04:25:59,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-28 04:25:59,171 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-28 04:25:59,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:25:59,416 INFO L93 Difference]: Finished difference Result 45 states and 75 transitions. [2024-11-28 04:25:59,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:25:59,416 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) Word has length 52 [2024-11-28 04:25:59,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:25:59,419 INFO L225 Difference]: With dead ends: 45 [2024-11-28 04:25:59,420 INFO L226 Difference]: Without dead ends: 39 [2024-11-28 04:25:59,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:25:59,421 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:25:59,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 69 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:25:59,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-28 04:25:59,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2024-11-28 04:25:59,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 25 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (30), 9 states have call predecessors, (30), 6 states have call successors, (30) [2024-11-28 04:25:59,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 61 transitions. [2024-11-28 04:25:59,442 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 61 transitions. Word has length 52 [2024-11-28 04:25:59,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:25:59,443 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 61 transitions. [2024-11-28 04:25:59,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-28 04:25:59,444 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 61 transitions. [2024-11-28 04:25:59,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-28 04:25:59,452 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:25:59,453 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 15, 11, 11, 11, 11, 11, 11, 11, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:25:59,465 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 04:25:59,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:25:59,654 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:25:59,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:25:59,654 INFO L85 PathProgramCache]: Analyzing trace with hash 843019629, now seen corresponding path program 2 times [2024-11-28 04:25:59,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:25:59,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546446493] [2024-11-28 04:25:59,655 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:25:59,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:25:59,722 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:25:59,723 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:26:00,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 69 proven. 401 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2024-11-28 04:26:00,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:26:00,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546446493] [2024-11-28 04:26:00,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546446493] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:26:00,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525994437] [2024-11-28 04:26:00,343 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:26:00,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:26:00,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:26:00,346 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:26:00,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 04:26:00,518 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:26:00,518 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:26:00,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-28 04:26:00,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:26:00,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 69 proven. 401 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2024-11-28 04:26:00,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:26:02,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 69 proven. 427 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2024-11-28 04:26:02,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525994437] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:26:02,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:26:02,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 16 [2024-11-28 04:26:02,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236955184] [2024-11-28 04:26:02,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:26:02,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 04:26:02,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:26:02,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 04:26:02,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-28 04:26:02,575 INFO L87 Difference]: Start difference. First operand 36 states and 61 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-28 04:26:02,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:26:02,845 INFO L93 Difference]: Finished difference Result 55 states and 111 transitions. [2024-11-28 04:26:02,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 04:26:02,846 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) Word has length 158 [2024-11-28 04:26:02,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:26:02,850 INFO L225 Difference]: With dead ends: 55 [2024-11-28 04:26:02,850 INFO L226 Difference]: Without dead ends: 49 [2024-11-28 04:26:02,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 309 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2024-11-28 04:26:02,852 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:26:02,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 85 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:26:02,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-28 04:26:02,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2024-11-28 04:26:02,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 31 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 8 states have return successors, (56), 13 states have call predecessors, (56), 8 states have call successors, (56) [2024-11-28 04:26:02,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 95 transitions. [2024-11-28 04:26:02,875 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 95 transitions. Word has length 158 [2024-11-28 04:26:02,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:26:02,876 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 95 transitions. [2024-11-28 04:26:02,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-28 04:26:02,876 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 95 transitions. [2024-11-28 04:26:02,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2024-11-28 04:26:02,888 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:26:02,888 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 41, 29, 29, 29, 29, 29, 29, 29, 18, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:26:02,900 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 04:26:03,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:26:03,089 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:26:03,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:26:03,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1718675215, now seen corresponding path program 3 times [2024-11-28 04:26:03,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:26:03,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788584674] [2024-11-28 04:26:03,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:26:03,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:26:03,169 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-28 04:26:03,169 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:26:03,405 INFO L134 CoverageAnalysis]: Checked inductivity of 9288 backedges. 1080 proven. 43 refuted. 0 times theorem prover too weak. 8165 trivial. 0 not checked. [2024-11-28 04:26:03,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:26:03,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788584674] [2024-11-28 04:26:03,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788584674] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:26:03,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413807479] [2024-11-28 04:26:03,406 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:26:03,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:26:03,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:26:03,409 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:26:03,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 04:26:03,559 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-28 04:26:03,559 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:26:03,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 04:26:03,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:26:03,715 INFO L134 CoverageAnalysis]: Checked inductivity of 9288 backedges. 2073 proven. 13 refuted. 0 times theorem prover too weak. 7202 trivial. 0 not checked. [2024-11-28 04:26:03,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:26:05,741 INFO L134 CoverageAnalysis]: Checked inductivity of 9288 backedges. 1262 proven. 60 refuted. 0 times theorem prover too weak. 7966 trivial. 0 not checked. [2024-11-28 04:26:05,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413807479] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:26:05,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:26:05,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 14 [2024-11-28 04:26:05,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433092925] [2024-11-28 04:26:05,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:26:05,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 04:26:05,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:26:05,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 04:26:05,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-28 04:26:05,749 INFO L87 Difference]: Start difference. First operand 46 states and 95 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 7 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (14), 4 states have call predecessors, (14), 7 states have call successors, (14) [2024-11-28 04:26:05,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:26:05,919 INFO L93 Difference]: Finished difference Result 93 states and 240 transitions. [2024-11-28 04:26:05,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 04:26:05,921 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 7 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (14), 4 states have call predecessors, (14), 7 states have call successors, (14) Word has length 400 [2024-11-28 04:26:05,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:26:05,924 INFO L225 Difference]: With dead ends: 93 [2024-11-28 04:26:05,924 INFO L226 Difference]: Without dead ends: 51 [2024-11-28 04:26:05,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 811 GetRequests, 791 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2024-11-28 04:26:05,931 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 14 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:26:05,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 75 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:26:05,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-28 04:26:05,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2024-11-28 04:26:05,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.064516129032258) internal successors, (33), 32 states have internal predecessors, (33), 8 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (51), 13 states have call predecessors, (51), 8 states have call successors, (51) [2024-11-28 04:26:05,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 92 transitions. [2024-11-28 04:26:05,948 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 92 transitions. Word has length 400 [2024-11-28 04:26:05,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:26:05,949 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 92 transitions. [2024-11-28 04:26:05,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 7 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (14), 4 states have call predecessors, (14), 7 states have call successors, (14) [2024-11-28 04:26:05,949 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 92 transitions. [2024-11-28 04:26:05,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2024-11-28 04:26:05,965 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:26:05,965 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 61, 35, 35, 35, 35, 35, 35, 35, 26, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:26:05,977 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-28 04:26:06,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:26:06,166 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:26:06,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:26:06,167 INFO L85 PathProgramCache]: Analyzing trace with hash 482273333, now seen corresponding path program 4 times [2024-11-28 04:26:06,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:26:06,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004944885] [2024-11-28 04:26:06,168 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 04:26:06,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:26:06,282 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 04:26:06,282 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:26:07,589 INFO L134 CoverageAnalysis]: Checked inductivity of 14150 backedges. 1256 proven. 2490 refuted. 0 times theorem prover too weak. 10404 trivial. 0 not checked. [2024-11-28 04:26:07,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:26:07,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004944885] [2024-11-28 04:26:07,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004944885] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:26:07,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193958897] [2024-11-28 04:26:07,590 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 04:26:07,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:26:07,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:26:07,592 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:26:07,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 04:26:07,845 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 04:26:07,846 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:26:07,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-28 04:26:07,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:26:08,077 INFO L134 CoverageAnalysis]: Checked inductivity of 14150 backedges. 4694 proven. 170 refuted. 0 times theorem prover too weak. 9286 trivial. 0 not checked. [2024-11-28 04:26:08,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:26:11,431 INFO L134 CoverageAnalysis]: Checked inductivity of 14150 backedges. 506 proven. 2500 refuted. 0 times theorem prover too weak. 11144 trivial. 0 not checked. [2024-11-28 04:26:11,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193958897] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:26:11,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:26:11,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 15] total 27 [2024-11-28 04:26:11,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39250170] [2024-11-28 04:26:11,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:26:11,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-28 04:26:11,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:26:11,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-28 04:26:11,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2024-11-28 04:26:11,437 INFO L87 Difference]: Start difference. First operand 48 states and 92 transitions. Second operand has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 27 states have internal predecessors, (88), 21 states have call successors, (28), 2 states have call predecessors, (28), 14 states have return successors, (39), 17 states have call predecessors, (39), 21 states have call successors, (39) [2024-11-28 04:26:12,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:26:12,420 INFO L93 Difference]: Finished difference Result 140 states and 339 transitions. [2024-11-28 04:26:12,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-28 04:26:12,422 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 27 states have internal predecessors, (88), 21 states have call successors, (28), 2 states have call predecessors, (28), 14 states have return successors, (39), 17 states have call predecessors, (39), 21 states have call successors, (39) Word has length 492 [2024-11-28 04:26:12,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:26:12,424 INFO L225 Difference]: With dead ends: 140 [2024-11-28 04:26:12,424 INFO L226 Difference]: Without dead ends: 96 [2024-11-28 04:26:12,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1033 GetRequests, 975 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=654, Invalid=2102, Unknown=0, NotChecked=0, Total=2756 [2024-11-28 04:26:12,430 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 185 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:26:12,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 203 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 04:26:12,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-28 04:26:12,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-28 04:26:12,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 66 states have internal predecessors, (73), 17 states have call successors, (17), 14 states have call predecessors, (17), 9 states have return successors, (43), 15 states have call predecessors, (43), 17 states have call successors, (43) [2024-11-28 04:26:12,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 133 transitions. [2024-11-28 04:26:12,450 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 133 transitions. Word has length 492 [2024-11-28 04:26:12,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:26:12,451 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 133 transitions. [2024-11-28 04:26:12,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 27 states have internal predecessors, (88), 21 states have call successors, (28), 2 states have call predecessors, (28), 14 states have return successors, (39), 17 states have call predecessors, (39), 21 states have call successors, (39) [2024-11-28 04:26:12,451 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 133 transitions. [2024-11-28 04:26:12,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2024-11-28 04:26:12,471 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:26:12,471 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 78, 48, 48, 48, 48, 48, 48, 48, 30, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:26:12,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 04:26:12,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:26:12,676 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:26:12,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:26:12,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1230230680, now seen corresponding path program 5 times [2024-11-28 04:26:12,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:26:12,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182874498] [2024-11-28 04:26:12,677 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 04:26:12,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:26:12,900 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 58 check-sat command(s) [2024-11-28 04:26:12,900 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:26:14,168 INFO L134 CoverageAnalysis]: Checked inductivity of 26139 backedges. 3735 proven. 1741 refuted. 0 times theorem prover too weak. 20663 trivial. 0 not checked. [2024-11-28 04:26:14,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:26:14,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182874498] [2024-11-28 04:26:14,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182874498] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:26:14,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318426126] [2024-11-28 04:26:14,169 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 04:26:14,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:26:14,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:26:14,172 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:26:14,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 04:26:14,657 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 58 check-sat command(s) [2024-11-28 04:26:14,658 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:26:14,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-28 04:26:14,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:26:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 26139 backedges. 11426 proven. 865 refuted. 0 times theorem prover too weak. 13848 trivial. 0 not checked. [2024-11-28 04:26:14,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:26:22,025 INFO L134 CoverageAnalysis]: Checked inductivity of 26139 backedges. 3888 proven. 1940 refuted. 0 times theorem prover too weak. 20311 trivial. 0 not checked. [2024-11-28 04:26:22,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318426126] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:26:22,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:26:22,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 23] total 28 [2024-11-28 04:26:22,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138032694] [2024-11-28 04:26:22,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:26:22,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-28 04:26:22,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:26:22,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-28 04:26:22,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2024-11-28 04:26:22,030 INFO L87 Difference]: Start difference. First operand 96 states and 133 transitions. Second operand has 28 states, 28 states have (on average 3.25) internal successors, (91), 28 states have internal predecessors, (91), 21 states have call successors, (28), 2 states have call predecessors, (28), 12 states have return successors, (37), 14 states have call predecessors, (37), 21 states have call successors, (37) [2024-11-28 04:26:22,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:26:22,702 INFO L93 Difference]: Finished difference Result 201 states and 301 transitions. [2024-11-28 04:26:22,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-28 04:26:22,703 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.25) internal successors, (91), 28 states have internal predecessors, (91), 21 states have call successors, (28), 2 states have call predecessors, (28), 12 states have return successors, (37), 14 states have call predecessors, (37), 21 states have call successors, (37) Word has length 665 [2024-11-28 04:26:22,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:26:22,708 INFO L225 Difference]: With dead ends: 201 [2024-11-28 04:26:22,708 INFO L226 Difference]: Without dead ends: 111 [2024-11-28 04:26:22,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1368 GetRequests, 1314 SyntacticMatches, 11 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2024-11-28 04:26:22,715 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 75 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:26:22,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 221 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 04:26:22,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-28 04:26:22,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2024-11-28 04:26:22,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 66 states have internal predecessors, (72), 18 states have call successors, (18), 14 states have call predecessors, (18), 9 states have return successors, (43), 16 states have call predecessors, (43), 18 states have call successors, (43) [2024-11-28 04:26:22,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 133 transitions. [2024-11-28 04:26:22,734 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 133 transitions. Word has length 665 [2024-11-28 04:26:22,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:26:22,735 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 133 transitions. [2024-11-28 04:26:22,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.25) internal successors, (91), 28 states have internal predecessors, (91), 21 states have call successors, (28), 2 states have call predecessors, (28), 12 states have return successors, (37), 14 states have call predecessors, (37), 21 states have call successors, (37) [2024-11-28 04:26:22,736 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 133 transitions. [2024-11-28 04:26:22,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2024-11-28 04:26:22,739 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:26:22,739 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:26:22,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-28 04:26:22,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-28 04:26:22,940 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:26:22,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:26:22,941 INFO L85 PathProgramCache]: Analyzing trace with hash -45194381, now seen corresponding path program 6 times [2024-11-28 04:26:22,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:26:22,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644238047] [2024-11-28 04:26:22,942 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-28 04:26:22,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:26:23,186 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 54 check-sat command(s) [2024-11-28 04:26:23,186 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-28 04:26:23,186 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 04:26:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 04:26:23,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 04:26:23,386 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 04:26:23,388 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-28 04:26:23,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 04:26:23,395 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2024-11-28 04:26:23,546 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 04:26:23,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:26:23 BoogieIcfgContainer [2024-11-28 04:26:23,553 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 04:26:23,556 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 04:26:23,556 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 04:26:23,557 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 04:26:23,558 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:25:55" (3/4) ... [2024-11-28 04:26:23,559 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-28 04:26:23,672 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 258. [2024-11-28 04:26:23,893 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 04:26:23,895 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 04:26:23,896 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 04:26:23,897 INFO L158 Benchmark]: Toolchain (without parser) took 29128.68ms. Allocated memory was 142.6MB in the beginning and 436.2MB in the end (delta: 293.6MB). Free memory was 101.3MB in the beginning and 172.8MB in the end (delta: -71.4MB). Peak memory consumption was 216.0MB. Max. memory is 16.1GB. [2024-11-28 04:26:23,897 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 167.8MB. Free memory is still 106.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:26:23,898 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.69ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 90.4MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 04:26:23,899 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.97ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 89.5MB in the end (delta: 967.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:26:23,900 INFO L158 Benchmark]: Boogie Preprocessor took 50.58ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 88.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:26:23,901 INFO L158 Benchmark]: RCFGBuilder took 312.50ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 78.4MB in the end (delta: 9.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:26:23,903 INFO L158 Benchmark]: TraceAbstraction took 28057.97ms. Allocated memory was 142.6MB in the beginning and 436.2MB in the end (delta: 293.6MB). Free memory was 77.7MB in the beginning and 189.5MB in the end (delta: -111.8MB). Peak memory consumption was 182.4MB. Max. memory is 16.1GB. [2024-11-28 04:26:23,903 INFO L158 Benchmark]: Witness Printer took 339.55ms. Allocated memory is still 436.2MB. Free memory was 189.5MB in the beginning and 172.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 04:26:23,906 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 167.8MB. Free memory is still 106.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.69ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 90.4MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.97ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 89.5MB in the end (delta: 967.2kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.58ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 88.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 312.50ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 78.4MB in the end (delta: 9.8MB). There was no memory consumed. Max. memory is 16.1GB. * TraceAbstraction took 28057.97ms. Allocated memory was 142.6MB in the beginning and 436.2MB in the end (delta: 293.6MB). Free memory was 77.7MB in the beginning and 189.5MB in the end (delta: -111.8MB). Peak memory consumption was 182.4MB. Max. memory is 16.1GB. * Witness Printer took 339.55ms. Allocated memory is still 436.2MB. Free memory was 189.5MB in the beginning and 172.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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: 36]: 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] COND FALSE !(x > 46) VAL [x=8] [L32] 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); [L32] RET, EXPR fibonacci(x) VAL [x=8] [L32] int result = fibonacci(x); [L33] COND FALSE !(x < 8 || result >= 34) [L36] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.8s, OverallIterations: 9, TraceHistogramMax: 97, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 372 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 343 mSDsluCounter, 813 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 646 mSDsCounter, 351 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1237 IncrementalHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 351 mSolverCounterUnsat, 167 mSDtfsCounter, 1237 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3726 GetRequests, 3536 SyntacticMatches, 29 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1358 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=8, InterpolantAutomatonStates: 106, 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, 8 MinimizatonAttempts, 27 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 20.8s InterpolantComputationTime, 4066 NumberOfCodeBlocks, 2836 NumberOfCodeBlocksAsserted, 194 NumberOfCheckSat, 5376 ConstructedInterpolants, 0 QuantifiedInterpolants, 7056 SizeOfPredicates, 23 NumberOfNonLiveVariables, 2634 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 141878/153096 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-28 04:26:23,943 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2c280e7-4111-4cf2-a386-6db40987696f/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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