./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.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/heap-manipulation/dll_of_dll-2.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 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:32:21,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:32:21,460 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:32:21,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:32:21,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:32:21,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:32:21,487 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:32:21,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:32:21,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:32:21,488 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:32:21,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:32:21,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:32:21,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:32:21,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:32:21,490 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:32:21,490 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:32:21,490 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:32:21,490 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:32:21,490 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:32:21,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:32:21,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:32:21,490 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:32:21,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:32:21,490 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:32:21,491 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:32:21,491 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:32:21,491 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:32:21,491 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:32:21,491 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:32:21,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:32:21,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:32:21,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:32:21,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:32:21,492 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:32:21,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:32:21,492 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:32:21,492 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:32:21,492 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:32:21,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:32:21,492 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:32:21,492 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:32:21,492 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:32:21,493 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:32:21,493 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 -> 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 [2025-02-05 14:32:21,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:32:21,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:32:21,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:32:21,745 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:32:21,745 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:32:21,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2025-02-05 14:32:22,874 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed6383b9b/aa63e472c7934b95b02738a08d54cfca/FLAG2ef4061b4 [2025-02-05 14:32:23,145 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:32:23,146 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2025-02-05 14:32:23,162 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed6383b9b/aa63e472c7934b95b02738a08d54cfca/FLAG2ef4061b4 [2025-02-05 14:32:23,176 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed6383b9b/aa63e472c7934b95b02738a08d54cfca [2025-02-05 14:32:23,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:32:23,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:32:23,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:32:23,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:32:23,192 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:32:23,193 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:32:23" (1/1) ... [2025-02-05 14:32:23,195 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55b54128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:23, skipping insertion in model container [2025-02-05 14:32:23,195 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:32:23" (1/1) ... [2025-02-05 14:32:23,219 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:32:23,400 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/heap-manipulation/dll_of_dll-2.i[22634,22647] [2025-02-05 14:32:23,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:32:23,444 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:32:23,470 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/heap-manipulation/dll_of_dll-2.i[22634,22647] [2025-02-05 14:32:23,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:32:23,509 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:32:23,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:23 WrapperNode [2025-02-05 14:32:23,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:32:23,510 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:32:23,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:32:23,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:32:23,514 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:32:23" (1/1) ... [2025-02-05 14:32:23,522 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:32:23" (1/1) ... [2025-02-05 14:32:23,538 INFO L138 Inliner]: procedures = 140, calls = 94, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 199 [2025-02-05 14:32:23,539 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:32:23,539 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:32:23,539 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:32:23,539 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:32:23,545 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:23" (1/1) ... [2025-02-05 14:32:23,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:23" (1/1) ... [2025-02-05 14:32:23,548 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:23" (1/1) ... [2025-02-05 14:32:23,573 INFO L175 MemorySlicer]: Split 48 memory accesses to 3 slices as follows [2, 40, 6]. 83 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 13 writes are split as follows [0, 11, 2]. [2025-02-05 14:32:23,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:23" (1/1) ... [2025-02-05 14:32:23,573 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:23" (1/1) ... [2025-02-05 14:32:23,580 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:23" (1/1) ... [2025-02-05 14:32:23,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:23" (1/1) ... [2025-02-05 14:32:23,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:23" (1/1) ... [2025-02-05 14:32:23,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:23" (1/1) ... [2025-02-05 14:32:23,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:32:23,585 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:32:23,585 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:32:23,585 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:32:23,586 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:23" (1/1) ... [2025-02-05 14:32:23,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:32:23,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:23,606 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:32:23,608 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:32:23,622 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-02-05 14:32:23,622 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-02-05 14:32:23,622 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2025-02-05 14:32:23,622 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2025-02-05 14:32:23,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-05 14:32:23,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:32:23,622 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2025-02-05 14:32:23,622 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2025-02-05 14:32:23,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 14:32:23,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 14:32:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 14:32:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-05 14:32:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-02-05 14:32:23,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-02-05 14:32:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 14:32:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 14:32:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-05 14:32:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 14:32:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-05 14:32:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-05 14:32:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-05 14:32:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2025-02-05 14:32:23,623 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2025-02-05 14:32:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2025-02-05 14:32:23,623 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2025-02-05 14:32:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:32:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 14:32:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 14:32:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:32:23,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:32:23,751 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:32:23,753 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:32:23,771 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L597: havoc #t~ret12.base, #t~ret12.offset; [2025-02-05 14:32:23,833 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L593: havoc #t~mem11.base, #t~mem11.offset;call ULTIMATE.dealloc(~#dll~0.base, ~#dll~0.offset);havoc ~#dll~0.base, ~#dll~0.offset; [2025-02-05 14:32:24,022 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L641: havoc dll_create_master_#t~ret21#1.base, dll_create_master_#t~ret21#1.offset; [2025-02-05 14:32:24,037 INFO L? ?]: Removed 74 outVars from TransFormulas that were not future-live. [2025-02-05 14:32:24,037 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:32:24,046 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:32:24,047 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:32:24,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:32:24 BoogieIcfgContainer [2025-02-05 14:32:24,047 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:32:24,049 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:32:24,049 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:32:24,052 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:32:24,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:32:23" (1/3) ... [2025-02-05 14:32:24,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bbab851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:32:24, skipping insertion in model container [2025-02-05 14:32:24,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:23" (2/3) ... [2025-02-05 14:32:24,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bbab851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:32:24, skipping insertion in model container [2025-02-05 14:32:24,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:32:24" (3/3) ... [2025-02-05 14:32:24,054 INFO L128 eAbstractionObserver]: Analyzing ICFG dll_of_dll-2.i [2025-02-05 14:32:24,065 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:32:24,066 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll_of_dll-2.i that has 7 procedures, 129 locations, 1 initial locations, 24 loop locations, and 1 error locations. [2025-02-05 14:32:24,107 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:32:24,118 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;@116c8187, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:32:24,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 14:32:24,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 97 states have (on average 1.6082474226804124) internal successors, (156), 117 states have internal predecessors, (156), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-05 14:32:24,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 14:32:24,126 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:24,126 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 14:32:24,127 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:24,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:24,131 INFO L85 PathProgramCache]: Analyzing trace with hash -10315666, now seen corresponding path program 1 times [2025-02-05 14:32:24,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:24,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383187209] [2025-02-05 14:32:24,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:24,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:24,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 14:32:24,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 14:32:24,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:24,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:24,352 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 14:32:24,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:24,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383187209] [2025-02-05 14:32:24,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383187209] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:32:24,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181056475] [2025-02-05 14:32:24,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:24,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:24,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:24,356 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:32:24,357 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:32:24,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 14:32:24,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 14:32:24,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:24,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:24,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 14:32:24,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:32:24,512 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 14:32:24,513 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:32:24,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181056475] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:24,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 14:32:24,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 14:32:24,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911442818] [2025-02-05 14:32:24,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:24,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 14:32:24,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:24,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 14:32:24,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 14:32:24,530 INFO L87 Difference]: Start difference. First operand has 129 states, 97 states have (on average 1.6082474226804124) internal successors, (156), 117 states have internal predecessors, (156), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 14:32:24,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:24,558 INFO L93 Difference]: Finished difference Result 253 states and 413 transitions. [2025-02-05 14:32:24,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 14:32:24,562 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2025-02-05 14:32:24,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:24,567 INFO L225 Difference]: With dead ends: 253 [2025-02-05 14:32:24,567 INFO L226 Difference]: Without dead ends: 121 [2025-02-05 14:32:24,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 14:32:24,575 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:24,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:32:24,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-02-05 14:32:24,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-02-05 14:32:24,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 109 states have internal predecessors, (116), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 14:32:24,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 150 transitions. [2025-02-05 14:32:24,609 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 150 transitions. Word has length 38 [2025-02-05 14:32:24,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:24,609 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 150 transitions. [2025-02-05 14:32:24,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 14:32:24,610 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 150 transitions. [2025-02-05 14:32:24,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 14:32:24,611 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:24,611 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 14:32:24,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 14:32:24,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 14:32:24,812 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:24,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:24,813 INFO L85 PathProgramCache]: Analyzing trace with hash -2021818514, now seen corresponding path program 1 times [2025-02-05 14:32:24,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:24,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092170986] [2025-02-05 14:32:24,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:24,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:24,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 14:32:24,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 14:32:24,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:24,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:25,426 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:25,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:25,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092170986] [2025-02-05 14:32:25,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092170986] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:32:25,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150457717] [2025-02-05 14:32:25,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:25,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:25,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:25,430 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:32:25,431 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:32:25,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 14:32:25,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 14:32:25,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:25,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:25,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 14:32:25,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:32:25,642 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 14:32:25,643 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:32:25,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150457717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:25,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 14:32:25,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-02-05 14:32:25,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018418576] [2025-02-05 14:32:25,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:25,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:32:25,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:25,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:32:25,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 14:32:25,645 INFO L87 Difference]: Start difference. First operand 121 states and 150 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 14:32:25,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:25,725 INFO L93 Difference]: Finished difference Result 252 states and 326 transitions. [2025-02-05 14:32:25,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 14:32:25,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2025-02-05 14:32:25,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:25,727 INFO L225 Difference]: With dead ends: 252 [2025-02-05 14:32:25,727 INFO L226 Difference]: Without dead ends: 134 [2025-02-05 14:32:25,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-02-05 14:32:25,728 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 14 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:25,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 558 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:32:25,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-02-05 14:32:25,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-02-05 14:32:25,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 99 states have (on average 1.2626262626262625) internal successors, (125), 117 states have internal predecessors, (125), 27 states have call successors, (27), 8 states have call predecessors, (27), 7 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-05 14:32:25,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 165 transitions. [2025-02-05 14:32:25,738 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 165 transitions. Word has length 39 [2025-02-05 14:32:25,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:25,738 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 165 transitions. [2025-02-05 14:32:25,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 14:32:25,738 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 165 transitions. [2025-02-05 14:32:25,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-05 14:32:25,740 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:25,740 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:25,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 14:32:25,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:25,941 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:25,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:25,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1637650286, now seen corresponding path program 1 times [2025-02-05 14:32:25,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:25,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916809898] [2025-02-05 14:32:25,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:25,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:25,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-05 14:32:25,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 14:32:25,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:25,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:26,748 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-02-05 14:32:26,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:26,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916809898] [2025-02-05 14:32:26,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916809898] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:32:26,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701538242] [2025-02-05 14:32:26,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:26,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:26,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:26,751 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:32:26,753 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:32:26,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-05 14:32:26,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 14:32:26,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:26,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:26,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 1069 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-05 14:32:26,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:32:27,081 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-05 14:32:27,081 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:32:27,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701538242] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:27,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 14:32:27,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 13 [2025-02-05 14:32:27,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605547689] [2025-02-05 14:32:27,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:27,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 14:32:27,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:27,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 14:32:27,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-05 14:32:27,083 INFO L87 Difference]: Start difference. First operand 134 states and 165 transitions. Second operand has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 14:32:27,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:27,333 INFO L93 Difference]: Finished difference Result 267 states and 336 transitions. [2025-02-05 14:32:27,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 14:32:27,334 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 111 [2025-02-05 14:32:27,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:27,335 INFO L225 Difference]: With dead ends: 267 [2025-02-05 14:32:27,335 INFO L226 Difference]: Without dead ends: 138 [2025-02-05 14:32:27,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-02-05 14:32:27,336 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 49 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:27,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 501 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 14:32:27,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-05 14:32:27,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-02-05 14:32:27,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 102 states have (on average 1.2549019607843137) internal successors, (128), 121 states have internal predecessors, (128), 27 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (15), 11 states have call predecessors, (15), 13 states have call successors, (15) [2025-02-05 14:32:27,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 170 transitions. [2025-02-05 14:32:27,346 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 170 transitions. Word has length 111 [2025-02-05 14:32:27,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:27,346 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 170 transitions. [2025-02-05 14:32:27,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 14:32:27,346 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 170 transitions. [2025-02-05 14:32:27,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-05 14:32:27,348 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:27,348 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:27,357 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:32:27,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:27,549 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:27,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:27,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1376356750, now seen corresponding path program 1 times [2025-02-05 14:32:27,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:27,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040116335] [2025-02-05 14:32:27,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:27,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:27,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-05 14:32:27,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 14:32:27,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:27,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:28,170 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-02-05 14:32:28,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:28,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040116335] [2025-02-05 14:32:28,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040116335] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:32:28,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102997291] [2025-02-05 14:32:28,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:28,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:28,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:28,173 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:32:28,174 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:32:28,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-05 14:32:28,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 14:32:28,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:28,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:28,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 1051 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-05 14:32:28,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:32:28,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:32:28,602 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 8 [2025-02-05 14:32:28,695 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-05 14:32:28,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:32:28,932 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 30 treesize of output 26 [2025-02-05 14:32:28,940 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 30 treesize of output 26 [2025-02-05 14:32:29,072 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-05 14:32:29,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102997291] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:32:29,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:32:29,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 15] total 25 [2025-02-05 14:32:29,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631162046] [2025-02-05 14:32:29,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:32:29,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 14:32:29,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:29,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 14:32:29,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2025-02-05 14:32:29,075 INFO L87 Difference]: Start difference. First operand 138 states and 170 transitions. Second operand has 25 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 21 states have internal predecessors, (69), 9 states have call successors, (16), 4 states have call predecessors, (16), 7 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2025-02-05 14:32:30,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:30,227 INFO L93 Difference]: Finished difference Result 355 states and 439 transitions. [2025-02-05 14:32:30,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-05 14:32:30,228 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 21 states have internal predecessors, (69), 9 states have call successors, (16), 4 states have call predecessors, (16), 7 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) Word has length 111 [2025-02-05 14:32:30,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:30,230 INFO L225 Difference]: With dead ends: 355 [2025-02-05 14:32:30,230 INFO L226 Difference]: Without dead ends: 209 [2025-02-05 14:32:30,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=199, Invalid=1693, Unknown=0, NotChecked=0, Total=1892 [2025-02-05 14:32:30,232 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 173 mSDsluCounter, 2084 mSDsCounter, 0 mSdLazyCounter, 1675 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 2200 SdHoareTripleChecker+Invalid, 1716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:30,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 2200 Invalid, 1716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1675 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 14:32:30,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-05 14:32:30,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 177. [2025-02-05 14:32:30,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 136 states have (on average 1.2279411764705883) internal successors, (167), 154 states have internal predecessors, (167), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (17), 13 states have call predecessors, (17), 15 states have call successors, (17) [2025-02-05 14:32:30,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 213 transitions. [2025-02-05 14:32:30,254 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 213 transitions. Word has length 111 [2025-02-05 14:32:30,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:30,254 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 213 transitions. [2025-02-05 14:32:30,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 21 states have internal predecessors, (69), 9 states have call successors, (16), 4 states have call predecessors, (16), 7 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2025-02-05 14:32:30,256 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 213 transitions. [2025-02-05 14:32:30,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 14:32:30,256 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:30,257 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 14:32:30,266 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:32:30,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:30,457 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:30,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:30,458 INFO L85 PathProgramCache]: Analyzing trace with hash -2028264169, now seen corresponding path program 1 times [2025-02-05 14:32:30,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:30,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086205146] [2025-02-05 14:32:30,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:30,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:30,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 14:32:30,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 14:32:30,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:30,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:37,132 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 84 proven. 36 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 14:32:37,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:37,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086205146] [2025-02-05 14:32:37,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086205146] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:32:37,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305192926] [2025-02-05 14:32:37,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:37,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:37,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:37,136 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:32:37,137 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:32:37,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 14:32:37,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 14:32:37,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:37,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:37,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 208 conjuncts are in the unsatisfiable core [2025-02-05 14:32:37,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:32:37,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:32:37,813 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:32:37,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-05 14:32:38,030 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:32:38,120 INFO L349 Elim1Store]: treesize reduction 33, result has 38.9 percent of original size [2025-02-05 14:32:38,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 29 [2025-02-05 14:32:38,474 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:33:18,841 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 120 treesize of output 76 [2025-02-05 14:33:20,834 INFO L349 Elim1Store]: treesize reduction 105, result has 16.0 percent of original size [2025-02-05 14:33:20,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 104 treesize of output 138 [2025-02-05 14:33:20,992 INFO L224 Elim1Store]: Index analysis took 108 ms [2025-02-05 14:33:21,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:33:21,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 189 [2025-02-05 14:33:27,798 INFO L349 Elim1Store]: treesize reduction 131, result has 3.7 percent of original size [2025-02-05 14:33:27,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 67 treesize of output 43 [2025-02-05 14:33:28,391 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:33:28,408 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:33:28,418 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 65 treesize of output 41 [2025-02-05 14:33:29,755 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:33:29,765 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 24 treesize of output 16 [2025-02-05 14:33:34,303 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 20 treesize of output 12 [2025-02-05 14:33:37,665 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 8 [2025-02-05 14:33:37,677 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 50 proven. 79 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 14:33:37,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:33:45,639 INFO L349 Elim1Store]: treesize reduction 21, result has 67.2 percent of original size [2025-02-05 14:33:45,640 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 57 [2025-02-05 14:33:45,650 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:45,652 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:45,658 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 37 treesize of output 29 [2025-02-05 14:33:45,755 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-02-05 14:33:45,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 150 treesize of output 150 [2025-02-05 14:33:49,386 INFO L349 Elim1Store]: treesize reduction 263, result has 46.2 percent of original size [2025-02-05 14:33:49,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41854 treesize of output 30070 [2025-02-05 14:33:49,444 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:49,447 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:49,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:33:49,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1826 treesize of output 1832 [2025-02-05 14:33:49,580 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 1960 treesize of output 1836 [2025-02-05 14:33:49,629 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 2432 treesize of output 2268 [2025-02-05 14:33:49,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:33:49,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1661 treesize of output 1662 [2025-02-05 14:33:49,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:33:49,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1653 treesize of output 1646 [2025-02-05 14:33:50,010 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-02-05 14:33:50,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 155 [2025-02-05 14:33:53,985 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 10 treesize of output 8 [2025-02-05 14:33:54,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:33:54,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 180 [2025-02-05 14:33:56,308 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 30