./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/ex3_forlist.i --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/ex3_forlist.i -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 ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:29:19,621 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:29:19,674 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:29:19,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:29:19,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:29:19,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:29:19,705 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:29:19,705 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:29:19,705 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:29:19,706 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:29:19,706 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:29:19,706 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:29:19,707 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:29:19,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:29:19,707 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:29:19,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:29:19,707 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:29:19,707 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:29:19,707 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:29:19,707 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:29:19,707 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:29:19,707 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:29:19,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:29:19,707 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:29:19,707 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:29:19,707 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:29:19,707 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:29:19,707 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:29:19,707 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:29:19,707 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:29:19,707 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:29:19,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:29:19,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:29:19,708 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:29:19,708 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:29:19,708 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:29:19,708 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:29:19,708 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:29:19,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:29:19,708 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:29:19,708 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:29:19,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:29:19,708 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:29:19,708 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 -> ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e [2025-02-05 14:29:19,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:29:19,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:29:19,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:29:19,977 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:29:19,977 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:29:19,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2025-02-05 14:29:21,211 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b3110a1b6/0faa1a773e624db38f78632810e6d368/FLAG8f0cb9827 [2025-02-05 14:29:21,430 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:29:21,431 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2025-02-05 14:29:21,463 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b3110a1b6/0faa1a773e624db38f78632810e6d368/FLAG8f0cb9827 [2025-02-05 14:29:21,781 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b3110a1b6/0faa1a773e624db38f78632810e6d368 [2025-02-05 14:29:21,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:29:21,784 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:29:21,784 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:29:21,785 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:29:21,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:29:21,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:29:21" (1/1) ... [2025-02-05 14:29:21,789 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45a3c617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:29:21, skipping insertion in model container [2025-02-05 14:29:21,789 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:29:21" (1/1) ... [2025-02-05 14:29:21,798 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:29:21,885 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/ex3_forlist.i[293,306] [2025-02-05 14:29:21,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:29:21,913 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:29:21,920 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/ex3_forlist.i[293,306] [2025-02-05 14:29:21,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:29:21,942 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:29:21,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:29:21 WrapperNode [2025-02-05 14:29:21,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:29:21,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:29:21,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:29:21,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:29:21,949 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:29:21" (1/1) ... [2025-02-05 14:29:21,954 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:29:21" (1/1) ... [2025-02-05 14:29:21,967 INFO L138 Inliner]: procedures = 19, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2025-02-05 14:29:21,968 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:29:21,968 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:29:21,969 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:29:21,969 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:29:21,973 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:29:21" (1/1) ... [2025-02-05 14:29:21,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:29:21" (1/1) ... [2025-02-05 14:29:21,976 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:29:21" (1/1) ... [2025-02-05 14:29:21,995 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 0, 6, 6]. 43 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 0, 2, 2]. The 5 writes are split as follows [0, 0, 2, 3]. [2025-02-05 14:29:21,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:29:21" (1/1) ... [2025-02-05 14:29:21,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:29:21" (1/1) ... [2025-02-05 14:29:22,000 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:29:21" (1/1) ... [2025-02-05 14:29:22,000 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:29:21" (1/1) ... [2025-02-05 14:29:22,001 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:29:21" (1/1) ... [2025-02-05 14:29:22,004 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:29:21" (1/1) ... [2025-02-05 14:29:22,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:29:22,009 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:29:22,009 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:29:22,009 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:29:22,010 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:29:21" (1/1) ... [2025-02-05 14:29:22,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:29:22,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:29:22,035 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:29:22,037 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:29:22,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 14:29:22,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 14:29:22,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-05 14:29:22,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-05 14:29:22,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-05 14:29:22,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-05 14:29:22,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-05 14:29:22,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-05 14:29:22,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:29:22,055 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-02-05 14:29:22,056 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-02-05 14:29:22,056 INFO L130 BoogieDeclarations]: Found specification of procedure g [2025-02-05 14:29:22,056 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2025-02-05 14:29:22,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:29:22,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 14:29:22,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 14:29:22,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 14:29:22,057 INFO L130 BoogieDeclarations]: Found specification of procedure fake_malloc [2025-02-05 14:29:22,057 INFO L138 BoogieDeclarations]: Found implementation of procedure fake_malloc [2025-02-05 14:29:22,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 14:29:22,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 14:29:22,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-05 14:29:22,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-05 14:29:22,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 14:29:22,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 14:29:22,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 14:29:22,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-05 14:29:22,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:29:22,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:29:22,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 14:29:22,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 14:29:22,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 14:29:22,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-05 14:29:22,131 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:29:22,133 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:29:22,172 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L49: havoc #t~post10; [2025-02-05 14:29:22,324 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-02-05 14:29:22,324 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:29:22,332 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:29:22,334 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:29:22,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:29:22 BoogieIcfgContainer [2025-02-05 14:29:22,334 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:29:22,337 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:29:22,337 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:29:22,341 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:29:22,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:29:21" (1/3) ... [2025-02-05 14:29:22,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1965586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:29:22, skipping insertion in model container [2025-02-05 14:29:22,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:29:21" (2/3) ... [2025-02-05 14:29:22,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1965586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:29:22, skipping insertion in model container [2025-02-05 14:29:22,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:29:22" (3/3) ... [2025-02-05 14:29:22,344 INFO L128 eAbstractionObserver]: Analyzing ICFG ex3_forlist.i [2025-02-05 14:29:22,355 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:29:22,358 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ex3_forlist.i that has 4 procedures, 36 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-05 14:29:22,401 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:29:22,411 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;@7afd6211, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:29:22,412 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 14:29:22,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 14:29:22,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-05 14:29:22,420 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:29:22,421 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:29:22,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:29:22,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:29:22,426 INFO L85 PathProgramCache]: Analyzing trace with hash 10122438, now seen corresponding path program 1 times [2025-02-05 14:29:22,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:29:22,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539035748] [2025-02-05 14:29:22,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:22,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:29:22,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-05 14:29:22,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-05 14:29:22,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:22,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:22,660 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 14:29:22,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:29:22,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539035748] [2025-02-05 14:29:22,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539035748] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:29:22,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:29:22,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:29:22,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117940275] [2025-02-05 14:29:22,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:29:22,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:29:22,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:29:22,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:29:22,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:29:22,684 INFO L87 Difference]: Start difference. First operand has 36 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 14:29:22,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:29:22,708 INFO L93 Difference]: Finished difference Result 69 states and 89 transitions. [2025-02-05 14:29:22,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:29:22,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2025-02-05 14:29:22,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:29:22,721 INFO L225 Difference]: With dead ends: 69 [2025-02-05 14:29:22,721 INFO L226 Difference]: Without dead ends: 32 [2025-02-05 14:29:22,724 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:29:22,728 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 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:29:22,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:29:22,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-05 14:29:22,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-05 14:29:22,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 14:29:22,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-02-05 14:29:22,756 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 31 [2025-02-05 14:29:22,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:29:22,756 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-02-05 14:29:22,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 14:29:22,756 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-02-05 14:29:22,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-05 14:29:22,757 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:29:22,757 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:29:22,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 14:29:22,758 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:29:22,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:29:22,758 INFO L85 PathProgramCache]: Analyzing trace with hash 938101759, now seen corresponding path program 1 times [2025-02-05 14:29:22,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:29:22,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591596580] [2025-02-05 14:29:22,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:22,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:29:22,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-05 14:29:22,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-05 14:29:22,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:22,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:22,876 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 14:29:22,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:29:22,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591596580] [2025-02-05 14:29:22,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591596580] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:29:22,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078142875] [2025-02-05 14:29:22,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:22,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:29:22,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:29:22,879 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:29:22,881 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:29:22,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-05 14:29:22,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-05 14:29:22,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:22,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:22,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 14:29:22,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:29:23,016 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 14:29:23,016 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:29:23,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078142875] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:29:23,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 14:29:23,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 14:29:23,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137054475] [2025-02-05 14:29:23,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:29:23,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:29:23,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:29:23,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:29:23,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:29:23,023 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 14:29:23,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:29:23,044 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2025-02-05 14:29:23,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:29:23,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2025-02-05 14:29:23,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:29:23,048 INFO L225 Difference]: With dead ends: 52 [2025-02-05 14:29:23,048 INFO L226 Difference]: Without dead ends: 34 [2025-02-05 14:29:23,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:29:23,049 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:29:23,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 68 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:29:23,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-05 14:29:23,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2025-02-05 14:29:23,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 14:29:23,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2025-02-05 14:29:23,054 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 32 [2025-02-05 14:29:23,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:29:23,055 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2025-02-05 14:29:23,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 14:29:23,055 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2025-02-05 14:29:23,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-05 14:29:23,056 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:29:23,057 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:29:23,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 14:29:23,257 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:29:23,258 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:29:23,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:29:23,258 INFO L85 PathProgramCache]: Analyzing trace with hash -2112098051, now seen corresponding path program 1 times [2025-02-05 14:29:23,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:29:23,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365745480] [2025-02-05 14:29:23,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:23,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:29:23,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 14:29:23,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 14:29:23,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:23,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:23,385 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 14:29:23,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:29:23,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365745480] [2025-02-05 14:29:23,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365745480] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:29:23,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243644089] [2025-02-05 14:29:23,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:23,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:29:23,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:29:23,388 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:29:23,389 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:29:23,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 14:29:23,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 14:29:23,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:23,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:23,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 14:29:23,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:29:23,531 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 14:29:23,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:29:23,578 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 14:29:23,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243644089] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:29:23,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:29:23,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-02-05 14:29:23,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536154744] [2025-02-05 14:29:23,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:29:23,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:29:23,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:29:23,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:29:23,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:29:23,582 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 14:29:23,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:29:23,599 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2025-02-05 14:29:23,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:29:23,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 34 [2025-02-05 14:29:23,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:29:23,600 INFO L225 Difference]: With dead ends: 63 [2025-02-05 14:29:23,601 INFO L226 Difference]: Without dead ends: 34 [2025-02-05 14:29:23,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:29:23,602 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:29:23,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:29:23,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-05 14:29:23,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-05 14:29:23,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 14:29:23,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2025-02-05 14:29:23,610 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 34 [2025-02-05 14:29:23,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:29:23,611 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2025-02-05 14:29:23,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 14:29:23,611 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2025-02-05 14:29:23,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-05 14:29:23,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:29:23,612 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:29:23,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 14:29:23,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:29:23,812 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:29:23,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:29:23,814 INFO L85 PathProgramCache]: Analyzing trace with hash 910336804, now seen corresponding path program 2 times [2025-02-05 14:29:23,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:29:23,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233539078] [2025-02-05 14:29:23,815 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:29:23,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:29:23,838 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-05 14:29:23,853 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 35 statements. [2025-02-05 14:29:23,853 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 14:29:23,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:24,109 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 14:29:24,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:29:24,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233539078] [2025-02-05 14:29:24,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233539078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:29:24,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:29:24,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 14:29:24,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355076841] [2025-02-05 14:29:24,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:29:24,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 14:29:24,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:29:24,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 14:29:24,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 14:29:24,110 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 14:29:24,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:29:24,252 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2025-02-05 14:29:24,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 14:29:24,253 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2025-02-05 14:29:24,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:29:24,255 INFO L225 Difference]: With dead ends: 71 [2025-02-05 14:29:24,256 INFO L226 Difference]: Without dead ends: 60 [2025-02-05 14:29:24,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-02-05 14:29:24,257 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 59 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:29:24,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 136 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:29:24,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-05 14:29:24,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2025-02-05 14:29:24,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2025-02-05 14:29:24,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2025-02-05 14:29:24,271 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 35 [2025-02-05 14:29:24,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:29:24,272 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2025-02-05 14:29:24,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 14:29:24,273 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2025-02-05 14:29:24,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 14:29:24,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:29:24,274 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:29:24,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 14:29:24,274 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:29:24,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:29:24,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1997683386, now seen corresponding path program 1 times [2025-02-05 14:29:24,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:29:24,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665427416] [2025-02-05 14:29:24,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:24,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:29:24,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 14:29:24,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 14:29:24,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:24,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:24,340 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 14:29:24,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:29:24,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665427416] [2025-02-05 14:29:24,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665427416] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:29:24,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230579503] [2025-02-05 14:29:24,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:24,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:29:24,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:29:24,343 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:29:24,344 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:29:24,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 14:29:24,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 14:29:24,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:24,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:24,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 14:29:24,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:29:24,439 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 14:29:24,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:29:24,468 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 14:29:24,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230579503] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:29:24,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:29:24,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-02-05 14:29:24,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586726708] [2025-02-05 14:29:24,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:29:24,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:29:24,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:29:24,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:29:24,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:29:24,469 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 14:29:24,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:29:24,486 INFO L93 Difference]: Finished difference Result 89 states and 120 transitions. [2025-02-05 14:29:24,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:29:24,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2025-02-05 14:29:24,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:29:24,489 INFO L225 Difference]: With dead ends: 89 [2025-02-05 14:29:24,489 INFO L226 Difference]: Without dead ends: 56 [2025-02-05 14:29:24,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:29:24,490 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:29:24,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 101 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:29:24,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-05 14:29:24,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-02-05 14:29:24,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2025-02-05 14:29:24,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2025-02-05 14:29:24,502 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 73 transitions. Word has length 37 [2025-02-05 14:29:24,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:29:24,502 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 73 transitions. [2025-02-05 14:29:24,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 14:29:24,502 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 73 transitions. [2025-02-05 14:29:24,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 14:29:24,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:29:24,504 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:29:24,510 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:29:24,704 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:29:24,704 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:29:24,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:29:24,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1444399330, now seen corresponding path program 1 times [2025-02-05 14:29:24,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:29:24,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224385609] [2025-02-05 14:29:24,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:24,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:29:24,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 14:29:24,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 14:29:24,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:24,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 14:29:25,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:29:25,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224385609] [2025-02-05 14:29:25,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224385609] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:29:25,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198065359] [2025-02-05 14:29:25,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:25,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:29:25,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:29:25,144 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:29:25,146 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:29:25,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 14:29:25,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 14:29:25,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:25,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:25,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 14:29:25,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:29:25,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 14:29:25,493 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 7 treesize of output 3 [2025-02-05 14:29:25,609 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 14:29:25,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:29:25,832 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 14 treesize of output 12 [2025-02-05 14:29:25,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 16 [2025-02-05 14:29:25,983 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 14:29:25,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198065359] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:29:25,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:29:25,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 39 [2025-02-05 14:29:25,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119703279] [2025-02-05 14:29:25,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:29:25,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-02-05 14:29:25,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:29:25,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-02-05 14:29:25,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1354, Unknown=0, NotChecked=0, Total=1482 [2025-02-05 14:29:25,985 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. Second operand has 39 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 28 states have internal predecessors, (65), 11 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-02-05 14:29:26,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:29:26,886 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2025-02-05 14:29:26,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 14:29:26,886 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 28 states have internal predecessors, (65), 11 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 38 [2025-02-05 14:29:26,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:29:26,887 INFO L225 Difference]: With dead ends: 108 [2025-02-05 14:29:26,887 INFO L226 Difference]: Without dead ends: 84 [2025-02-05 14:29:26,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=326, Invalid=2224, Unknown=0, NotChecked=0, Total=2550 [2025-02-05 14:29:26,889 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 184 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 14:29:26,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 138 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1229 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 14:29:26,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-05 14:29:26,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2025-02-05 14:29:26,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 61 states have internal predecessors, (76), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (13), 11 states have call predecessors, (13), 8 states have call successors, (13) [2025-02-05 14:29:26,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2025-02-05 14:29:26,897 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 38 [2025-02-05 14:29:26,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:29:26,897 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2025-02-05 14:29:26,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 28 states have internal predecessors, (65), 11 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-02-05 14:29:26,897 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2025-02-05 14:29:26,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 14:29:26,898 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:29:26,898 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:29:26,905 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:29:27,099 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:29:27,099 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:29:27,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:29:27,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1522235742, now seen corresponding path program 1 times [2025-02-05 14:29:27,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:29:27,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862103472] [2025-02-05 14:29:27,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:27,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:29:27,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 14:29:27,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 14:29:27,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:27,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:27,534 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 14:29:27,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:29:27,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862103472] [2025-02-05 14:29:27,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862103472] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:29:27,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993374280] [2025-02-05 14:29:27,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:27,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:29:27,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:29:27,536 INFO L229 MonitoredProcess]: Starting monitored process 6 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:29:27,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 14:29:27,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 14:29:27,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 14:29:27,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:27,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:27,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-05 14:29:27,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:29:27,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 14:29:27,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:29:27,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-02-05 14:29:28,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:29:28,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:29:28,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 7 [2025-02-05 14:29:28,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:29:28,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:29:28,246 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-05 14:29:28,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2025-02-05 14:29:28,297 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 7 treesize of output 3 [2025-02-05 14:29:28,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:29:28,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-05 14:29:28,475 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 14:29:28,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:29:33,190 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 22 treesize of output 20 [2025-02-05 14:29:33,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 48 treesize of output 46 [2025-02-05 14:29:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 14:29:33,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993374280] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:29:33,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:29:33,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 16] total 48 [2025-02-05 14:29:33,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473072273] [2025-02-05 14:29:33,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:29:33,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-05 14:29:33,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:29:33,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-05 14:29:33,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2075, Unknown=9, NotChecked=0, Total=2256 [2025-02-05 14:29:33,253 INFO L87 Difference]: Start difference. First operand 80 states and 101 transitions. Second operand has 48 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 37 states have internal predecessors, (71), 10 states have call successors, (15), 10 states have call predecessors, (15), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-02-05 14:29:35,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:29:35,666 INFO L93 Difference]: Finished difference Result 186 states and 232 transitions. [2025-02-05 14:29:35,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-02-05 14:29:35,667 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 37 states have internal predecessors, (71), 10 states have call successors, (15), 10 states have call predecessors, (15), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) Word has length 39 [2025-02-05 14:29:35,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:29:35,668 INFO L225 Difference]: With dead ends: 186 [2025-02-05 14:29:35,668 INFO L226 Difference]: Without dead ends: 170 [2025-02-05 14:29:35,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1950 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=785, Invalid=6862, Unknown=9, NotChecked=0, Total=7656 [2025-02-05 14:29:35,670 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 236 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2602 mSolverCounterSat, 84 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 2694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 2602 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 14:29:35,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 152 Invalid, 2694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 2602 Invalid, 8 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 14:29:35,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-02-05 14:29:35,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 102. [2025-02-05 14:29:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 80 states have internal predecessors, (99), 12 states have call successors, (12), 10 states have call predecessors, (12), 12 states have return successors, (15), 11 states have call predecessors, (15), 9 states have call successors, (15) [2025-02-05 14:29:35,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 126 transitions. [2025-02-05 14:29:35,687 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 126 transitions. Word has length 39 [2025-02-05 14:29:35,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:29:35,687 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 126 transitions. [2025-02-05 14:29:35,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 37 states have internal predecessors, (71), 10 states have call successors, (15), 10 states have call predecessors, (15), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-02-05 14:29:35,688 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2025-02-05 14:29:35,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-05 14:29:35,688 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:29:35,688 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:29:35,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 14:29:35,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:29:35,889 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:29:35,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:29:35,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1049586397, now seen corresponding path program 1 times [2025-02-05 14:29:35,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:29:35,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313715934] [2025-02-05 14:29:35,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:35,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:29:35,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-05 14:29:35,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 14:29:35,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:35,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:36,348 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 14:29:36,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:29:36,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313715934] [2025-02-05 14:29:36,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313715934] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:29:36,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052273780] [2025-02-05 14:29:36,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:36,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:29:36,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:29:36,351 INFO L229 MonitoredProcess]: Starting monitored process 7 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:29:36,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 14:29:36,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-05 14:29:36,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 14:29:36,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:36,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:36,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-05 14:29:36,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:29:36,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 14:29:36,817 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 14:29:36,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:29:36,954 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 16 treesize of output 14 [2025-02-05 14:29:36,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 16 [2025-02-05 14:29:37,094 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 14:29:37,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052273780] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:29:37,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:29:37,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 17] total 46 [2025-02-05 14:29:37,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10699867] [2025-02-05 14:29:37,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:29:37,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-02-05 14:29:37,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:29:37,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-02-05 14:29:37,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1918, Unknown=0, NotChecked=0, Total=2070 [2025-02-05 14:29:37,095 INFO L87 Difference]: Start difference. First operand 102 states and 126 transitions. Second operand has 46 states, 40 states have (on average 1.8) internal successors, (72), 32 states have internal predecessors, (72), 11 states have call successors, (15), 7 states have call predecessors, (15), 10 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) [2025-02-05 14:29:37,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:29:37,750 INFO L93 Difference]: Finished difference Result 171 states and 216 transitions. [2025-02-05 14:29:37,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 14:29:37,751 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 40 states have (on average 1.8) internal successors, (72), 32 states have internal predecessors, (72), 11 states have call successors, (15), 7 states have call predecessors, (15), 10 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) Word has length 40 [2025-02-05 14:29:37,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:29:37,752 INFO L225 Difference]: With dead ends: 171 [2025-02-05 14:29:37,752 INFO L226 Difference]: Without dead ends: 143 [2025-02-05 14:29:37,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=305, Invalid=3355, Unknown=0, NotChecked=0, Total=3660 [2025-02-05 14:29:37,753 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 102 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 14:29:37,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 141 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 14:29:37,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-02-05 14:29:37,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2025-02-05 14:29:37,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 104 states have (on average 1.25) internal successors, (130), 109 states have internal predecessors, (130), 14 states have call successors, (14), 12 states have call predecessors, (14), 16 states have return successors, (19), 13 states have call predecessors, (19), 11 states have call successors, (19) [2025-02-05 14:29:37,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 163 transitions. [2025-02-05 14:29:37,767 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 163 transitions. Word has length 40 [2025-02-05 14:29:37,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:29:37,767 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 163 transitions. [2025-02-05 14:29:37,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 40 states have (on average 1.8) internal successors, (72), 32 states have internal predecessors, (72), 11 states have call successors, (15), 7 states have call predecessors, (15), 10 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) [2025-02-05 14:29:37,768 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 163 transitions. [2025-02-05 14:29:37,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-05 14:29:37,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:29:37,769 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:29:37,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 14:29:37,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-05 14:29:37,969 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:29:37,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:29:37,970 INFO L85 PathProgramCache]: Analyzing trace with hash 593587363, now seen corresponding path program 2 times [2025-02-05 14:29:37,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:29:37,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470661915] [2025-02-05 14:29:37,970 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:29:37,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:29:37,977 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-02-05 14:29:37,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 14:29:37,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:29:37,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:38,499 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 14:29:38,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:29:38,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470661915] [2025-02-05 14:29:38,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470661915] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:29:38,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806318306] [2025-02-05 14:29:38,501 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:29:38,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:29:38,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:29:38,503 INFO L229 MonitoredProcess]: Starting monitored process 8 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:29:38,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 14:29:38,564 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-02-05 14:29:38,593 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 14:29:38,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:29:38,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:38,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-05 14:29:38,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:29:38,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 14:29:38,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 14:29:38,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:29:38,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-02-05 14:29:38,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:29:38,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-02-05 14:29:38,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:29:38,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2025-02-05 14:29:38,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:29:38,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:29:38,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 7 [2025-02-05 14:29:38,962 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 14:29:38,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:29:39,161 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 43 treesize of output 41 [2025-02-05 14:29:39,165 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 41 treesize of output 39 [2025-02-05 14:29:39,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 43 treesize of output 41 [2025-02-05 14:29:39,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 34 treesize of output 32 [2025-02-05 14:29:39,188 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 14:29:39,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806318306] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:29:39,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:29:39,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9, 9] total 31 [2025-02-05 14:29:39,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933798973] [2025-02-05 14:29:39,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:29:39,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-05 14:29:39,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:29:39,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-05 14:29:39,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=825, Unknown=0, NotChecked=0, Total=930 [2025-02-05 14:29:39,190 INFO L87 Difference]: Start difference. First operand 135 states and 163 transitions. Second operand has 31 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 25 states have internal predecessors, (68), 6 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-02-05 14:29:39,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:29:39,995 INFO L93 Difference]: Finished difference Result 206 states and 246 transitions. [2025-02-05 14:29:39,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 14:29:39,996 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 25 states have internal predecessors, (68), 6 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 40 [2025-02-05 14:29:39,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:29:39,997 INFO L225 Difference]: With dead ends: 206 [2025-02-05 14:29:39,997 INFO L226 Difference]: Without dead ends: 116 [2025-02-05 14:29:39,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=300, Invalid=1862, Unknown=0, NotChecked=0, Total=2162 [2025-02-05 14:29:39,998 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 136 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 14:29:39,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 142 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 14:29:39,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-05 14:29:40,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2025-02-05 14:29:40,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 90 states have internal predecessors, (106), 11 states have call successors, (11), 10 states have call predecessors, (11), 12 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2025-02-05 14:29:40,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2025-02-05 14:29:40,018 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 40 [2025-02-05 14:29:40,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:29:40,018 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2025-02-05 14:29:40,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 25 states have internal predecessors, (68), 6 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-02-05 14:29:40,019 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2025-02-05 14:29:40,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 14:29:40,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:29:40,020 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:29:40,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 14:29:40,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:29:40,220 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:29:40,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:29:40,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1619380331, now seen corresponding path program 1 times [2025-02-05 14:29:40,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:29:40,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123449571] [2025-02-05 14:29:40,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:40,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:29:40,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 14:29:40,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 14:29:40,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:40,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:40,521 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 14:29:40,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:29:40,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123449571] [2025-02-05 14:29:40,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123449571] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:29:40,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86771265] [2025-02-05 14:29:40,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:40,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:29:40,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:29:40,524 INFO L229 MonitoredProcess]: Starting monitored process 9 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:29:40,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 14:29:40,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 14:29:40,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 14:29:40,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:40,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:40,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-05 14:29:40,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:29:40,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 14:29:40,792 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 7 treesize of output 3 [2025-02-05 14:29:40,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:29:40,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-05 14:29:40,883 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 7 treesize of output 3 [2025-02-05 14:29:41,029 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 14:29:41,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:29:41,299 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 17 treesize of output 15 [2025-02-05 14:29:41,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 18 [2025-02-05 14:29:41,349 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 14:29:41,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86771265] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:29:41,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:29:41,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 16] total 42 [2025-02-05 14:29:41,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795817159] [2025-02-05 14:29:41,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:29:41,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-05 14:29:41,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:29:41,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-05 14:29:41,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1562, Unknown=14, NotChecked=0, Total=1722 [2025-02-05 14:29:41,351 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand has 42 states, 41 states have (on average 2.0) internal successors, (82), 34 states have internal predecessors, (82), 6 states have call successors, (15), 10 states have call predecessors, (15), 9 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-02-05 14:29:42,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:29:42,276 INFO L93 Difference]: Finished difference Result 161 states and 188 transitions. [2025-02-05 14:29:42,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-05 14:29:42,277 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.0) internal successors, (82), 34 states have internal predecessors, (82), 6 states have call successors, (15), 10 states have call predecessors, (15), 9 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 41 [2025-02-05 14:29:42,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:29:42,278 INFO L225 Difference]: With dead ends: 161 [2025-02-05 14:29:42,278 INFO L226 Difference]: Without dead ends: 134 [2025-02-05 14:29:42,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=410, Invalid=3236, Unknown=14, NotChecked=0, Total=3660 [2025-02-05 14:29:42,279 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 176 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 14:29:42,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 124 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 14:29:42,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-02-05 14:29:42,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 84. [2025-02-05 14:29:42,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-05 14:29:42,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2025-02-05 14:29:42,293 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 41 [2025-02-05 14:29:42,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:29:42,294 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2025-02-05 14:29:42,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.0) internal successors, (82), 34 states have internal predecessors, (82), 6 states have call successors, (15), 10 states have call predecessors, (15), 9 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-02-05 14:29:42,294 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2025-02-05 14:29:42,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 14:29:42,294 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:29:42,294 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:29:42,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-05 14:29:42,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:29:42,495 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:29:42,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:29:42,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1324960939, now seen corresponding path program 1 times [2025-02-05 14:29:42,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:29:42,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640686703] [2025-02-05 14:29:42,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:42,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:29:42,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 14:29:42,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 14:29:42,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:42,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:42,544 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 14:29:42,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:29:42,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640686703] [2025-02-05 14:29:42,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640686703] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:29:42,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227274446] [2025-02-05 14:29:42,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:42,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:29:42,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:29:42,547 INFO L229 MonitoredProcess]: Starting monitored process 10 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:29:42,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 14:29:42,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 14:29:42,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 14:29:42,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:42,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:42,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 14:29:42,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:29:42,679 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 14:29:42,680 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:29:42,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227274446] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:29:42,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 14:29:42,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-02-05 14:29:42,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363985962] [2025-02-05 14:29:42,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:29:42,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:29:42,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:29:42,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:29:42,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 14:29:42,684 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 14:29:42,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:29:42,711 INFO L93 Difference]: Finished difference Result 120 states and 137 transitions. [2025-02-05 14:29:42,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:29:42,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2025-02-05 14:29:42,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:29:42,713 INFO L225 Difference]: With dead ends: 120 [2025-02-05 14:29:42,713 INFO L226 Difference]: Without dead ends: 86 [2025-02-05 14:29:42,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 14:29:42,715 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 133 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:29:42,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 133 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:29:42,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-05 14:29:42,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2025-02-05 14:29:42,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-05 14:29:42,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2025-02-05 14:29:42,726 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 46 [2025-02-05 14:29:42,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:29:42,728 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2025-02-05 14:29:42,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 14:29:42,728 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2025-02-05 14:29:42,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 14:29:42,728 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:29:42,728 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:29:42,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-05 14:29:42,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:29:42,929 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:29:42,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:29:42,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1153485012, now seen corresponding path program 1 times [2025-02-05 14:29:42,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:29:42,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965436053] [2025-02-05 14:29:42,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:42,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:29:42,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 14:29:42,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 14:29:42,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:42,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:44,039 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 14:29:44,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:29:44,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965436053] [2025-02-05 14:29:44,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965436053] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:29:44,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487199410] [2025-02-05 14:29:44,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:44,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:29:44,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:29:44,041 INFO L229 MonitoredProcess]: Starting monitored process 11 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:29:44,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 14:29:44,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 14:29:44,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 14:29:44,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:44,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:44,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-05 14:29:44,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:29:44,594 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 14:29:44,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:29:44,714 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 17 treesize of output 9 [2025-02-05 14:29:44,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:29:44,825 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 20 treesize of output 16 [2025-02-05 14:29:45,055 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 14:29:45,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487199410] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:29:45,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:29:45,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 17, 16] total 62 [2025-02-05 14:29:45,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191664194] [2025-02-05 14:29:45,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:29:45,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-02-05 14:29:45,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:29:45,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-02-05 14:29:45,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=3580, Unknown=0, NotChecked=0, Total=3782 [2025-02-05 14:29:45,058 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 62 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 44 states have internal predecessors, (97), 14 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2025-02-05 14:29:47,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:29:47,064 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2025-02-05 14:29:47,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-05 14:29:47,064 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 44 states have internal predecessors, (97), 14 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) Word has length 50 [2025-02-05 14:29:47,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:29:47,065 INFO L225 Difference]: With dead ends: 91 [2025-02-05 14:29:47,065 INFO L226 Difference]: Without dead ends: 82 [2025-02-05 14:29:47,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1731 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=687, Invalid=8433, Unknown=0, NotChecked=0, Total=9120 [2025-02-05 14:29:47,067 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 256 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 2008 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 2077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 14:29:47,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 99 Invalid, 2077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2008 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 14:29:47,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-05 14:29:47,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2025-02-05 14:29:47,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 56 states have internal predecessors, (59), 7 states have call successors, (7), 7 states have call predecessors, (7), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-05 14:29:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2025-02-05 14:29:47,077 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 50 [2025-02-05 14:29:47,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:29:47,077 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2025-02-05 14:29:47,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 44 states have internal predecessors, (97), 14 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2025-02-05 14:29:47,077 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2025-02-05 14:29:47,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-05 14:29:47,078 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:29:47,078 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:29:47,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-05 14:29:47,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 14:29:47,278 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:29:47,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:29:47,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1195096040, now seen corresponding path program 1 times [2025-02-05 14:29:47,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:29:47,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039798903] [2025-02-05 14:29:47,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:47,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:29:47,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 14:29:47,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 14:29:47,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:47,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:47,505 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 14:29:47,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:29:47,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039798903] [2025-02-05 14:29:47,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039798903] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:29:47,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610407773] [2025-02-05 14:29:47,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:47,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:29:47,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:29:47,507 INFO L229 MonitoredProcess]: Starting monitored process 12 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:29:47,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 14:29:47,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 14:29:47,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 14:29:47,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:47,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:47,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 14:29:47,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:29:47,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 14:29:47,739 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 7 treesize of output 3 [2025-02-05 14:29:47,794 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 14:29:47,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:29:47,882 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 16 treesize of output 14 [2025-02-05 14:29:47,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 12 [2025-02-05 14:29:47,893 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 14:29:47,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610407773] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:29:47,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:29:47,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 20 [2025-02-05 14:29:47,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620611326] [2025-02-05 14:29:47,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:29:47,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 14:29:47,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:29:47,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 14:29:47,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-02-05 14:29:47,895 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 20 states, 20 states have (on average 3.9) internal successors, (78), 20 states have internal predecessors, (78), 4 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-02-05 14:29:48,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:29:48,146 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2025-02-05 14:29:48,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 14:29:48,146 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.9) internal successors, (78), 20 states have internal predecessors, (78), 4 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 51 [2025-02-05 14:29:48,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:29:48,146 INFO L225 Difference]: With dead ends: 87 [2025-02-05 14:29:48,147 INFO L226 Difference]: Without dead ends: 55 [2025-02-05 14:29:48,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=687, Unknown=0, NotChecked=0, Total=870 [2025-02-05 14:29:48,147 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 41 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 14:29:48,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 279 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 14:29:48,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-05 14:29:48,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-02-05 14:29:48,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 14:29:48,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2025-02-05 14:29:48,155 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 51 [2025-02-05 14:29:48,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:29:48,155 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2025-02-05 14:29:48,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.9) internal successors, (78), 20 states have internal predecessors, (78), 4 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-02-05 14:29:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2025-02-05 14:29:48,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 14:29:48,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:29:48,156 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:29:48,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-05 14:29:48,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-05 14:29:48,357 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:29:48,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:29:48,357 INFO L85 PathProgramCache]: Analyzing trace with hash -527309078, now seen corresponding path program 1 times [2025-02-05 14:29:48,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:29:48,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132057811] [2025-02-05 14:29:48,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:48,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:29:48,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 14:29:48,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 14:29:48,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:48,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:48,735 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 14:29:48,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:29:48,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132057811] [2025-02-05 14:29:48,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132057811] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:29:48,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183135914] [2025-02-05 14:29:48,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:48,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:29:48,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:29:48,738 INFO L229 MonitoredProcess]: Starting monitored process 13 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:29:48,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-05 14:29:48,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 14:29:48,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 14:29:48,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:48,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:48,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-05 14:29:48,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:29:48,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 14:29:49,054 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 7 treesize of output 3 [2025-02-05 14:29:49,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:29:49,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-05 14:29:49,154 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 7 treesize of output 3 [2025-02-05 14:29:49,321 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 14:29:49,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:29:49,683 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 19 treesize of output 17 [2025-02-05 14:29:49,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 22 [2025-02-05 14:29:49,763 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 14:29:49,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183135914] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:29:49,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:29:49,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 19] total 52 [2025-02-05 14:29:49,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896132270] [2025-02-05 14:29:49,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:29:49,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-02-05 14:29:49,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:29:49,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-02-05 14:29:49,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2420, Unknown=21, NotChecked=0, Total=2652 [2025-02-05 14:29:49,765 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 52 states, 51 states have (on average 2.0392156862745097) internal successors, (104), 43 states have internal predecessors, (104), 8 states have call successors, (18), 11 states have call predecessors, (18), 12 states have return successors, (15), 9 states have call predecessors, (15), 8 states have call successors, (15) [2025-02-05 14:29:50,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:29:50,445 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2025-02-05 14:29:50,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 14:29:50,445 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.0392156862745097) internal successors, (104), 43 states have internal predecessors, (104), 8 states have call successors, (18), 11 states have call predecessors, (18), 12 states have return successors, (15), 9 states have call predecessors, (15), 8 states have call successors, (15) Word has length 54 [2025-02-05 14:29:50,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:29:50,445 INFO L225 Difference]: With dead ends: 55 [2025-02-05 14:29:50,445 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 14:29:50,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1201 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=514, Invalid=4021, Unknown=21, NotChecked=0, Total=4556 [2025-02-05 14:29:50,446 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 142 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 14:29:50,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 78 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 14:29:50,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 14:29:50,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 14:29:50,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:29:50,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 14:29:50,448 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2025-02-05 14:29:50,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:29:50,448 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 14:29:50,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.0392156862745097) internal successors, (104), 43 states have internal predecessors, (104), 8 states have call successors, (18), 11 states have call predecessors, (18), 12 states have return successors, (15), 9 states have call predecessors, (15), 8 states have call successors, (15) [2025-02-05 14:29:50,448 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 14:29:50,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 14:29:50,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location gErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 14:29:50,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-05 14:29:50,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:29:50,653 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:29:50,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 14:29:53,052 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 14:29:53,061 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!offset [2025-02-05 14:29:53,062 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-05 14:29:53,062 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-05 14:29:53,062 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!base [2025-02-05 14:29:53,062 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!base [2025-02-05 14:29:53,062 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!offset [2025-02-05 14:29:53,063 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!base [2025-02-05 14:29:53,063 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!base [2025-02-05 14:29:53,063 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-02-05 14:29:53,063 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-02-05 14:29:53,063 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!offset [2025-02-05 14:29:53,063 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-05 14:29:53,063 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-05 14:29:53,063 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!base [2025-02-05 14:29:53,063 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!base [2025-02-05 14:29:53,063 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!offset [2025-02-05 14:29:53,063 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-05 14:29:53,063 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-05 14:29:53,063 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!base [2025-02-05 14:29:53,063 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!base [2025-02-05 14:29:53,063 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-05 14:29:53,064 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-02-05 14:29:53,064 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,064 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-05 14:29:53,064 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] [2025-02-05 14:29:53,064 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] [2025-02-05 14:29:53,064 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset [2025-02-05 14:29:53,064 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-02-05 14:29:53,064 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-02-05 14:29:53,064 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,064 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-02-05 14:29:53,064 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pp~0!offset [2025-02-05 14:29:53,064 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-02-05 14:29:53,064 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset [2025-02-05 14:29:53,065 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-05 14:29:53,065 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-02-05 14:29:53,065 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,065 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-02-05 14:29:53,065 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-02-05 14:29:53,065 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-02-05 14:29:53,065 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,065 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!base [2025-02-05 14:29:53,065 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-02-05 14:29:53,065 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-02-05 14:29:53,065 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,065 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pp~0!offset [2025-02-05 14:29:53,065 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-05 14:29:53,065 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-02-05 14:29:53,065 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,065 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-05 14:29:53,065 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] [2025-02-05 14:29:53,065 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] [2025-02-05 14:29:53,066 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-02-05 14:29:53,066 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-05 14:29:53,066 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] [2025-02-05 14:29:53,066 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] [2025-02-05 14:29:53,066 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset [2025-02-05 14:29:53,066 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-05 14:29:53,066 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-02-05 14:29:53,066 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,066 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-02-05 14:29:53,066 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-05 14:29:53,066 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-02-05 14:29:53,066 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,066 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-02-05 14:29:53,066 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-02-05 14:29:53,066 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,066 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pp~0!offset [2025-02-05 14:29:53,066 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-05 14:29:53,067 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] [2025-02-05 14:29:53,067 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] [2025-02-05 14:29:53,067 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-05 14:29:53,067 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-02-05 14:29:53,067 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,067 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset [2025-02-05 14:29:53,067 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-02-05 14:29:53,067 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-02-05 14:29:53,067 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,067 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-02-05 14:29:53,067 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pp~0!offset [2025-02-05 14:29:53,067 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-05 14:29:53,067 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-02-05 14:29:53,067 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,067 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-05 14:29:53,067 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-02-05 14:29:53,067 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,067 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-05 14:29:53,067 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-02-05 14:29:53,068 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] [2025-02-05 14:29:53,068 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-05 14:29:53,068 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-02-05 14:29:53,068 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,068 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-02-05 14:29:53,070 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset [2025-02-05 14:29:53,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-05 14:29:53,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-02-05 14:29:53,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-02-05 14:29:53,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-02-05 14:29:53,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-02-05 14:29:53,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-02-05 14:29:53,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pp~0!offset [2025-02-05 14:29:53,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-05 14:29:53,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-02-05 14:29:53,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset [2025-02-05 14:29:53,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-05 14:29:53,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-02-05 14:29:53,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-02-05 14:29:53,072 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-02-05 14:29:53,072 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,072 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-02-05 14:29:53,072 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-02-05 14:29:53,072 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,072 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pp~0!offset [2025-02-05 14:29:53,072 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-05 14:29:53,072 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-02-05 14:29:53,072 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,073 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-02-05 14:29:53,073 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-02-05 14:29:53,074 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!base [2025-02-05 14:29:53,074 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!base [2025-02-05 14:29:53,074 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-05 14:29:53,074 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-05 14:29:53,074 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-02-05 14:29:53,074 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!offset [2025-02-05 14:29:53,074 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-05 14:29:53,074 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-05 14:29:53,074 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-05 14:29:53,074 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]] [2025-02-05 14:29:53,074 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,074 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset [2025-02-05 14:29:53,074 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-05 14:29:53,074 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]] [2025-02-05 14:29:53,074 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,074 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-05 14:29:53,074 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]] [2025-02-05 14:29:53,074 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,074 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pp~0!offset [2025-02-05 14:29:53,075 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-05 14:29:53,075 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] [2025-02-05 14:29:53,075 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] [2025-02-05 14:29:53,075 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-02-05 14:29:53,075 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]] [2025-02-05 14:29:53,075 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,075 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-05 14:29:53,075 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]] [2025-02-05 14:29:53,075 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,075 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset [2025-02-05 14:29:53,075 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-05 14:29:53,075 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]] [2025-02-05 14:29:53,075 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,075 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pp~0!offset [2025-02-05 14:29:53,075 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-02-05 14:29:53,075 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]] [2025-02-05 14:29:53,076 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,076 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-02-05 14:29:53,076 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]] [2025-02-05 14:29:53,076 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-05 14:29:53,076 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-02-05 14:29:53,076 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-02-05 14:29:53,076 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!base [2025-02-05 14:29:53,076 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!base [2025-02-05 14:29:53,076 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-05 14:29:53,076 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-05 14:29:53,076 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-02-05 14:29:53,077 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!offset [2025-02-05 14:29:53,077 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-05 14:29:53,077 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-05 14:29:53,077 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-02-05 14:29:53,077 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-02-05 14:29:53,077 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-05 14:29:53,077 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-05 14:29:53,077 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-05 14:29:53,077 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-05 14:29:53,077 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!base [2025-02-05 14:29:53,077 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!base [2025-02-05 14:29:53,077 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!base [2025-02-05 14:29:53,077 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-02-05 14:29:53,077 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!offset [2025-02-05 14:29:53,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 02:29:53 BoogieIcfgContainer [2025-02-05 14:29:53,077 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 14:29:53,078 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 14:29:53,078 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 14:29:53,078 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 14:29:53,081 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:29:22" (3/4) ... [2025-02-05 14:29:53,082 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 14:29:53,087 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure f [2025-02-05 14:29:53,087 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure g [2025-02-05 14:29:53,087 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fake_malloc [2025-02-05 14:29:53,092 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-05 14:29:53,092 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-05 14:29:53,092 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 14:29:53,092 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 14:29:53,162 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 14:29:53,163 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 14:29:53,163 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 14:29:53,164 INFO L158 Benchmark]: Toolchain (without parser) took 31380.10ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 109.5MB in the beginning and 296.1MB in the end (delta: -186.6MB). Peak memory consumption was 87.5MB. Max. memory is 16.1GB. [2025-02-05 14:29:53,166 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:29:53,166 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.14ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 98.4MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 14:29:53,166 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.73ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 96.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 14:29:53,166 INFO L158 Benchmark]: Boogie Preprocessor took 40.07ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 95.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:29:53,166 INFO L158 Benchmark]: IcfgBuilder took 325.75ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 80.9MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 14:29:53,166 INFO L158 Benchmark]: TraceAbstraction took 30740.24ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 79.8MB in the beginning and 300.0MB in the end (delta: -220.2MB). Peak memory consumption was 164.6MB. Max. memory is 16.1GB. [2025-02-05 14:29:53,167 INFO L158 Benchmark]: Witness Printer took 85.11ms. Allocated memory is still 419.4MB. Free memory was 300.0MB in the beginning and 296.1MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:29:53,168 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.19ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 159.14ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 98.4MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.73ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 96.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.07ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 95.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 325.75ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 80.9MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 30740.24ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 79.8MB in the beginning and 300.0MB in the end (delta: -220.2MB). Peak memory consumption was 164.6MB. Max. memory is 16.1GB. * Witness Printer took 85.11ms. Allocated memory is still 419.4MB. Free memory was 300.0MB in the beginning and 296.1MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pp~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pp~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pp~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pp~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pp~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pp~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pp~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pp~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!offset * 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 - PositiveResult [Line: 8]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.3s, OverallIterations: 14, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 1347 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1342 mSDsluCounter, 1777 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1440 mSDsCounter, 441 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10113 IncrementalHoareTripleChecker+Invalid, 10562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 441 mSolverCounterUnsat, 337 mSDtfsCounter, 10113 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1260 GetRequests, 737 SyntacticMatches, 14 SemanticMatches, 509 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7467 ImplicationChecksByTransitivity, 13.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=8, InterpolantAutomatonStates: 226, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 157 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 1070 NumberOfCodeBlocks, 1057 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1458 ConstructedInterpolants, 48 QuantifiedInterpolants, 10130 SizeOfPredicates, 66 NumberOfNonLiveVariables, 3660 ConjunctsInSsa, 308 ConjunctsInUnsatCore, 36 InterpolantComputations, 4 PerfectInterpolantSequences, 437/728 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 38]: Location Invariant Derived location invariant: ((((1 <= counter) || (1 <= counter)) || (1 <= counter)) || (1 <= counter)) - InvariantResult [Line: 19]: Location Invariant Derived location invariant: (((i == 0) && (counter == 1)) || ((1 <= i) && (counter == 1))) - InvariantResult [Line: 27]: Location Invariant Derived location invariant: (((1 <= counter) || (1 <= counter)) && ((i == 0) || (1 <= i))) RESULT: Ultimate proved your program to be correct! [2025-02-05 14:29:53,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE