./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_1b.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 4f9af400
extending candidate: java
['java']
extending candidate: /usr/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/oracle-jdk-bin-*/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/openjdk-*/bin/java
['java', '/usr/bin/java']
extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java
['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java']
['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/recursified_loop-simple/recursified_nested_1b.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '4b2397f02ca31d86bec1660af6a105f36402aae0113477a6332673f13a213eff']
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_1b.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --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 4b2397f02ca31d86bec1660af6a105f36402aae0113477a6332673f13a213eff
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-06 23:51:31,082 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-06 23:51:31,167 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-06 23:51:31,177 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-06 23:51:31,177 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-06 23:51:31,208 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-06 23:51:31,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-06 23:51:31,209 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-06 23:51:31,210 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-06 23:51:31,210 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-06 23:51:31,210 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-06 23:51:31,210 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-06 23:51:31,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-06 23:51:31,211 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-06 23:51:31,212 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-06 23:51:31,212 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-06 23:51:31,212 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-06 23:51:31,212 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-06 23:51:31,212 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-06 23:51:31,212 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-06 23:51:31,213 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-06 23:51:31,213 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-06 23:51:31,213 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-06 23:51:31,213 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-06 23:51:31,213 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-06 23:51:31,213 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-06 23:51:31,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-06 23:51:31,214 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-06 23:51:31,214 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-06 23:51:31,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-06 23:51:31,214 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-06 23:51:31,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-06 23:51:31,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-06 23:51:31,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-06 23:51:31,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-06 23:51:31,215 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-06 23:51:31,215 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-06 23:51:31,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-06 23:51:31,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-06 23:51:31,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-06 23:51:31,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-06 23:51:31,216 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-06 23:51:31,216 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux
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 -> 4b2397f02ca31d86bec1660af6a105f36402aae0113477a6332673f13a213eff
[2024-11-06 23:51:31,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-06 23:51:31,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-06 23:51:31,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-06 23:51:31,522 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-06 23:51:31,522 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-06 23:51:31,523 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_1b.c
[2024-11-06 23:51:32,777 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-06 23:51:32,994 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-06 23:51:32,996 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_1b.c
[2024-11-06 23:51:33,003 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9f44493a3/f0977c2c99ea40db836e309ef550e0dd/FLAG88eac819f
[2024-11-06 23:51:33,022 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9f44493a3/f0977c2c99ea40db836e309ef550e0dd
[2024-11-06 23:51:33,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-06 23:51:33,026 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-06 23:51:33,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-06 23:51:33,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-06 23:51:33,032 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-06 23:51:33,033 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:51:33" (1/1) ...
[2024-11-06 23:51:33,036 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b0d4d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:51:33, skipping insertion in model container
[2024-11-06 23:51:33,036 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:51:33" (1/1) ...
[2024-11-06 23:51:33,047 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-06 23:51:33,172 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_1b.c[1277,1290]
[2024-11-06 23:51:33,176 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-06 23:51:33,182 INFO L200 MainTranslator]: Completed pre-run
[2024-11-06 23:51:33,192 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_1b.c[1277,1290]
[2024-11-06 23:51:33,193 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-06 23:51:33,204 INFO L204 MainTranslator]: Completed translation
[2024-11-06 23:51:33,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:51:33 WrapperNode
[2024-11-06 23:51:33,205 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-06 23:51:33,206 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-06 23:51:33,207 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-06 23:51:33,207 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-06 23:51:33,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:51:33" (1/1) ...
[2024-11-06 23:51:33,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:51:33" (1/1) ...
[2024-11-06 23:51:33,230 INFO L138 Inliner]: procedures = 12, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24
[2024-11-06 23:51:33,231 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-06 23:51:33,231 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-06 23:51:33,231 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-06 23:51:33,231 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-06 23:51:33,239 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:51:33" (1/1) ...
[2024-11-06 23:51:33,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:51:33" (1/1) ...
[2024-11-06 23:51:33,241 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:51:33" (1/1) ...
[2024-11-06 23:51:33,252 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 2 writes are split as follows [0, 2].
[2024-11-06 23:51:33,253 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:51:33" (1/1) ...
[2024-11-06 23:51:33,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:51:33" (1/1) ...
[2024-11-06 23:51:33,257 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:51:33" (1/1) ...
[2024-11-06 23:51:33,259 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:51:33" (1/1) ...
[2024-11-06 23:51:33,260 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:51:33" (1/1) ...
[2024-11-06 23:51:33,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:51:33" (1/1) ...
[2024-11-06 23:51:33,264 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-06 23:51:33,265 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-06 23:51:33,265 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-06 23:51:33,265 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-06 23:51:33,266 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:51:33" (1/1) ...
[2024-11-06 23:51:33,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-06 23:51:33,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-06 23:51:33,298 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-06 23:51:33,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-06 23:51:33,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0
[2024-11-06 23:51:33,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1
[2024-11-06 23:51:33,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-06 23:51:33,322 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_19_to_19_0
[2024-11-06 23:51:33,322 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_19_to_19_0
[2024-11-06 23:51:33,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-06 23:51:33,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-06 23:51:33,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0
[2024-11-06 23:51:33,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1
[2024-11-06 23:51:33,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-06 23:51:33,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1
[2024-11-06 23:51:33,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-11-06 23:51:33,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-11-06 23:51:33,385 INFO L238 CfgBuilder]: Building ICFG
[2024-11-06 23:51:33,386 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-06 23:51:33,459 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live.
[2024-11-06 23:51:33,459 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-06 23:51:33,467 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-06 23:51:33,468 INFO L316 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-06 23:51:33,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:51:33 BoogieIcfgContainer
[2024-11-06 23:51:33,469 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-06 23:51:33,472 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-06 23:51:33,473 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-06 23:51:33,477 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-06 23:51:33,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:51:33" (1/3) ...
[2024-11-06 23:51:33,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f85e203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:51:33, skipping insertion in model container
[2024-11-06 23:51:33,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:51:33" (2/3) ...
[2024-11-06 23:51:33,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f85e203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:51:33, skipping insertion in model container
[2024-11-06 23:51:33,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:51:33" (3/3) ...
[2024-11-06 23:51:33,481 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_1b.c
[2024-11-06 23:51:33,495 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-06 23:51:33,495 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-06 23:51:33,538 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-06 23:51:33,551 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;@33879eeb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-06 23:51:33,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-06 23:51:33,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-06 23:51:33,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2024-11-06 23:51:33,562 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-06 23:51:33,563 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 23:51:33,563 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 23:51:33,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 23:51:33,568 INFO L85 PathProgramCache]: Analyzing trace with hash -238646374, now seen corresponding path program 1 times
[2024-11-06 23:51:33,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-06 23:51:33,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130327052]
[2024-11-06 23:51:33,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 23:51:33,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-06 23:51:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 23:51:33,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-06 23:51:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 23:51:34,043 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-06 23:51:34,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-06 23:51:34,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130327052]
[2024-11-06 23:51:34,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130327052] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 23:51:34,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 23:51:34,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-06 23:51:34,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45465016]
[2024-11-06 23:51:34,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 23:51:34,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-06 23:51:34,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-06 23:51:34,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-06 23:51:34,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-06 23:51:34,066 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-06 23:51:34,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 23:51:34,151 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions.
[2024-11-06 23:51:34,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-06 23:51:34,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10
[2024-11-06 23:51:34,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 23:51:34,159 INFO L225 Difference]: With dead ends: 26
[2024-11-06 23:51:34,159 INFO L226 Difference]: Without dead ends: 14
[2024-11-06 23:51:34,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-11-06 23:51:34,166 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-06 23:51:34,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 51 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-06 23:51:34,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states.
[2024-11-06 23:51:34,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14.
[2024-11-06 23:51:34,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2024-11-06 23:51:34,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions.
[2024-11-06 23:51:34,198 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10
[2024-11-06 23:51:34,198 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-06 23:51:34,198 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions.
[2024-11-06 23:51:34,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-06 23:51:34,198 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions.
[2024-11-06 23:51:34,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2024-11-06 23:51:34,199 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-06 23:51:34,200 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 23:51:34,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-06 23:51:34,200 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 23:51:34,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 23:51:34,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1470993118, now seen corresponding path program 1 times
[2024-11-06 23:51:34,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-06 23:51:34,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999438527]
[2024-11-06 23:51:34,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 23:51:34,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-06 23:51:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 23:51:34,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-06 23:51:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 23:51:34,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-06 23:51:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 23:51:34,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-06 23:51:34,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-06 23:51:34,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999438527]
[2024-11-06 23:51:34,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999438527] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-06 23:51:34,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196271266]
[2024-11-06 23:51:34,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 23:51:34,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-06 23:51:34,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-06 23:51:34,715 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-06 23:51:34,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-06 23:51:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 23:51:34,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 14 conjuncts are in the unsatisfiable core
[2024-11-06 23:51:34,779 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 23:51:34,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-11-06 23:51:34,854 WARN L873 $PredicateComparison]: unable to prove that (exists ((func_to_recursive_line_19_to_19_0_~a.offset Int)) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_func_to_recursive_line_19_to_19_0_#in~a.base| (let ((.cse0 (select |c_old(#memory_int#1)| |c_func_to_recursive_line_19_to_19_0_#in~a.base|))) (store .cse0 func_to_recursive_line_19_to_19_0_~a.offset (+ (select .cse0 func_to_recursive_line_19_to_19_0_~a.offset) 1)))))) is different from true
[2024-11-06 23:51:34,915 INFO L349 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size
[2024-11-06 23:51:34,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 32
[2024-11-06 23:51:34,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11
[2024-11-06 23:51:34,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked.
[2024-11-06 23:51:34,989 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-06 23:51:35,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196271266] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-06 23:51:35,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-06 23:51:35,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13
[2024-11-06 23:51:35,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051009749]
[2024-11-06 23:51:35,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-06 23:51:35,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2024-11-06 23:51:35,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-06 23:51:35,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2024-11-06 23:51:35,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=174, Unknown=1, NotChecked=26, Total=240
[2024-11-06 23:51:35,122 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 13 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4)
[2024-11-06 23:51:35,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 23:51:35,303 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions.
[2024-11-06 23:51:35,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-06 23:51:35,304 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 15
[2024-11-06 23:51:35,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 23:51:35,305 INFO L225 Difference]: With dead ends: 20
[2024-11-06 23:51:35,305 INFO L226 Difference]: Without dead ends: 16
[2024-11-06 23:51:35,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=283, Unknown=1, NotChecked=34, Total=380
[2024-11-06 23:51:35,307 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-06 23:51:35,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 54 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 14 Unchecked, 0.1s Time]
[2024-11-06 23:51:35,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states.
[2024-11-06 23:51:35,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16.
[2024-11-06 23:51:35,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-06 23:51:35,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions.
[2024-11-06 23:51:35,314 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 15
[2024-11-06 23:51:35,314 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-06 23:51:35,314 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions.
[2024-11-06 23:51:35,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4)
[2024-11-06 23:51:35,314 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions.
[2024-11-06 23:51:35,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2024-11-06 23:51:35,315 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-06 23:51:35,315 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 23:51:35,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-11-06 23:51:35,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-06 23:51:35,519 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 23:51:35,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 23:51:35,521 INFO L85 PathProgramCache]: Analyzing trace with hash 109140884, now seen corresponding path program 2 times
[2024-11-06 23:51:35,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-06 23:51:35,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332787820]
[2024-11-06 23:51:35,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 23:51:35,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-06 23:51:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 23:51:35,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-06 23:51:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 23:51:35,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-06 23:51:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 23:51:36,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-06 23:51:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 23:51:36,094 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-11-06 23:51:36,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-06 23:51:36,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332787820]
[2024-11-06 23:51:36,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332787820] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-06 23:51:36,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604440909]
[2024-11-06 23:51:36,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-06 23:51:36,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-06 23:51:36,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-06 23:51:36,097 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-06 23:51:36,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-06 23:51:36,165 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-06 23:51:36,166 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-06 23:51:36,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 26 conjuncts are in the unsatisfiable core
[2024-11-06 23:51:36,169 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 23:51:36,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-11-06 23:51:36,296 WARN L873 $PredicateComparison]: unable to prove that (exists ((func_to_recursive_line_19_to_19_0_~a.offset Int)) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_func_to_recursive_line_19_to_19_0_#in~a.base| (let ((.cse0 (select |c_old(#memory_int#1)| |c_func_to_recursive_line_19_to_19_0_#in~a.base|))) (store .cse0 func_to_recursive_line_19_to_19_0_~a.offset (+ (select .cse0 func_to_recursive_line_19_to_19_0_~a.offset) 2)))))) is different from true
[2024-11-06 23:51:36,329 INFO L349 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size
[2024-11-06 23:51:36,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 32
[2024-11-06 23:51:36,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11
[2024-11-06 23:51:36,386 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked.
[2024-11-06 23:51:36,386 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-06 23:51:36,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604440909] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-06 23:51:36,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-06 23:51:36,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19
[2024-11-06 23:51:36,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533879742]
[2024-11-06 23:51:36,567 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-06 23:51:36,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2024-11-06 23:51:36,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-06 23:51:36,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2024-11-06 23:51:36,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=343, Unknown=1, NotChecked=38, Total=462
[2024-11-06 23:51:36,569 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 19 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 17 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6)
[2024-11-06 23:51:36,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 23:51:36,716 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions.
[2024-11-06 23:51:36,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-11-06 23:51:36,717 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 17 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 20
[2024-11-06 23:51:36,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 23:51:36,718 INFO L225 Difference]: With dead ends: 26
[2024-11-06 23:51:36,718 INFO L226 Difference]: Without dead ends: 20
[2024-11-06 23:51:36,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=418, Unknown=1, NotChecked=42, Total=552
[2024-11-06 23:51:36,719 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-06 23:51:36,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 58 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 23 Unchecked, 0.1s Time]
[2024-11-06 23:51:36,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states.
[2024-11-06 23:51:36,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20.
[2024-11-06 23:51:36,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6)
[2024-11-06 23:51:36,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions.
[2024-11-06 23:51:36,726 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 20
[2024-11-06 23:51:36,726 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-06 23:51:36,726 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions.
[2024-11-06 23:51:36,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 17 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6)
[2024-11-06 23:51:36,726 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions.
[2024-11-06 23:51:36,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2024-11-06 23:51:36,727 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-06 23:51:36,727 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 23:51:36,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-06 23:51:36,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-06 23:51:36,932 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 23:51:36,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 23:51:36,932 INFO L85 PathProgramCache]: Analyzing trace with hash 242710158, now seen corresponding path program 3 times
[2024-11-06 23:51:36,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-06 23:51:36,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25730735]
[2024-11-06 23:51:36,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 23:51:36,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-06 23:51:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 23:51:37,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-06 23:51:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 23:51:37,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-06 23:51:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 23:51:37,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-06 23:51:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 23:51:37,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-06 23:51:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 23:51:37,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-06 23:51:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 23:51:37,856 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2024-11-06 23:51:37,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-06 23:51:37,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25730735]
[2024-11-06 23:51:37,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25730735] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-06 23:51:37,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093376625]
[2024-11-06 23:51:37,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-06 23:51:37,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-06 23:51:37,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-06 23:51:37,859 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-06 23:51:37,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-06 23:51:37,924 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2024-11-06 23:51:37,924 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-06 23:51:37,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 64 conjuncts are in the unsatisfiable core
[2024-11-06 23:51:37,929 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 23:51:37,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-11-06 23:51:38,251 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2024-11-06 23:51:38,251 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-06 23:51:39,774 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-06 23:51:39,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093376625] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-06 23:51:39,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-06 23:51:39,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 22] total 38
[2024-11-06 23:51:39,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436552417]
[2024-11-06 23:51:39,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-06 23:51:39,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states
[2024-11-06 23:51:39,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-06 23:51:39,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants.
[2024-11-06 23:51:39,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1149, Unknown=0, NotChecked=0, Total=1406
[2024-11-06 23:51:39,780 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 38 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 32 states have internal predecessors, (37), 10 states have call successors, (10), 6 states have call predecessors, (10), 11 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15)
[2024-11-06 23:51:40,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 23:51:40,078 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions.
[2024-11-06 23:51:40,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-11-06 23:51:40,078 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 32 states have internal predecessors, (37), 10 states have call successors, (10), 6 states have call predecessors, (10), 11 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15) Word has length 30
[2024-11-06 23:51:40,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 23:51:40,079 INFO L225 Difference]: With dead ends: 28
[2024-11-06 23:51:40,079 INFO L226 Difference]: Without dead ends: 24
[2024-11-06 23:51:40,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=379, Invalid=1601, Unknown=0, NotChecked=0, Total=1980
[2024-11-06 23:51:40,081 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-06 23:51:40,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 146 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-06 23:51:40,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states.
[2024-11-06 23:51:40,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24.
[2024-11-06 23:51:40,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8)
[2024-11-06 23:51:40,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions.
[2024-11-06 23:51:40,087 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 30
[2024-11-06 23:51:40,087 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-06 23:51:40,087 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions.
[2024-11-06 23:51:40,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 32 states have internal predecessors, (37), 10 states have call successors, (10), 6 states have call predecessors, (10), 11 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15)
[2024-11-06 23:51:40,088 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions.
[2024-11-06 23:51:40,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2024-11-06 23:51:40,088 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-06 23:51:40,088 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 23:51:40,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-11-06 23:51:40,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-06 23:51:40,293 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 23:51:40,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 23:51:40,293 INFO L85 PathProgramCache]: Analyzing trace with hash -484615032, now seen corresponding path program 4 times
[2024-11-06 23:51:40,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-06 23:51:40,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294767524]
[2024-11-06 23:51:40,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 23:51:40,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-06 23:51:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-06 23:51:40,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-06 23:51:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-06 23:51:40,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-06 23:51:40,350 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-06 23:51:40,351 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-06 23:51:40,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-06 23:51:40,355 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1]
[2024-11-06 23:51:40,383 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-06 23:51:40,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:51:40 BoogieIcfgContainer
[2024-11-06 23:51:40,386 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-06 23:51:40,386 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-06 23:51:40,386 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-06 23:51:40,387 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-06 23:51:40,388 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:51:33" (3/4) ...
[2024-11-06 23:51:40,388 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample
[2024-11-06 23:51:40,431 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-06 23:51:40,432 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-06 23:51:40,433 INFO L158 Benchmark]: Toolchain (without parser) took 7406.69ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 92.7MB in the beginning and 66.4MB in the end (delta: 26.3MB). Peak memory consumption was 98.2MB. Max. memory is 16.1GB.
[2024-11-06 23:51:40,433 INFO L158 Benchmark]: CDTParser took 0.71ms. Allocated memory is still 117.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-06 23:51:40,433 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.43ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 82.0MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-06 23:51:40,433 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.31ms. Allocated memory is still 117.4MB. Free memory was 82.0MB in the beginning and 80.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-06 23:51:40,434 INFO L158 Benchmark]: Boogie Preprocessor took 33.47ms. Allocated memory is still 117.4MB. Free memory was 80.9MB in the beginning and 79.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-06 23:51:40,434 INFO L158 Benchmark]: RCFGBuilder took 203.95ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 70.6MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-06 23:51:40,434 INFO L158 Benchmark]: TraceAbstraction took 6913.35ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 70.0MB in the beginning and 68.3MB in the end (delta: 1.7MB). Peak memory consumption was 73.0MB. Max. memory is 16.1GB.
[2024-11-06 23:51:40,435 INFO L158 Benchmark]: Witness Printer took 45.37ms. Allocated memory is still 192.9MB. Free memory was 68.3MB in the beginning and 66.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-06 23:51:40,436 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.71ms. Allocated memory is still 117.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 177.43ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 82.0MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 24.31ms. Allocated memory is still 117.4MB. Free memory was 82.0MB in the beginning and 80.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 33.47ms. Allocated memory is still 117.4MB. Free memory was 80.9MB in the beginning and 79.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 203.95ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 70.6MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* TraceAbstraction took 6913.35ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 70.0MB in the beginning and 68.3MB in the end (delta: 1.7MB). Peak memory consumption was 73.0MB. Max. memory is 16.1GB.
* Witness Printer took 45.37ms. Allocated memory is still 192.9MB. Free memory was 68.3MB in the beginning and 66.4MB in the end (delta: 1.9MB). There was no memory consumed. 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: 48]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L41] int a = 6;
[L41] int a = 6;
[L43] a = 0
[L44] CALL func_to_recursive_line_19_to_19_0(&a)
VAL [\old(a)={7:0}]
[L25] EXPR \read(*a)
VAL [\old(a)={7:0}, a={7:0}]
[L25] COND TRUE (*a) < 6
[L30] EXPR \read(*a)
[L30] ++(*a)
[L30] ++(*a)
[L32] CALL func_to_recursive_line_19_to_19_0(a)
VAL [\old(a)={7:0}]
[L25] EXPR \read(*a)
VAL [\old(a)={7:0}, a={7:0}]
[L25] COND TRUE (*a) < 6
[L30] EXPR \read(*a)
[L30] ++(*a)
[L30] ++(*a)
[L32] CALL func_to_recursive_line_19_to_19_0(a)
VAL [\old(a)={7:0}]
[L25] EXPR \read(*a)
VAL [\old(a)={7:0}, a={7:0}]
[L25] COND TRUE (*a) < 6
[L30] EXPR \read(*a)
[L30] ++(*a)
[L30] ++(*a)
[L32] CALL func_to_recursive_line_19_to_19_0(a)
VAL [\old(a)={7:0}]
[L25] EXPR \read(*a)
VAL [\old(a)={7:0}, a={7:0}]
[L25] COND TRUE (*a) < 6
[L30] EXPR \read(*a)
[L30] ++(*a)
[L30] ++(*a)
[L32] CALL func_to_recursive_line_19_to_19_0(a)
VAL [\old(a)={7:0}]
[L25] EXPR \read(*a)
VAL [\old(a)={7:0}, a={7:0}]
[L25] COND TRUE (*a) < 6
[L30] EXPR \read(*a)
[L30] ++(*a)
[L30] ++(*a)
[L32] CALL func_to_recursive_line_19_to_19_0(a)
VAL [\old(a)={7:0}]
[L25] EXPR \read(*a)
VAL [\old(a)={7:0}, a={7:0}]
[L25] COND TRUE (*a) < 6
[L30] EXPR \read(*a)
[L30] ++(*a)
[L30] ++(*a)
[L32] CALL func_to_recursive_line_19_to_19_0(a)
VAL [\old(a)={7:0}]
[L25] EXPR \read(*a)
VAL [\old(a)={7:0}, a={7:0}]
[L25] COND FALSE !((*a) < 6)
[L32] RET func_to_recursive_line_19_to_19_0(a)
VAL [\old(a)={7:0}, a={7:0}]
[L32] RET func_to_recursive_line_19_to_19_0(a)
VAL [\old(a)={7:0}, a={7:0}]
[L32] RET func_to_recursive_line_19_to_19_0(a)
VAL [\old(a)={7:0}, a={7:0}]
[L32] RET func_to_recursive_line_19_to_19_0(a)
VAL [\old(a)={7:0}, a={7:0}]
[L32] RET func_to_recursive_line_19_to_19_0(a)
VAL [\old(a)={7:0}, a={7:0}]
[L32] RET func_to_recursive_line_19_to_19_0(a)
VAL [\old(a)={7:0}, a={7:0}]
[L44] RET func_to_recursive_line_19_to_19_0(&a)
VAL [a={7:0}]
[L46] EXPR \read(a)
[L46] COND TRUE a == 6
[L48] reach_error()
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 5, TraceHistogramMax: 7, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 309 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 37 IncrementalHoareTripleChecker+Unchecked, 263 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 331 IncrementalHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 46 mSDtfsCounter, 331 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 74 SyntacticMatches, 4 SemanticMatches, 89 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=4, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 162 ConstructedInterpolants, 5 QuantifiedInterpolants, 1526 SizeOfPredicates, 23 NumberOfNonLiveVariables, 310 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 53/172 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-11-06 23:51:40,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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