./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/n.c24.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/loops/n.c24.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 ff2f22c8c94593047c07aca289bcba7e507bc3ee948a7529dc94c8d7792bd95d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:53:18,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:53:18,652 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:53:18,657 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:53:18,657 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:53:18,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:53:18,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:53:18,675 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:53:18,675 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:53:18,675 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:53:18,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:53:18,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:53:18,676 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:53:18,676 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:53:18,676 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:53:18,676 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:53:18,676 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:53:18,676 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:53:18,676 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:53:18,676 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:53:18,676 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:53:18,676 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:53:18,677 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:53:18,677 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:53:18,677 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:53:18,677 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:53:18,677 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:53:18,677 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:53:18,677 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:53:18,677 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:53:18,677 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:53:18,677 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:53:18,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:53:18,678 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:53:18,678 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:53:18,678 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:53:18,678 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:53:18,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:53:18,678 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:53:18,678 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:53:18,678 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:53:18,678 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:53:18,678 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:53:18,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:53:18,679 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:53:18,679 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:53:18,679 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:53:18,679 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:53:18,679 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 -> ff2f22c8c94593047c07aca289bcba7e507bc3ee948a7529dc94c8d7792bd95d [2025-01-09 02:53:18,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:53:18,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:53:18,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:53:18,935 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:53:18,935 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:53:18,936 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/n.c24.i [2025-01-09 02:53:20,081 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b90a2d1fc/5ebc42034b194d16a17685f4724de222/FLAG2e14a1547 [2025-01-09 02:53:20,305 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:53:20,305 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops/n.c24.i [2025-01-09 02:53:20,311 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b90a2d1fc/5ebc42034b194d16a17685f4724de222/FLAG2e14a1547 [2025-01-09 02:53:20,645 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b90a2d1fc/5ebc42034b194d16a17685f4724de222 [2025-01-09 02:53:20,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:53:20,648 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:53:20,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:53:20,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:53:20,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:53:20,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:53:20" (1/1) ... [2025-01-09 02:53:20,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@216d678a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:20, skipping insertion in model container [2025-01-09 02:53:20,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:53:20" (1/1) ... [2025-01-09 02:53:20,671 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:53:20,772 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/loops/n.c24.i[805,818] [2025-01-09 02:53:20,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:53:20,824 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:53:20,833 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/loops/n.c24.i[805,818] [2025-01-09 02:53:20,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:53:20,868 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:53:20,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:20 WrapperNode [2025-01-09 02:53:20,870 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:53:20,871 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:53:20,871 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:53:20,871 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:53:20,875 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:53:20" (1/1) ... [2025-01-09 02:53:20,882 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:53:20" (1/1) ... [2025-01-09 02:53:20,902 INFO L138 Inliner]: procedures = 68, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 151 [2025-01-09 02:53:20,905 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:53:20,906 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:53:20,906 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:53:20,907 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:53:20,917 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:20" (1/1) ... [2025-01-09 02:53:20,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:20" (1/1) ... [2025-01-09 02:53:20,924 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:20" (1/1) ... [2025-01-09 02:53:20,956 INFO L175 MemorySlicer]: Split 21 memory accesses to 4 slices as follows [2, 8, 2, 9]. 43 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0, 0]. The 6 writes are split as follows [0, 0, 1, 5]. [2025-01-09 02:53:20,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:20" (1/1) ... [2025-01-09 02:53:20,960 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:20" (1/1) ... [2025-01-09 02:53:20,971 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:20" (1/1) ... [2025-01-09 02:53:20,974 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:20" (1/1) ... [2025-01-09 02:53:20,981 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:20" (1/1) ... [2025-01-09 02:53:20,983 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:20" (1/1) ... [2025-01-09 02:53:20,986 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:20" (1/1) ... [2025-01-09 02:53:20,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:53:20,991 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:53:20,991 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:53:20,992 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:53:20,992 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:20" (1/1) ... [2025-01-09 02:53:20,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:53:21,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:53:21,025 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:53:21,031 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:53:21,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:53:21,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 02:53:21,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 02:53:21,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 02:53:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 02:53:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 02:53:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 02:53:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 02:53:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 02:53:21,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 02:53:21,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 02:53:21,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 02:53:21,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 02:53:21,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 02:53:21,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 02:53:21,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:53:21,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 02:53:21,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 02:53:21,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 02:53:21,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-01-09 02:53:21,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-01-09 02:53:21,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-01-09 02:53:21,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-01-09 02:53:21,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:53:21,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:53:21,109 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:53:21,111 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:53:21,277 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-01-09 02:53:21,277 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:53:21,284 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:53:21,284 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 02:53:21,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:53:21 BoogieIcfgContainer [2025-01-09 02:53:21,286 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:53:21,287 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:53:21,287 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:53:21,290 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:53:21,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:53:20" (1/3) ... [2025-01-09 02:53:21,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6317efc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:53:21, skipping insertion in model container [2025-01-09 02:53:21,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:53:20" (2/3) ... [2025-01-09 02:53:21,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6317efc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:53:21, skipping insertion in model container [2025-01-09 02:53:21,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:53:21" (3/3) ... [2025-01-09 02:53:21,294 INFO L128 eAbstractionObserver]: Analyzing ICFG n.c24.i [2025-01-09 02:53:21,303 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:53:21,308 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG n.c24.i that has 1 procedures, 32 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-01-09 02:53:21,338 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:53:21,348 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;@60c3625a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:53:21,348 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:53:21,350 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 31 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:21,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 02:53:21,353 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:53:21,353 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 02:53:21,353 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:53:21,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:53:21,356 INFO L85 PathProgramCache]: Analyzing trace with hash 889687456, now seen corresponding path program 1 times [2025-01-09 02:53:21,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:53:21,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868578398] [2025-01-09 02:53:21,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:53:21,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:53:21,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 02:53:21,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 02:53:21,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:53:21,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:21,474 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:53:21,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:53:21,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868578398] [2025-01-09 02:53:21,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868578398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:53:21,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:53:21,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:53:21,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282226192] [2025-01-09 02:53:21,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:53:21,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:53:21,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:53:21,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:53:21,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:53:21,490 INFO L87 Difference]: Start difference. First operand has 32 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 31 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:21,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:53:21,544 INFO L93 Difference]: Finished difference Result 85 states and 129 transitions. [2025-01-09 02:53:21,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:53:21,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-09 02:53:21,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:53:21,552 INFO L225 Difference]: With dead ends: 85 [2025-01-09 02:53:21,552 INFO L226 Difference]: Without dead ends: 51 [2025-01-09 02:53:21,555 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:53:21,558 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 33 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:53:21,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 72 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:53:21,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-09 02:53:21,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2025-01-09 02:53:21,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:21,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2025-01-09 02:53:21,580 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 6 [2025-01-09 02:53:21,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:53:21,582 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2025-01-09 02:53:21,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:21,582 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2025-01-09 02:53:21,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 02:53:21,582 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:53:21,583 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:53:21,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:53:21,583 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:53:21,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:53:21,584 INFO L85 PathProgramCache]: Analyzing trace with hash 15958903, now seen corresponding path program 1 times [2025-01-09 02:53:21,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:53:21,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922456153] [2025-01-09 02:53:21,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:53:21,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:53:21,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 02:53:21,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 02:53:21,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:53:21,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:21,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:53:21,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:53:21,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922456153] [2025-01-09 02:53:21,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922456153] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:53:21,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535764166] [2025-01-09 02:53:21,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:53:21,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:53:21,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:53:21,659 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:53:21,662 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:53:21,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 02:53:21,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 02:53:21,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:53:21,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:21,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 02:53:21,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:53:21,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:53:21,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:53:21,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:53:21,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535764166] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:53:21,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:53:21,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 02:53:21,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304739202] [2025-01-09 02:53:21,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:53:21,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:53:21,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:53:21,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:53:21,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:53:21,765 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:21,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:53:21,817 INFO L93 Difference]: Finished difference Result 125 states and 177 transitions. [2025-01-09 02:53:21,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:53:21,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-09 02:53:21,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:53:21,818 INFO L225 Difference]: With dead ends: 125 [2025-01-09 02:53:21,818 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 02:53:21,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:53:21,819 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 120 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:53:21,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 143 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:53:21,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 02:53:21,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 02:53:21,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:21,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 136 transitions. [2025-01-09 02:53:21,827 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 136 transitions. Word has length 12 [2025-01-09 02:53:21,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:53:21,827 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 136 transitions. [2025-01-09 02:53:21,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:21,827 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 136 transitions. [2025-01-09 02:53:21,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 02:53:21,828 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:53:21,828 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-01-09 02:53:21,835 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-01-09 02:53:22,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:53:22,032 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:53:22,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:53:22,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1975418272, now seen corresponding path program 2 times [2025-01-09 02:53:22,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:53:22,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971505928] [2025-01-09 02:53:22,033 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:53:22,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:53:22,045 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-09 02:53:22,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 02:53:22,065 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:53:22,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:22,233 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 02:53:22,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:53:22,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971505928] [2025-01-09 02:53:22,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971505928] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:53:22,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:53:22,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:53:22,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940107481] [2025-01-09 02:53:22,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:53:22,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:53:22,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:53:22,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:53:22,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:53:22,235 INFO L87 Difference]: Start difference. First operand 99 states and 136 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:22,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:53:22,272 INFO L93 Difference]: Finished difference Result 188 states and 261 transitions. [2025-01-09 02:53:22,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:53:22,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-01-09 02:53:22,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:53:22,275 INFO L225 Difference]: With dead ends: 188 [2025-01-09 02:53:22,275 INFO L226 Difference]: Without dead ends: 185 [2025-01-09 02:53:22,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:53:22,276 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 27 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:53:22,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 105 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:53:22,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-01-09 02:53:22,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 100. [2025-01-09 02:53:22,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.393939393939394) internal successors, (138), 99 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:22,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2025-01-09 02:53:22,285 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 30 [2025-01-09 02:53:22,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:53:22,285 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2025-01-09 02:53:22,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:22,285 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2025-01-09 02:53:22,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 02:53:22,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:53:22,286 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:53:22,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 02:53:22,286 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:53:22,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:53:22,286 INFO L85 PathProgramCache]: Analyzing trace with hash -382878930, now seen corresponding path program 1 times [2025-01-09 02:53:22,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:53:22,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609821893] [2025-01-09 02:53:22,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:53:22,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:53:22,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 02:53:22,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 02:53:22,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:53:22,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:22,447 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 02:53:22,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:53:22,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609821893] [2025-01-09 02:53:22,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609821893] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:53:22,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383308634] [2025-01-09 02:53:22,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:53:22,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:53:22,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:53:22,450 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:53:22,451 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:53:22,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 02:53:22,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 02:53:22,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:53:22,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:22,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 02:53:22,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:53:22,569 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 02:53:22,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:53:22,651 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 02:53:22,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383308634] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:53:22,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:53:22,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-09 02:53:22,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924914889] [2025-01-09 02:53:22,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:53:22,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 02:53:22,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:53:22,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 02:53:22,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 02:53:22,653 INFO L87 Difference]: Start difference. First operand 100 states and 138 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:22,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:53:22,772 INFO L93 Difference]: Finished difference Result 351 states and 498 transitions. [2025-01-09 02:53:22,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 02:53:22,772 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-01-09 02:53:22,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:53:22,773 INFO L225 Difference]: With dead ends: 351 [2025-01-09 02:53:22,774 INFO L226 Difference]: Without dead ends: 258 [2025-01-09 02:53:22,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 02:53:22,774 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 540 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:53:22,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 271 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:53:22,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-01-09 02:53:22,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 238. [2025-01-09 02:53:22,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.3924050632911393) internal successors, (330), 237 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:22,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 330 transitions. [2025-01-09 02:53:22,788 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 330 transitions. Word has length 35 [2025-01-09 02:53:22,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:53:22,788 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 330 transitions. [2025-01-09 02:53:22,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:22,789 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 330 transitions. [2025-01-09 02:53:22,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 02:53:22,790 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:53:22,790 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:53:22,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 02:53:22,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:53:22,991 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:53:22,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:53:22,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1324661746, now seen corresponding path program 2 times [2025-01-09 02:53:22,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:53:22,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323598872] [2025-01-09 02:53:22,991 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:53:22,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:53:23,005 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-01-09 02:53:23,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 02:53:23,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:53:23,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:23,480 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-01-09 02:53:23,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:53:23,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323598872] [2025-01-09 02:53:23,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323598872] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:53:23,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919972034] [2025-01-09 02:53:23,480 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:53:23,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:53:23,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:53:23,482 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-01-09 02:53:23,483 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-01-09 02:53:23,537 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-01-09 02:53:23,571 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 02:53:23,571 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:53:23,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:23,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 02:53:23,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:53:23,598 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-01-09 02:53:23,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:53:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-01-09 02:53:23,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919972034] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:53:23,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:53:23,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-01-09 02:53:23,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819750254] [2025-01-09 02:53:23,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:53:23,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 02:53:23,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:53:23,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 02:53:23,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-01-09 02:53:23,792 INFO L87 Difference]: Start difference. First operand 238 states and 330 transitions. Second operand has 25 states, 25 states have (on average 1.6) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:24,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:53:24,043 INFO L93 Difference]: Finished difference Result 777 states and 1104 transitions. [2025-01-09 02:53:24,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 02:53:24,044 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.6) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-01-09 02:53:24,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:53:24,047 INFO L225 Difference]: With dead ends: 777 [2025-01-09 02:53:24,047 INFO L226 Difference]: Without dead ends: 552 [2025-01-09 02:53:24,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-01-09 02:53:24,049 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 1710 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1710 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:53:24,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1710 Valid, 565 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 02:53:24,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-01-09 02:53:24,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 514. [2025-01-09 02:53:24,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 513 states have (on average 1.391812865497076) internal successors, (714), 513 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:24,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 714 transitions. [2025-01-09 02:53:24,099 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 714 transitions. Word has length 71 [2025-01-09 02:53:24,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:53:24,099 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 714 transitions. [2025-01-09 02:53:24,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.6) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:24,099 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 714 transitions. [2025-01-09 02:53:24,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 02:53:24,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:53:24,106 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:53:24,112 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-01-09 02:53:24,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:53:24,306 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:53:24,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:53:24,307 INFO L85 PathProgramCache]: Analyzing trace with hash -749339186, now seen corresponding path program 3 times [2025-01-09 02:53:24,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:53:24,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040985354] [2025-01-09 02:53:24,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 02:53:24,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:53:24,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 143 statements into 23 equivalence classes. [2025-01-09 02:53:24,397 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 143 statements. [2025-01-09 02:53:24,397 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 02:53:24,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:24,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 1366 trivial. 0 not checked. [2025-01-09 02:53:24,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:53:24,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040985354] [2025-01-09 02:53:24,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040985354] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:53:24,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675977629] [2025-01-09 02:53:24,495 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 02:53:24,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:53:24,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:53:24,501 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-01-09 02:53:24,508 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-01-09 02:53:24,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 143 statements into 23 equivalence classes. [2025-01-09 02:53:24,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 143 statements. [2025-01-09 02:53:24,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 02:53:24,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:24,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 02:53:24,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:53:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 1366 trivial. 0 not checked. [2025-01-09 02:53:24,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:53:24,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 1366 trivial. 0 not checked. [2025-01-09 02:53:24,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675977629] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:53:24,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:53:24,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 12 [2025-01-09 02:53:24,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335566945] [2025-01-09 02:53:24,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:53:24,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 02:53:24,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:53:24,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 02:53:24,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-01-09 02:53:24,808 INFO L87 Difference]: Start difference. First operand 514 states and 714 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:24,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:53:24,965 INFO L93 Difference]: Finished difference Result 1982 states and 2798 transitions. [2025-01-09 02:53:24,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 02:53:24,965 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2025-01-09 02:53:24,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:53:24,971 INFO L225 Difference]: With dead ends: 1982 [2025-01-09 02:53:24,971 INFO L226 Difference]: Without dead ends: 1979 [2025-01-09 02:53:24,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-01-09 02:53:24,972 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 215 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:53:24,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 405 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:53:24,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2025-01-09 02:53:25,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 568. [2025-01-09 02:53:25,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 567 states have (on average 1.402116402116402) internal successors, (795), 567 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:25,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 795 transitions. [2025-01-09 02:53:25,013 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 795 transitions. Word has length 143 [2025-01-09 02:53:25,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:53:25,014 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 795 transitions. [2025-01-09 02:53:25,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:25,014 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 795 transitions. [2025-01-09 02:53:25,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 02:53:25,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:53:25,016 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-01-09 02:53:25,024 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-01-09 02:53:25,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-01-09 02:53:25,217 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:53:25,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:53:25,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1517051200, now seen corresponding path program 4 times [2025-01-09 02:53:25,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:53:25,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264972213] [2025-01-09 02:53:25,218 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 02:53:25,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:53:25,237 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 158 statements into 2 equivalence classes. [2025-01-09 02:53:25,255 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 02:53:25,255 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 02:53:25,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:25,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1548 backedges. 148 proven. 34 refuted. 0 times theorem prover too weak. 1366 trivial. 0 not checked. [2025-01-09 02:53:25,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:53:25,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264972213] [2025-01-09 02:53:25,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264972213] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:53:25,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392903370] [2025-01-09 02:53:25,707 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 02:53:25,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:53:25,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:53:25,709 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-01-09 02:53:25,710 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-01-09 02:53:25,791 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 158 statements into 2 equivalence classes. [2025-01-09 02:53:25,859 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 02:53:25,859 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 02:53:25,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:25,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 02:53:25,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:53:26,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1548 backedges. 0 proven. 1261 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2025-01-09 02:53:26,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:53:27,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1548 backedges. 0 proven. 1261 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2025-01-09 02:53:27,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392903370] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:53:27,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:53:27,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 25, 25] total 54 [2025-01-09 02:53:27,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228714918] [2025-01-09 02:53:27,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:53:27,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-01-09 02:53:27,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:53:27,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-01-09 02:53:27,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1140, Invalid=1722, Unknown=0, NotChecked=0, Total=2862 [2025-01-09 02:53:27,193 INFO L87 Difference]: Start difference. First operand 568 states and 795 transitions. Second operand has 54 states, 54 states have (on average 5.0) internal successors, (270), 54 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:37,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:53:37,142 INFO L93 Difference]: Finished difference Result 6659 states and 9443 transitions. [2025-01-09 02:53:37,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 284 states. [2025-01-09 02:53:37,142 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.0) internal successors, (270), 54 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2025-01-09 02:53:37,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:53:37,160 INFO L225 Difference]: With dead ends: 6659 [2025-01-09 02:53:37,160 INFO L226 Difference]: Without dead ends: 6115 [2025-01-09 02:53:37,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 782 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27490 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=12410, Invalid=67962, Unknown=0, NotChecked=0, Total=80372 [2025-01-09 02:53:37,181 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 30011 mSDsluCounter, 5517 mSDsCounter, 0 mSdLazyCounter, 2400 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30011 SdHoareTripleChecker+Valid, 5634 SdHoareTripleChecker+Invalid, 2602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 2400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 02:53:37,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30011 Valid, 5634 Invalid, 2602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 2400 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 02:53:37,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6115 states. [2025-01-09 02:53:37,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6115 to 1138. [2025-01-09 02:53:37,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 1137 states have (on average 1.3984168865435356) internal successors, (1590), 1137 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:37,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1590 transitions. [2025-01-09 02:53:37,375 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1590 transitions. Word has length 158 [2025-01-09 02:53:37,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:53:37,375 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1590 transitions. [2025-01-09 02:53:37,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.0) internal successors, (270), 54 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:37,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1590 transitions. [2025-01-09 02:53:37,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-01-09 02:53:37,378 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:53:37,379 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 46, 46, 46, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2025-01-09 02:53:37,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 02:53:37,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:53:37,580 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:53:37,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:53:37,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1484259378, now seen corresponding path program 5 times [2025-01-09 02:53:37,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:53:37,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418479080] [2025-01-09 02:53:37,581 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 02:53:37,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:53:37,610 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 307 statements into 47 equivalence classes. [2025-01-09 02:53:37,956 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 02:53:37,956 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-09 02:53:37,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:40,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6582 backedges. 0 proven. 5446 refuted. 0 times theorem prover too weak. 1136 trivial. 0 not checked. [2025-01-09 02:53:40,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:53:40,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418479080] [2025-01-09 02:53:40,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418479080] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:53:40,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813088446] [2025-01-09 02:53:40,408 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 02:53:40,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:53:40,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:53:40,410 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:53:40,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 02:53:40,522 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 307 statements into 47 equivalence classes. [2025-01-09 02:54:27,385 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 02:54:27,385 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-09 02:54:27,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:54:27,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 1215 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-09 02:54:27,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:54:27,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6582 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 5501 trivial. 0 not checked. [2025-01-09 02:54:27,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:54:29,620 INFO L134 CoverageAnalysis]: Checked inductivity of 6582 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 5501 trivial. 0 not checked. [2025-01-09 02:54:29,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813088446] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:54:29,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:54:29,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 96 [2025-01-09 02:54:29,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296860565] [2025-01-09 02:54:29,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:54:29,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-01-09 02:54:29,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:54:29,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-01-09 02:54:29,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-01-09 02:54:29,623 INFO L87 Difference]: Start difference. First operand 1138 states and 1590 transitions. Second operand has 96 states, 96 states have (on average 3.6354166666666665) internal successors, (349), 96 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:54:36,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:54:36,016 INFO L93 Difference]: Finished difference Result 6933 states and 10140 transitions. [2025-01-09 02:54:36,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-09 02:54:36,016 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 3.6354166666666665) internal successors, (349), 96 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 307 [2025-01-09 02:54:36,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:54:36,034 INFO L225 Difference]: With dead ends: 6933 [2025-01-09 02:54:36,034 INFO L226 Difference]: Without dead ends: 5844 [2025-01-09 02:54:36,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 661 GetRequests, 567 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-01-09 02:54:36,038 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 10929 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10929 SdHoareTripleChecker+Valid, 2377 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 02:54:36,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10929 Valid, 2377 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 02:54:36,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5844 states. [2025-01-09 02:54:36,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5844 to 2242. [2025-01-09 02:54:36,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2242 states, 2241 states have (on average 1.394912985274431) internal successors, (3126), 2241 states have internal predecessors, (3126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:54:36,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 3126 transitions. [2025-01-09 02:54:36,200 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 3126 transitions. Word has length 307 [2025-01-09 02:54:36,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:54:36,201 INFO L471 AbstractCegarLoop]: Abstraction has 2242 states and 3126 transitions. [2025-01-09 02:54:36,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 3.6354166666666665) internal successors, (349), 96 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:54:36,201 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 3126 transitions. [2025-01-09 02:54:36,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2025-01-09 02:54:36,211 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:54:36,211 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 94, 94, 94, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2025-01-09 02:54:36,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 02:54:36,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-09 02:54:36,412 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:54:36,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:54:36,413 INFO L85 PathProgramCache]: Analyzing trace with hash 700524238, now seen corresponding path program 6 times [2025-01-09 02:54:36,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:54:36,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127723497] [2025-01-09 02:54:36,413 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 02:54:36,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:54:36,470 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 595 statements into 95 equivalence classes. [2025-01-09 02:54:36,525 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 103 of 595 statements. [2025-01-09 02:54:36,525 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-01-09 02:54:36,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:54:36,719 INFO L134 CoverageAnalysis]: Checked inductivity of 26934 backedges. 745 proven. 55 refuted. 0 times theorem prover too weak. 26134 trivial. 0 not checked. [2025-01-09 02:54:36,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:54:36,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127723497] [2025-01-09 02:54:36,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127723497] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:54:36,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743862599] [2025-01-09 02:54:36,719 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 02:54:36,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:54:36,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:54:36,721 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:54:36,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 02:54:36,911 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 595 statements into 95 equivalence classes. [2025-01-09 02:54:37,067 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 103 of 595 statements. [2025-01-09 02:54:37,067 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-01-09 02:54:37,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:54:37,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 02:54:37,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:54:37,234 INFO L134 CoverageAnalysis]: Checked inductivity of 26934 backedges. 745 proven. 55 refuted. 0 times theorem prover too weak. 26134 trivial. 0 not checked. [2025-01-09 02:54:37,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:54:37,578 INFO L134 CoverageAnalysis]: Checked inductivity of 26934 backedges. 745 proven. 55 refuted. 0 times theorem prover too weak. 26134 trivial. 0 not checked. [2025-01-09 02:54:37,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743862599] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:54:37,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:54:37,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24 [2025-01-09 02:54:37,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442345903] [2025-01-09 02:54:37,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:54:37,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 02:54:37,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:54:37,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 02:54:37,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2025-01-09 02:54:37,581 INFO L87 Difference]: Start difference. First operand 2242 states and 3126 transitions. Second operand has 24 states, 24 states have (on average 4.125) internal successors, (99), 24 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:54:38,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:54:38,578 INFO L93 Difference]: Finished difference Result 23486 states and 33734 transitions. [2025-01-09 02:54:38,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 02:54:38,578 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.125) internal successors, (99), 24 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 595 [2025-01-09 02:54:38,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:54:38,634 INFO L225 Difference]: With dead ends: 23486 [2025-01-09 02:54:38,634 INFO L226 Difference]: Without dead ends: 23483 [2025-01-09 02:54:38,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1205 GetRequests, 1176 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=695, Unknown=0, NotChecked=0, Total=930 [2025-01-09 02:54:38,641 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 941 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:54:38,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 1865 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:54:38,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23483 states. [2025-01-09 02:54:38,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23483 to 2368. [2025-01-09 02:54:38,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2368 states, 2367 states have (on average 1.4005069708491762) internal successors, (3315), 2367 states have internal predecessors, (3315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:54:38,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 3315 transitions. [2025-01-09 02:54:38,947 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 3315 transitions. Word has length 595 [2025-01-09 02:54:38,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:54:38,948 INFO L471 AbstractCegarLoop]: Abstraction has 2368 states and 3315 transitions. [2025-01-09 02:54:38,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.125) internal successors, (99), 24 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:54:38,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3315 transitions. [2025-01-09 02:54:38,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2025-01-09 02:54:38,960 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:54:38,960 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 94, 94, 94, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2025-01-09 02:54:38,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 02:54:39,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:54:39,161 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:54:39,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:54:39,165 INFO L85 PathProgramCache]: Analyzing trace with hash 990057920, now seen corresponding path program 7 times [2025-01-09 02:54:39,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:54:39,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248417030] [2025-01-09 02:54:39,165 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 02:54:39,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:54:39,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 630 statements into 1 equivalence classes. [2025-01-09 02:54:39,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 630 of 630 statements. [2025-01-09 02:54:39,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:54:39,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:54:46,351 INFO L134 CoverageAnalysis]: Checked inductivity of 27872 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 23407 trivial. 0 not checked. [2025-01-09 02:54:46,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:54:46,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248417030] [2025-01-09 02:54:46,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248417030] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:54:46,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146493575] [2025-01-09 02:54:46,352 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 02:54:46,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:54:46,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:54:46,354 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:54:46,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 02:54:46,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 630 statements into 1 equivalence classes. [2025-01-09 02:54:46,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 630 of 630 statements. [2025-01-09 02:54:46,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:54:46,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:54:46,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 2460 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-01-09 02:54:46,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:54:46,953 INFO L134 CoverageAnalysis]: Checked inductivity of 27872 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 23407 trivial. 0 not checked. [2025-01-09 02:54:46,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:54:55,299 INFO L134 CoverageAnalysis]: Checked inductivity of 27872 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 23407 trivial. 0 not checked. [2025-01-09 02:54:55,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146493575] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:54:55,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:54:55,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2025-01-09 02:54:55,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243463282] [2025-01-09 02:54:55,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:54:55,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 193 states [2025-01-09 02:54:55,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:54:55,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2025-01-09 02:54:55,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2025-01-09 02:54:55,308 INFO L87 Difference]: Start difference. First operand 2368 states and 3315 transitions. Second operand has 193 states, 193 states have (on average 1.077720207253886) internal successors, (208), 193 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)