./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/test25-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/ldv-regression/test25-1.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 de251549242251e9f54823879039d01198e32edde0d5daa52ae9e52ec83fdcc8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:30:05,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:30:05,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 14:30:05,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:30:05,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:30:05,283 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:30:05,284 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:30:05,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:30:05,285 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:30:05,285 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:30:05,286 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:30:05,286 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:30:05,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:30:05,287 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:30:05,287 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:30:05,287 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:30:05,287 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:30:05,287 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:30:05,287 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:30:05,288 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:30:05,288 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:30:05,288 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:30:05,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:30:05,288 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:30:05,288 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:30:05,288 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:30:05,288 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:30:05,288 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:30:05,288 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:30:05,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:30:05,289 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:30:05,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:30:05,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:30:05,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:30:05,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:30:05,289 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:30:05,289 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:30:05,289 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:30:05,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:30:05,290 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:30:05,290 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:30:05,290 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:30:05,290 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:30:05,290 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 -> de251549242251e9f54823879039d01198e32edde0d5daa52ae9e52ec83fdcc8 [2025-02-05 14:30:05,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:30:05,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:30:05,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:30:05,531 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:30:05,532 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:30:05,534 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test25-1.c [2025-02-05 14:30:06,670 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f0006fd8/eff53cab4c9b4df094b0d302760c952b/FLAG429afba0a [2025-02-05 14:30:06,976 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:30:06,977 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-regression/test25-1.c [2025-02-05 14:30:06,983 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f0006fd8/eff53cab4c9b4df094b0d302760c952b/FLAG429afba0a [2025-02-05 14:30:07,261 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f0006fd8/eff53cab4c9b4df094b0d302760c952b [2025-02-05 14:30:07,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:30:07,266 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:30:07,267 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:30:07,267 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:30:07,271 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:30:07,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:30:07" (1/1) ... [2025-02-05 14:30:07,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23309820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:07, skipping insertion in model container [2025-02-05 14:30:07,272 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:30:07" (1/1) ... [2025-02-05 14:30:07,289 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:30:07,402 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/ldv-regression/test25-1.c[936,949] [2025-02-05 14:30:07,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:30:07,412 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:30:07,427 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/ldv-regression/test25-1.c[936,949] [2025-02-05 14:30:07,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:30:07,441 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:30:07,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:07 WrapperNode [2025-02-05 14:30:07,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:30:07,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:30:07,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:30:07,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:30:07,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:07" (1/1) ... [2025-02-05 14:30:07,459 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:07" (1/1) ... [2025-02-05 14:30:07,482 INFO L138 Inliner]: procedures = 16, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 90 [2025-02-05 14:30:07,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:30:07,485 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:30:07,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:30:07,486 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:30:07,492 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:07" (1/1) ... [2025-02-05 14:30:07,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:07" (1/1) ... [2025-02-05 14:30:07,495 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:07" (1/1) ... [2025-02-05 14:30:07,510 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 6, 4]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2025-02-05 14:30:07,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:07" (1/1) ... [2025-02-05 14:30:07,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:07" (1/1) ... [2025-02-05 14:30:07,521 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:07" (1/1) ... [2025-02-05 14:30:07,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:07" (1/1) ... [2025-02-05 14:30:07,526 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:07" (1/1) ... [2025-02-05 14:30:07,526 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:07" (1/1) ... [2025-02-05 14:30:07,527 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:30:07,532 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:30:07,532 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:30:07,532 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:30:07,533 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:07" (1/1) ... [2025-02-05 14:30:07,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:30:07,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:30:07,560 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) [2025-02-05 14:30:07,564 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 [2025-02-05 14:30:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 14:30:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 14:30:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-05 14:30:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:30:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:30:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 14:30:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 14:30:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 14:30:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 14:30:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-05 14:30:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 14:30:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 14:30:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 14:30:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 14:30:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:30:07,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:30:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 14:30:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 14:30:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 14:30:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 14:30:07,671 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:30:07,673 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:30:07,833 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L21: call ULTIMATE.dealloc(main_~#cont~0#1.base, main_~#cont~0#1.offset);havoc main_~#cont~0#1.base, main_~#cont~0#1.offset;call ULTIMATE.dealloc(main_~#array~0#1.base, main_~#array~0#1.offset);havoc main_~#array~0#1.base, main_~#array~0#1.offset; [2025-02-05 14:30:07,834 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16: havoc check_#t~mem4#1.base, check_#t~mem4#1.offset;havoc check_#t~mem5#1; [2025-02-05 14:30:07,841 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-02-05 14:30:07,842 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:30:07,851 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:30:07,851 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:30:07,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:30:07 BoogieIcfgContainer [2025-02-05 14:30:07,852 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:30:07,853 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:30:07,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:30:07,857 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:30:07,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:30:07" (1/3) ... [2025-02-05 14:30:07,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39562da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:30:07, skipping insertion in model container [2025-02-05 14:30:07,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:07" (2/3) ... [2025-02-05 14:30:07,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39562da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:30:07, skipping insertion in model container [2025-02-05 14:30:07,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:30:07" (3/3) ... [2025-02-05 14:30:07,859 INFO L128 eAbstractionObserver]: Analyzing ICFG test25-1.c [2025-02-05 14:30:07,873 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:30:07,875 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test25-1.c that has 1 procedures, 16 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 14:30:07,914 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:30:07,923 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;@c3359af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:30:07,923 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 14:30:07,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:30:07,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-05 14:30:07,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:30:07,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:30:07,931 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:30:07,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:30:07,937 INFO L85 PathProgramCache]: Analyzing trace with hash -743510538, now seen corresponding path program 1 times [2025-02-05 14:30:07,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:30:07,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264958857] [2025-02-05 14:30:07,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:30:07,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:30:08,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-05 14:30:08,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-05 14:30:08,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:30:08,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:30:08,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:30:08,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:30:08,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264958857] [2025-02-05 14:30:08,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264958857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:30:08,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:30:08,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:30:08,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962444171] [2025-02-05 14:30:08,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:30:08,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:30:08,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:30:08,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:30:08,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:30:08,172 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:30:08,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:30:08,200 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2025-02-05 14:30:08,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:30:08,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-05 14:30:08,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:30:08,207 INFO L225 Difference]: With dead ends: 30 [2025-02-05 14:30:08,207 INFO L226 Difference]: Without dead ends: 13 [2025-02-05 14:30:08,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:30:08,213 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:30:08,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:30:08,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-02-05 14:30:08,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-02-05 14:30:08,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:30:08,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2025-02-05 14:30:08,240 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2025-02-05 14:30:08,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:30:08,242 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2025-02-05 14:30:08,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:30:08,242 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2025-02-05 14:30:08,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 14:30:08,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:30:08,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:30:08,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 14:30:08,243 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:30:08,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:30:08,244 INFO L85 PathProgramCache]: Analyzing trace with hash -838512108, now seen corresponding path program 1 times [2025-02-05 14:30:08,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:30:08,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615418263] [2025-02-05 14:30:08,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:30:08,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:30:08,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 14:30:08,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 14:30:08,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:30:08,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:30:08,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:30:08,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:30:08,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615418263] [2025-02-05 14:30:08,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615418263] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:30:08,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252954060] [2025-02-05 14:30:08,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:30:08,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:30:08,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:30:08,381 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) [2025-02-05 14:30:08,383 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 [2025-02-05 14:30:08,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 14:30:08,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 14:30:08,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:30:08,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:30:08,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 14:30:08,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:30:08,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:30:08,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:30:08,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:30:08,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252954060] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:30:08,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:30:08,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-05 14:30:08,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502769573] [2025-02-05 14:30:08,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:30:08,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 14:30:08,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:30:08,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 14:30:08,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:30:08,542 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:30:08,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:30:08,561 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2025-02-05 14:30:08,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 14:30:08,561 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-05 14:30:08,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:30:08,561 INFO L225 Difference]: With dead ends: 25 [2025-02-05 14:30:08,562 INFO L226 Difference]: Without dead ends: 16 [2025-02-05 14:30:08,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:30:08,562 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:30:08,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:30:08,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-02-05 14:30:08,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-02-05 14:30:08,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:30:08,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2025-02-05 14:30:08,565 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2025-02-05 14:30:08,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:30:08,565 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2025-02-05 14:30:08,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:30:08,565 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2025-02-05 14:30:08,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-05 14:30:08,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:30:08,565 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:30:08,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 14:30:08,766 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 [2025-02-05 14:30:08,766 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:30:08,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:30:08,767 INFO L85 PathProgramCache]: Analyzing trace with hash -767394419, now seen corresponding path program 2 times [2025-02-05 14:30:08,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:30:08,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069962050] [2025-02-05 14:30:08,767 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:30:08,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:30:08,790 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-02-05 14:30:08,815 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 15 statements. [2025-02-05 14:30:08,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 14:30:08,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:30:09,081 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 14:30:09,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:30:09,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069962050] [2025-02-05 14:30:09,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069962050] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:30:09,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:30:09,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 14:30:09,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53023856] [2025-02-05 14:30:09,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:30:09,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:30:09,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:30:09,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:30:09,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:30:09,083 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:30:09,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:30:09,122 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2025-02-05 14:30:09,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:30:09,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-05 14:30:09,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:30:09,123 INFO L225 Difference]: With dead ends: 23 [2025-02-05 14:30:09,123 INFO L226 Difference]: Without dead ends: 18 [2025-02-05 14:30:09,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 14:30:09,124 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:30:09,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 26 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:30:09,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-02-05 14:30:09,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-02-05 14:30:09,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:30:09,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2025-02-05 14:30:09,129 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2025-02-05 14:30:09,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:30:09,129 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2025-02-05 14:30:09,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:30:09,130 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2025-02-05 14:30:09,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 14:30:09,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:30:09,131 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:30:09,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 14:30:09,131 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:30:09,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:30:09,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1990283508, now seen corresponding path program 1 times [2025-02-05 14:30:09,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:30:09,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156148518] [2025-02-05 14:30:09,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:30:09,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:30:09,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 14:30:09,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 14:30:09,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:30:09,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:30:09,282 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 14:30:09,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:30:09,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156148518] [2025-02-05 14:30:09,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156148518] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:30:09,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300249970] [2025-02-05 14:30:09,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:30:09,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:30:09,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:30:09,285 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) [2025-02-05 14:30:09,287 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 [2025-02-05 14:30:09,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 14:30:09,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 14:30:09,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:30:09,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:30:09,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 14:30:09,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:30:09,405 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 14:30:09,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:30:09,457 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 14:30:09,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300249970] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:30:09,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:30:09,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-05 14:30:09,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755611758] [2025-02-05 14:30:09,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:30:09,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 14:30:09,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:30:09,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 14:30:09,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-05 14:30:09,459 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:30:09,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:30:09,479 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2025-02-05 14:30:09,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 14:30:09,480 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-05 14:30:09,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:30:09,480 INFO L225 Difference]: With dead ends: 35 [2025-02-05 14:30:09,480 INFO L226 Difference]: Without dead ends: 24 [2025-02-05 14:30:09,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-05 14:30:09,485 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:30:09,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:30:09,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-05 14:30:09,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-02-05 14:30:09,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:30:09,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2025-02-05 14:30:09,490 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 17 [2025-02-05 14:30:09,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:30:09,490 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2025-02-05 14:30:09,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:30:09,490 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2025-02-05 14:30:09,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 14:30:09,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:30:09,490 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:30:09,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 14:30:09,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:30:09,697 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:30:09,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:30:09,698 INFO L85 PathProgramCache]: Analyzing trace with hash -598120020, now seen corresponding path program 2 times [2025-02-05 14:30:09,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:30:09,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879083374] [2025-02-05 14:30:09,698 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:30:09,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:30:09,756 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-05 14:30:09,833 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 14:30:09,833 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:30:09,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:30:10,176 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-05 14:30:10,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:30:10,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879083374] [2025-02-05 14:30:10,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879083374] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:30:10,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664954221] [2025-02-05 14:30:10,177 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:30:10,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:30:10,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:30:10,179 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) [2025-02-05 14:30:10,180 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 [2025-02-05 14:30:10,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-05 14:30:10,320 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 14:30:10,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:30:10,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:30:10,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-05 14:30:10,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:30:10,703 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 25 treesize of output 9 [2025-02-05 14:30:10,725 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:30:10,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:30:10,807 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-02-05 14:30:10,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2025-02-05 14:30:10,815 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-05 14:30:10,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664954221] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:30:10,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:30:10,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 16, 6] total 23 [2025-02-05 14:30:10,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420126380] [2025-02-05 14:30:10,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:30:10,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 14:30:10,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:30:10,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 14:30:10,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2025-02-05 14:30:10,819 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 23 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:30:11,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:30:11,107 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2025-02-05 14:30:11,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 14:30:11,108 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-05 14:30:11,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:30:11,108 INFO L225 Difference]: With dead ends: 35 [2025-02-05 14:30:11,108 INFO L226 Difference]: Without dead ends: 30 [2025-02-05 14:30:11,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2025-02-05 14:30:11,109 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 14:30:11,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 83 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 14:30:11,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-05 14:30:11,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-02-05 14:30:11,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:30:11,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2025-02-05 14:30:11,116 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 23 [2025-02-05 14:30:11,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:30:11,116 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2025-02-05 14:30:11,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:30:11,117 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2025-02-05 14:30:11,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 14:30:11,117 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:30:11,117 INFO L218 NwaCegarLoop]: trace histogram [10, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:30:11,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 14:30:11,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:30:11,322 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:30:11,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:30:11,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1260064855, now seen corresponding path program 3 times [2025-02-05 14:30:11,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:30:11,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606677246] [2025-02-05 14:30:11,323 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 14:30:11,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:30:11,343 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 6 equivalence classes. [2025-02-05 14:30:11,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 27 of 29 statements. [2025-02-05 14:30:11,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-05 14:30:11,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:30:11,802 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-05 14:30:11,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:30:11,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606677246] [2025-02-05 14:30:11,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606677246] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:30:11,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141493057] [2025-02-05 14:30:11,803 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 14:30:11,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:30:11,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:30:11,805 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:30:11,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 14:30:11,890 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 6 equivalence classes. [2025-02-05 14:30:20,438 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 27 of 29 statements. [2025-02-05 14:30:20,439 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-05 14:30:20,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:30:20,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-05 14:30:20,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:30:20,717 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 25 treesize of output 9 [2025-02-05 14:30:20,731 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-05 14:30:20,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:30:20,853 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-02-05 14:30:20,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2025-02-05 14:30:20,874 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-05 14:30:20,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141493057] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:30:20,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:30:20,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 25 [2025-02-05 14:30:20,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131802113] [2025-02-05 14:30:20,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:30:20,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 14:30:20,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:30:20,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 14:30:20,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2025-02-05 14:30:20,878 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 25 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:30:21,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:30:21,151 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2025-02-05 14:30:21,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-05 14:30:21,152 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-05 14:30:21,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:30:21,153 INFO L225 Difference]: With dead ends: 47 [2025-02-05 14:30:21,153 INFO L226 Difference]: Without dead ends: 42 [2025-02-05 14:30:21,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=310, Invalid=950, Unknown=0, NotChecked=0, Total=1260 [2025-02-05 14:30:21,154 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:30:21,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:30:21,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-05 14:30:21,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-02-05 14:30:21,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.048780487804878) internal successors, (43), 41 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:30:21,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2025-02-05 14:30:21,169 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 29 [2025-02-05 14:30:21,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:30:21,169 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2025-02-05 14:30:21,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:30:21,169 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2025-02-05 14:30:21,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 14:30:21,170 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:30:21,170 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:30:21,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 14:30:21,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-05 14:30:21,371 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:30:21,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:30:21,371 INFO L85 PathProgramCache]: Analyzing trace with hash -949307805, now seen corresponding path program 4 times [2025-02-05 14:30:21,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:30:21,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502496353] [2025-02-05 14:30:21,371 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 14:30:21,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:30:21,398 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-02-05 14:30:21,503 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 14:30:21,503 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 14:30:21,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 14:30:21,503 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 14:30:21,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 14:30:21,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 14:30:21,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:30:21,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 14:30:21,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 14:30:21,570 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 14:30:21,571 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 14:30:21,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 14:30:21,575 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 1] [2025-02-05 14:30:21,603 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 14:30:21,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 02:30:21 BoogieIcfgContainer [2025-02-05 14:30:21,606 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 14:30:21,607 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 14:30:21,607 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 14:30:21,607 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 14:30:21,607 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:30:07" (3/4) ... [2025-02-05 14:30:21,608 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-05 14:30:21,648 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 39. [2025-02-05 14:30:21,702 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 14:30:21,703 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 14:30:21,703 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 14:30:21,703 INFO L158 Benchmark]: Toolchain (without parser) took 14437.16ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 133.2MB in the beginning and 94.6MB in the end (delta: 38.6MB). Peak memory consumption was 75.8MB. Max. memory is 16.1GB. [2025-02-05 14:30:21,703 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:30:21,704 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.01ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 121.6MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 14:30:21,704 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.37ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 120.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:30:21,704 INFO L158 Benchmark]: Boogie Preprocessor took 42.24ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 118.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 14:30:21,704 INFO L158 Benchmark]: IcfgBuilder took 319.83ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 104.9MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 14:30:21,704 INFO L158 Benchmark]: TraceAbstraction took 13752.84ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 104.5MB in the beginning and 103.0MB in the end (delta: 1.5MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. [2025-02-05 14:30:21,704 INFO L158 Benchmark]: Witness Printer took 95.97ms. Allocated memory is still 209.7MB. Free memory was 103.0MB in the beginning and 94.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 14:30:21,705 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.54ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.01ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 121.6MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.37ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 120.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.24ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 118.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 319.83ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 104.9MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13752.84ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 104.5MB in the beginning and 103.0MB in the end (delta: 1.5MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. * Witness Printer took 95.97ms. Allocated memory is still 209.7MB. Free memory was 103.0MB in the beginning and 94.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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: 47]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] struct cont cont; [L22] struct dummy array[10]; [L23] int i, *pa; [L24] i = __VERIFIER_nondet_int() [L26] int j = 0; VAL [array={5:0}, cont={6:0}, i=1, j=0] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={5:0}, cont={6:0}, i=1, j=1] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={5:0}, cont={6:0}, i=1, j=2] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={5:0}, cont={6:0}, i=1, j=3] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={5:0}, cont={6:0}, i=1, j=4] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={5:0}, cont={6:0}, i=1, j=5] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={5:0}, cont={6:0}, i=1, j=6] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={5:0}, cont={6:0}, i=1, j=7] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={5:0}, cont={6:0}, i=1, j=8] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={5:0}, cont={6:0}, i=1, j=9] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={5:0}, cont={6:0}, i=1, j=10] [L26] COND FALSE !(j < 10) [L31] COND TRUE i >= 0 && i < 9 [L32] cont.array = &array[i] [L33] EXPR cont.array [L33] pa = &cont.array[0].b [L34] EXPR cont.array [L34] EXPR cont.array[0].b [L34] COND TRUE cont.array[0].b > 0 [L35] EXPR array[i].b [L35] i = array[i].b - 10 [L36] COND TRUE i < *pa [L36] EXPR \read(*pa) [L36] COND TRUE i < *pa [L37] ++i VAL [cont={6:0}, i=8, pa={5:12}] [L36] COND TRUE i < *pa [L36] EXPR \read(*pa) [L36] COND TRUE i < *pa [L37] ++i VAL [cont={6:0}, i=9, pa={5:12}] [L36] COND TRUE i < *pa [L36] EXPR \read(*pa) [L36] COND TRUE i < *pa [L37] ++i VAL [cont={6:0}, i=10, pa={5:12}] [L36] COND TRUE i < *pa [L36] EXPR \read(*pa) [L36] COND TRUE i < *pa [L37] ++i VAL [cont={6:0}, i=11, pa={5:12}] [L36] COND TRUE i < *pa [L36] EXPR \read(*pa) [L36] COND TRUE i < *pa [L37] ++i VAL [cont={6:0}, i=12, pa={5:12}] [L36] COND TRUE i < *pa [L36] EXPR \read(*pa) [L36] COND TRUE i < *pa [L37] ++i VAL [cont={6:0}, i=13, pa={5:12}] [L36] COND TRUE i < *pa [L36] EXPR \read(*pa) [L36] COND TRUE i < *pa [L37] ++i VAL [cont={6:0}, i=14, pa={5:12}] [L36] COND TRUE i < *pa [L36] EXPR \read(*pa) [L36] COND TRUE i < *pa [L37] ++i VAL [cont={6:0}, i=15, pa={5:12}] [L36] COND TRUE i < *pa [L36] EXPR \read(*pa) [L36] COND TRUE i < *pa [L37] ++i VAL [cont={6:0}, i=16, pa={5:12}] [L36] COND TRUE i < *pa [L36] EXPR \read(*pa) [L36] COND TRUE i < *pa [L37] ++i VAL [cont={6:0}, i=17, pa={5:12}] [L36] COND TRUE i < *pa [L36] EXPR \read(*pa) [L36] COND FALSE !(i < *pa) [L39] CALL, EXPR check(&cont, i) [L16] EXPR pc->array [L16] EXPR pc->array[1].b [L16] return pc->array[1].b == i; [L39] RET, EXPR check(&cont, i) [L39] COND TRUE !check(&cont, i) [L47] reach_error() VAL [pa={5:12}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.7s, OverallIterations: 7, TraceHistogramMax: 11, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 264 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 196 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 396 IncrementalHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 68 mSDtfsCounter, 396 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 205 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=6, InterpolantAutomatonStates: 72, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 9.0s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 228 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 1129 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1093 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 282/445 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! [2025-02-05 14:30:21,719 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