./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/tree-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/tree-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 ff6ec4010c0396675f743c4c0d5de68176a7292a1f0bcf6c389633f85d936d1a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:41:42,816 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:41:42,898 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:41:42,904 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:41:42,907 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:41:42,932 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:41:42,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:41:42,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:41:42,934 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:41:42,934 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:41:42,935 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:41:42,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:41:42,935 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:41:42,935 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:41:42,936 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:41:42,936 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:41:42,937 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:41:42,937 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:41:42,937 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:41:42,937 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:41:42,937 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:41:42,937 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:41:42,937 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:41:42,937 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:41:42,937 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:41:42,938 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:41:42,938 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:41:42,938 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:41:42,938 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:41:42,938 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:41:42,938 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:41:42,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:41:42,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:41:42,939 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:41:42,939 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:41:42,939 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:41:42,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:41:42,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:41:42,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:41:42,940 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:41:42,940 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:41:42,940 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:41:42,940 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:41:42,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:41:42,941 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:41:42,941 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:41:42,941 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:41:42,941 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:41:42,941 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 -> ff6ec4010c0396675f743c4c0d5de68176a7292a1f0bcf6c389633f85d936d1a [2025-01-09 02:41:43,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:41:43,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:41:43,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:41:43,233 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:41:43,233 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:41:43,234 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/tree-2.i [2025-01-09 02:41:44,546 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2189c9181/3a2b8d9791d24d01bea747e1232948f9/FLAG31af950b8 [2025-01-09 02:41:44,926 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:41:44,930 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/tree-2.i [2025-01-09 02:41:44,949 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2189c9181/3a2b8d9791d24d01bea747e1232948f9/FLAG31af950b8 [2025-01-09 02:41:45,136 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2189c9181/3a2b8d9791d24d01bea747e1232948f9 [2025-01-09 02:41:45,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:41:45,139 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:41:45,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:41:45,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:41:45,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:41:45,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:41:45" (1/1) ... [2025-01-09 02:41:45,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c700d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:45, skipping insertion in model container [2025-01-09 02:41:45,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:41:45" (1/1) ... [2025-01-09 02:41:45,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:41:45,378 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/tree-2.i[22626,22639] [2025-01-09 02:41:45,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:41:45,423 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:41:45,457 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/tree-2.i[22626,22639] [2025-01-09 02:41:45,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:41:45,494 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:41:45,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:45 WrapperNode [2025-01-09 02:41:45,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:41:45,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:41:45,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:41:45,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:41:45,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:45" (1/1) ... [2025-01-09 02:41:45,511 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:45" (1/1) ... [2025-01-09 02:41:45,534 INFO L138 Inliner]: procedures = 122, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2025-01-09 02:41:45,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:41:45,536 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:41:45,537 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:41:45,538 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:41:45,545 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:45" (1/1) ... [2025-01-09 02:41:45,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:45" (1/1) ... [2025-01-09 02:41:45,550 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:45" (1/1) ... [2025-01-09 02:41:45,567 INFO L175 MemorySlicer]: Split 28 memory accesses to 2 slices as follows [2, 26]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2025-01-09 02:41:45,568 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:45" (1/1) ... [2025-01-09 02:41:45,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:45" (1/1) ... [2025-01-09 02:41:45,575 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:45" (1/1) ... [2025-01-09 02:41:45,577 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:45" (1/1) ... [2025-01-09 02:41:45,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:45" (1/1) ... [2025-01-09 02:41:45,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:45" (1/1) ... [2025-01-09 02:41:45,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:45" (1/1) ... [2025-01-09 02:41:45,593 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:41:45,593 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:41:45,593 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:41:45,593 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:41:45,594 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:45" (1/1) ... [2025-01-09 02:41:45,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:41:45,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:41:45,625 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-01-09 02:41:45,627 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-01-09 02:41:45,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 02:41:45,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 02:41:45,650 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-01-09 02:41:45,650 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-01-09 02:41:45,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 02:41:45,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 02:41:45,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 02:41:45,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:41:45,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 02:41:45,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 02:41:45,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 02:41:45,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 02:41:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 02:41:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:41:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 02:41:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:41:45,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:41:45,760 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:41:45,762 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:41:45,975 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-01-09 02:41:45,975 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:41:45,984 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:41:45,984 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2025-01-09 02:41:45,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:41:45 BoogieIcfgContainer [2025-01-09 02:41:45,984 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:41:45,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:41:45,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:41:45,989 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:41:45,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:41:45" (1/3) ... [2025-01-09 02:41:45,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f9a157c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:41:45, skipping insertion in model container [2025-01-09 02:41:45,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:45" (2/3) ... [2025-01-09 02:41:45,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f9a157c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:41:45, skipping insertion in model container [2025-01-09 02:41:45,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:41:45" (3/3) ... [2025-01-09 02:41:45,991 INFO L128 eAbstractionObserver]: Analyzing ICFG tree-2.i [2025-01-09 02:41:46,002 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:41:46,004 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tree-2.i that has 2 procedures, 44 locations, 1 initial locations, 8 loop locations, and 1 error locations. [2025-01-09 02:41:46,045 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:41:46,055 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;@6f1d726a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:41:46,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:41:46,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 1.631578947368421) internal successors, (62), 42 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:41:46,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 02:41:46,065 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:41:46,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:41:46,066 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:41:46,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:41:46,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1531118652, now seen corresponding path program 1 times [2025-01-09 02:41:46,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:41:46,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325238820] [2025-01-09 02:41:46,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:41:46,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:41:46,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 02:41:46,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 02:41:46,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:41:46,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:41:46,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:41:46,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:41:46,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325238820] [2025-01-09 02:41:46,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325238820] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:41:46,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:41:46,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 02:41:46,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306079407] [2025-01-09 02:41:46,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:41:46,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 02:41:46,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:41:46,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 02:41:46,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 02:41:46,233 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 1.631578947368421) internal successors, (62), 42 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:41:46,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:41:46,253 INFO L93 Difference]: Finished difference Result 84 states and 133 transitions. [2025-01-09 02:41:46,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 02:41:46,255 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 02:41:46,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:41:46,260 INFO L225 Difference]: With dead ends: 84 [2025-01-09 02:41:46,261 INFO L226 Difference]: Without dead ends: 30 [2025-01-09 02:41:46,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-01-09 02:41:46,267 INFO L435 NwaCegarLoop]: 53 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, 53 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-01-09 02:41:46,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:41:46,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-01-09 02:41:46,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-01-09 02:41:46,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:41:46,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-01-09 02:41:46,295 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 9 [2025-01-09 02:41:46,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:41:46,295 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-01-09 02:41:46,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:41:46,296 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-01-09 02:41:46,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 02:41:46,296 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:41:46,296 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:41:46,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:41:46,297 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:41:46,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:41:46,297 INFO L85 PathProgramCache]: Analyzing trace with hash 840038319, now seen corresponding path program 1 times [2025-01-09 02:41:46,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:41:46,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634635313] [2025-01-09 02:41:46,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:41:46,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:41:46,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 02:41:46,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 02:41:46,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:41:46,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:41:46,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:41:46,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:41:46,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634635313] [2025-01-09 02:41:46,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634635313] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:41:46,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:41:46,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 02:41:46,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878755057] [2025-01-09 02:41:46,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:41:46,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:41:46,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:41:46,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:41:46,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:41:46,484 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:41:46,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:41:46,523 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2025-01-09 02:41:46,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:41:46,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-09 02:41:46,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:41:46,525 INFO L225 Difference]: With dead ends: 69 [2025-01-09 02:41:46,525 INFO L226 Difference]: Without dead ends: 36 [2025-01-09 02:41:46,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:41:46,526 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:41:46,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 122 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:41:46,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-09 02:41:46,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-01-09 02:41:46,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.21875) internal successors, (39), 34 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:41:46,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-01-09 02:41:46,536 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 10 [2025-01-09 02:41:46,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:41:46,536 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-01-09 02:41:46,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:41:46,536 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2025-01-09 02:41:46,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 02:41:46,536 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:41:46,536 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:41:46,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 02:41:46,537 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:41:46,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:41:46,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1159974534, now seen corresponding path program 1 times [2025-01-09 02:41:46,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:41:46,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172564445] [2025-01-09 02:41:46,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:41:46,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:41:46,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 02:41:46,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 02:41:46,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:41:46,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:41:46,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:41:46,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:41:46,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172564445] [2025-01-09 02:41:46,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172564445] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:41:46,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:41:46,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:41:46,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347356590] [2025-01-09 02:41:46,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:41:46,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:41:46,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:41:46,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:41:46,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:41:46,651 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:41:46,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:41:46,712 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2025-01-09 02:41:46,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:41:46,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-01-09 02:41:46,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:41:46,714 INFO L225 Difference]: With dead ends: 57 [2025-01-09 02:41:46,714 INFO L226 Difference]: Without dead ends: 39 [2025-01-09 02:41:46,714 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-01-09 02:41:46,715 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:41:46,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 55 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:41:46,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-09 02:41:46,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2025-01-09 02:41:46,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 35 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:41:46,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-01-09 02:41:46,721 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 17 [2025-01-09 02:41:46,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:41:46,721 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-01-09 02:41:46,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:41:46,721 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2025-01-09 02:41:46,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 02:41:46,722 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:41:46,722 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:41:46,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 02:41:46,723 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:41:46,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:41:46,723 INFO L85 PathProgramCache]: Analyzing trace with hash 2147333050, now seen corresponding path program 1 times [2025-01-09 02:41:46,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:41:46,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709641450] [2025-01-09 02:41:46,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:41:46,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:41:46,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 02:41:46,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 02:41:46,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:41:46,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:41:46,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:41:46,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:41:46,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709641450] [2025-01-09 02:41:46,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709641450] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:41:46,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:41:46,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 02:41:46,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250466192] [2025-01-09 02:41:46,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:41:46,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:41:46,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:41:46,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:41:46,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:41:46,979 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:41:47,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:41:47,120 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2025-01-09 02:41:47,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 02:41:47,120 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-09 02:41:47,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:41:47,121 INFO L225 Difference]: With dead ends: 78 [2025-01-09 02:41:47,121 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 02:41:47,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 02:41:47,122 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 51 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:41:47,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 107 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:41:47,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 02:41:47,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2025-01-09 02:41:47,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:41:47,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-01-09 02:41:47,127 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 20 [2025-01-09 02:41:47,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:41:47,128 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-01-09 02:41:47,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:41:47,128 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-01-09 02:41:47,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 02:41:47,129 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:41:47,129 INFO L218 NwaCegarLoop]: trace histogram [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-01-09 02:41:47,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 02:41:47,129 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:41:47,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:41:47,130 INFO L85 PathProgramCache]: Analyzing trace with hash -167543236, now seen corresponding path program 1 times [2025-01-09 02:41:47,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:41:47,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560436002] [2025-01-09 02:41:47,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:41:47,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:41:47,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 02:41:47,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 02:41:47,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:41:47,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:41:48,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:41:48,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:41:48,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560436002] [2025-01-09 02:41:48,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560436002] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:41:48,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303261880] [2025-01-09 02:41:48,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:41:48,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:41:48,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:41:48,916 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-01-09 02:41:48,918 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-01-09 02:41:48,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 02:41:49,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 02:41:49,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:41:49,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:41:49,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-01-09 02:41:49,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:41:49,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-01-09 02:41:49,194 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 11 treesize of output 7 [2025-01-09 02:41:49,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-01-09 02:41:49,220 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 02:41:49,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-01-09 02:41:49,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-01-09 02:41:49,370 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2025-01-09 02:41:49,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1746 treesize of output 1311 [2025-01-09 02:41:49,410 INFO L349 Elim1Store]: treesize reduction 49, result has 9.3 percent of original size [2025-01-09 02:41:49,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 774 treesize of output 499 [2025-01-09 02:41:49,429 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2025-01-09 02:41:49,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 38 [2025-01-09 02:41:49,462 INFO L349 Elim1Store]: treesize reduction 213, result has 0.5 percent of original size [2025-01-09 02:41:49,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 1026 treesize of output 772 [2025-01-09 02:41:49,480 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2025-01-09 02:41:49,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 658 treesize of output 1 [2025-01-09 02:41:49,520 INFO L349 Elim1Store]: treesize reduction 385, result has 0.3 percent of original size [2025-01-09 02:41:49,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 10 new quantified variables, introduced 12 case distinctions, treesize of input 2141 treesize of output 1515 [2025-01-09 02:41:49,549 INFO L349 Elim1Store]: treesize reduction 211, result has 0.5 percent of original size [2025-01-09 02:41:49,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 1520 treesize of output 1157 [2025-01-09 02:41:49,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 24 treesize of output 12 [2025-01-09 02:41:49,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:41:49,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:41:49,972 INFO L349 Elim1Store]: treesize reduction 15, result has 70.0 percent of original size [2025-01-09 02:41:49,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 228 treesize of output 149 [2025-01-09 02:41:50,054 INFO L349 Elim1Store]: treesize reduction 56, result has 48.1 percent of original size [2025-01-09 02:41:50,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 2524 treesize of output 2369 [2025-01-09 02:41:50,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:41:50,190 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 6334 treesize of output 5526 [2025-01-09 02:41:50,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:41:50,371 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 1762 treesize of output 1705 [2025-01-09 02:41:50,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:41:50,470 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 1680 treesize of output 1559 [2025-01-09 02:41:50,537 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 1534 treesize of output 1496 [2025-01-09 02:41:51,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:41:51,431 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 17 treesize of output 21 [2025-01-09 02:41:51,503 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 02:41:51,504 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 49 treesize of output 43 [2025-01-09 02:41:51,560 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 6 treesize of output 4 [2025-01-09 02:41:51,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:41:51,584 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 161 treesize of output 169 [2025-01-09 02:41:51,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:41:51,724 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 30 treesize of output 30 [2025-01-09 02:41:51,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:41:51,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303261880] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:41:51,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:41:51,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2025-01-09 02:41:51,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035701825] [2025-01-09 02:41:51,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:41:51,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 02:41:51,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:41:51,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 02:41:51,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=432, Unknown=4, NotChecked=0, Total=506 [2025-01-09 02:41:51,886 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:41:52,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:41:52,373 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2025-01-09 02:41:52,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 02:41:52,373 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-01-09 02:41:52,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:41:52,374 INFO L225 Difference]: With dead ends: 80 [2025-01-09 02:41:52,374 INFO L226 Difference]: Without dead ends: 67 [2025-01-09 02:41:52,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=545, Unknown=4, NotChecked=0, Total=650 [2025-01-09 02:41:52,375 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 79 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 02:41:52,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 295 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 02:41:52,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-09 02:41:52,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2025-01-09 02:41:52,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:41:52,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-01-09 02:41:52,385 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 25 [2025-01-09 02:41:52,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:41:52,386 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-01-09 02:41:52,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:41:52,386 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-01-09 02:41:52,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 02:41:52,387 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:41:52,387 INFO L218 NwaCegarLoop]: trace histogram [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-01-09 02:41:52,396 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-01-09 02:41:52,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:41:52,592 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:41:52,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:41:52,593 INFO L85 PathProgramCache]: Analyzing trace with hash -188537304, now seen corresponding path program 1 times [2025-01-09 02:41:52,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:41:52,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215205486] [2025-01-09 02:41:52,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:41:52,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:41:52,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 02:41:52,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 02:41:52,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:41:52,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:41:53,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:41:53,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:41:53,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215205486] [2025-01-09 02:41:53,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215205486] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:41:53,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460365318] [2025-01-09 02:41:53,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:41:53,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:41:53,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:41:53,523 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-01-09 02:41:53,526 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-01-09 02:41:53,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 02:41:53,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 02:41:53,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:41:53,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:41:53,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-01-09 02:41:53,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:41:53,646 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-01-09 02:41:53,688 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 02:41:53,688 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 15 treesize of output 15 [2025-01-09 02:41:53,695 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-01-09 02:41:53,704 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-01-09 02:43:20,285 WARN L286 SmtUtils]: Spent 1.44m on a formula simplification. DAG size of input: 377 DAG size of output: 89 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-01-09 02:43:20,285 INFO L349 Elim1Store]: treesize reduction 3825, result has 6.3 percent of original size [2025-01-09 02:43:20,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 13 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 19 new quantified variables, introduced 57 case distinctions, treesize of input 40606 treesize of output 27164 [2025-01-09 02:43:20,542 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:43:20,548 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:43:20,563 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-01-09 02:43:22,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:43:22,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:43:22,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:43:22,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:43:22,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:43:23,586 INFO L224 Elim1Store]: Index analysis took 153 ms