./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_fib-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/seq-pthread/cs_fib-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f188ac4b0bdfe335e0fcb7c5645493965a99a7b8a1d7a552e9d512c30775fb8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:25:04,480 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:25:04,554 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:25:04,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:25:04,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:25:04,586 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:25:04,588 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:25:04,589 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:25:04,589 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:25:04,589 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:25:04,590 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:25:04,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:25:04,591 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:25:04,591 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:25:04,591 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:25:04,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:25:04,592 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:25:04,592 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:25:04,592 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:25:04,592 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:25:04,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:25:04,593 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:25:04,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:25:04,593 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:25:04,593 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:25:04,593 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:25:04,593 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:25:04,593 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:25:04,594 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:25:04,594 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:25:04,594 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:25:04,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:25:04,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:25:04,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:25:04,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:25:04,595 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:25:04,595 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:25:04,595 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:25:04,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:25:04,595 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:25:04,595 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:25:04,595 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:25:04,595 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:25:04,595 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 -> 2f188ac4b0bdfe335e0fcb7c5645493965a99a7b8a1d7a552e9d512c30775fb8 [2025-02-07 21:25:04,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:25:04,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:25:04,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:25:04,923 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:25:04,924 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:25:04,925 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_fib-2.i [2025-02-07 21:25:06,165 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f15b46e04/a86498a4c1234aeba9a085433188451e/FLAG1c6ad4ecd [2025-02-07 21:25:06,555 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:25:06,555 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_fib-2.i [2025-02-07 21:25:06,575 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f15b46e04/a86498a4c1234aeba9a085433188451e/FLAG1c6ad4ecd [2025-02-07 21:25:06,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f15b46e04/a86498a4c1234aeba9a085433188451e [2025-02-07 21:25:06,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:25:06,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:25:06,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:25:06,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:25:06,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:25:06,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:25:06" (1/1) ... [2025-02-07 21:25:06,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72645251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:06, skipping insertion in model container [2025-02-07 21:25:06,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:25:06" (1/1) ... [2025-02-07 21:25:06,797 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:25:07,116 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/seq-pthread/cs_fib-2.i[23457,23470] [2025-02-07 21:25:07,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:25:07,266 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:25:07,295 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/seq-pthread/cs_fib-2.i[23457,23470] [2025-02-07 21:25:07,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:25:07,401 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:25:07,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:07 WrapperNode [2025-02-07 21:25:07,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:25:07,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:25:07,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:25:07,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:25:07,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:07" (1/1) ... [2025-02-07 21:25:07,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:07" (1/1) ... [2025-02-07 21:25:07,469 INFO L138 Inliner]: procedures = 145, calls = 401, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 706 [2025-02-07 21:25:07,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:25:07,470 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:25:07,470 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:25:07,470 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:25:07,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:07" (1/1) ... [2025-02-07 21:25:07,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:07" (1/1) ... [2025-02-07 21:25:07,492 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:07" (1/1) ... [2025-02-07 21:25:07,542 INFO L175 MemorySlicer]: Split 267 memory accesses to 15 slices as follows [2, 0, 2, 8, 31, 8, 8, 53, 48, 22, 22, 10, 11, 31, 11]. 20 percent of accesses are in the largest equivalence class. The 65 initializations are split as follows [2, 0, 0, 3, 0, 3, 3, 18, 18, 6, 6, 6, 0, 0, 0]. The 63 writes are split as follows [0, 0, 2, 2, 1, 2, 2, 20, 15, 7, 7, 2, 1, 1, 1]. [2025-02-07 21:25:07,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:07" (1/1) ... [2025-02-07 21:25:07,546 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:07" (1/1) ... [2025-02-07 21:25:07,586 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:07" (1/1) ... [2025-02-07 21:25:07,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:07" (1/1) ... [2025-02-07 21:25:07,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:07" (1/1) ... [2025-02-07 21:25:07,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:07" (1/1) ... [2025-02-07 21:25:07,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:25:07,629 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:25:07,630 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:25:07,630 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:25:07,631 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:07" (1/1) ... [2025-02-07 21:25:07,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:25:07,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:07,666 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 21:25:07,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 21:25:07,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 21:25:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 21:25:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 21:25:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-07 21:25:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-07 21:25:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-07 21:25:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-07 21:25:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-07 21:25:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-07 21:25:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-07 21:25:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-07 21:25:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-07 21:25:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-07 21:25:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-07 21:25:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-07 21:25:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-07 21:25:07,692 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-07 21:25:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 21:25:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 21:25:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 21:25:07,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-07 21:25:07,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-07 21:25:07,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-07 21:25:07,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-07 21:25:07,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-07 21:25:07,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-07 21:25:07,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-07 21:25:07,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-07 21:25:07,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-07 21:25:07,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-07 21:25:07,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-07 21:25:07,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-07 21:25:07,694 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-07 21:25:07,695 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-07 21:25:07,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:25:07,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 21:25:07,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 21:25:07,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 21:25:07,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-07 21:25:07,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-07 21:25:07,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-07 21:25:07,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-07 21:25:07,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-07 21:25:07,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-07 21:25:07,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-07 21:25:07,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-07 21:25:07,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-07 21:25:07,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-07 21:25:07,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-07 21:25:07,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-07 21:25:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-07 21:25:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-02-07 21:25:07,697 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-02-07 21:25:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 21:25:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 21:25:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-07 21:25:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-07 21:25:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-07 21:25:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-07 21:25:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-07 21:25:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-07 21:25:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-07 21:25:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-07 21:25:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-07 21:25:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-07 21:25:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-07 21:25:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-07 21:25:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-07 21:25:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-07 21:25:07,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-07 21:25:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 21:25:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-07 21:25:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-07 21:25:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-07 21:25:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-07 21:25:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-07 21:25:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-07 21:25:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-07 21:25:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-07 21:25:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-07 21:25:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-07 21:25:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-07 21:25:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-07 21:25:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-07 21:25:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-07 21:25:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-07 21:25:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-02-07 21:25:07,699 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-02-07 21:25:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:25:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 21:25:07,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 21:25:07,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-07 21:25:07,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-07 21:25:07,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-07 21:25:07,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-07 21:25:07,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-07 21:25:07,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-07 21:25:07,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-07 21:25:07,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-07 21:25:07,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-07 21:25:07,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-07 21:25:07,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-07 21:25:07,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-07 21:25:07,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:25:07,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:25:07,979 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:25:07,982 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:25:08,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L747-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-07 21:25:08,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L747-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:08,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L747-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:08,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-07 21:25:08,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:08,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:08,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-07 21:25:08,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));~__CS_error~0 := 1;~__CS_ret~0 := ~__CS_ret_ERROR~0;~__CS_error_detail~0 := ~__ERR_ERROR_LABEL_REACHED~0;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-07 21:25:08,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:12,879 INFO L? ?]: Removed 97 outVars from TransFormulas that were not future-live. [2025-02-07 21:25:12,880 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:25:12,898 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:25:12,898 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:25:12,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:25:12 BoogieIcfgContainer [2025-02-07 21:25:12,899 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:25:12,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:25:12,901 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:25:12,905 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:25:12,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:25:06" (1/3) ... [2025-02-07 21:25:12,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573cee6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:25:12, skipping insertion in model container [2025-02-07 21:25:12,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:07" (2/3) ... [2025-02-07 21:25:12,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573cee6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:25:12, skipping insertion in model container [2025-02-07 21:25:12,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:25:12" (3/3) ... [2025-02-07 21:25:12,908 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_fib-2.i [2025-02-07 21:25:12,923 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:25:12,925 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_fib-2.i that has 6 procedures, 175 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-07 21:25:12,979 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:25:12,987 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;@5fbcc145, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:25:12,987 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 21:25:12,992 INFO L276 IsEmpty]: Start isEmpty. Operand has 175 states, 98 states have (on average 1.336734693877551) internal successors, (131), 103 states have internal predecessors, (131), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-07 21:25:13,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-07 21:25:13,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:13,040 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:13,040 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:13,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:13,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1820020274, now seen corresponding path program 1 times [2025-02-07 21:25:13,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:13,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490916223] [2025-02-07 21:25:13,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:13,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:13,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-07 21:25:13,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-07 21:25:13,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:13,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:14,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-02-07 21:25:14,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:14,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490916223] [2025-02-07 21:25:14,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490916223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:14,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:14,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:25:14,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477015066] [2025-02-07 21:25:14,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:14,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:25:14,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:14,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:25:14,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:14,186 INFO L87 Difference]: Start difference. First operand has 175 states, 98 states have (on average 1.336734693877551) internal successors, (131), 103 states have internal predecessors, (131), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-07 21:25:18,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:18,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:18,292 INFO L93 Difference]: Finished difference Result 349 states and 589 transitions. [2025-02-07 21:25:18,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:25:18,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 252 [2025-02-07 21:25:18,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:18,300 INFO L225 Difference]: With dead ends: 349 [2025-02-07 21:25:18,300 INFO L226 Difference]: Without dead ends: 168 [2025-02-07 21:25:18,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:18,308 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 2 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:18,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 513 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-07 21:25:18,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-02-07 21:25:18,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2025-02-07 21:25:18,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 96 states have (on average 1.1770833333333333) internal successors, (113), 97 states have internal predecessors, (113), 65 states have call successors, (65), 5 states have call predecessors, (65), 5 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-07 21:25:18,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 242 transitions. [2025-02-07 21:25:18,377 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 242 transitions. Word has length 252 [2025-02-07 21:25:18,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:18,377 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 242 transitions. [2025-02-07 21:25:18,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-07 21:25:18,377 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 242 transitions. [2025-02-07 21:25:18,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-02-07 21:25:18,389 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:18,390 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:18,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:25:18,390 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:18,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:18,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1826602248, now seen corresponding path program 1 times [2025-02-07 21:25:18,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:18,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590579131] [2025-02-07 21:25:18,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:18,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:18,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-02-07 21:25:18,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-02-07 21:25:18,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:18,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3121 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-02-07 21:25:18,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:18,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590579131] [2025-02-07 21:25:18,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590579131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:18,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:18,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:25:18,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963613995] [2025-02-07 21:25:18,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:19,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:25:19,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:19,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:25:19,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:19,004 INFO L87 Difference]: Start difference. First operand 167 states and 242 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-07 21:25:19,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:19,064 INFO L93 Difference]: Finished difference Result 333 states and 484 transitions. [2025-02-07 21:25:19,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:25:19,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 254 [2025-02-07 21:25:19,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:19,069 INFO L225 Difference]: With dead ends: 333 [2025-02-07 21:25:19,070 INFO L226 Difference]: Without dead ends: 168 [2025-02-07 21:25:19,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:19,072 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 0 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:19,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 477 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:19,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-02-07 21:25:19,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2025-02-07 21:25:19,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 97 states have (on average 1.175257731958763) internal successors, (114), 98 states have internal predecessors, (114), 65 states have call successors, (65), 5 states have call predecessors, (65), 5 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-07 21:25:19,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 243 transitions. [2025-02-07 21:25:19,101 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 243 transitions. Word has length 254 [2025-02-07 21:25:19,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:19,102 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 243 transitions. [2025-02-07 21:25:19,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-07 21:25:19,103 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 243 transitions. [2025-02-07 21:25:19,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-02-07 21:25:19,108 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:19,108 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:19,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:25:19,108 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:19,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:19,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1279898104, now seen corresponding path program 1 times [2025-02-07 21:25:19,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:19,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424572332] [2025-02-07 21:25:19,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:19,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:19,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-02-07 21:25:19,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-02-07 21:25:19,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:19,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:19,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3122 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-02-07 21:25:19,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:19,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424572332] [2025-02-07 21:25:19,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424572332] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:19,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190864511] [2025-02-07 21:25:19,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:19,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:19,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:19,676 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:25:19,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 21:25:20,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-02-07 21:25:20,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-02-07 21:25:20,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:20,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:20,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 1432 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 21:25:20,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:20,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3122 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-02-07 21:25:20,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:20,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3122 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-02-07 21:25:20,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190864511] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:25:20,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:25:20,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-07 21:25:20,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510764748] [2025-02-07 21:25:20,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:20,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:25:20,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:20,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:25:20,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:25:20,796 INFO L87 Difference]: Start difference. First operand 168 states and 243 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (81), 2 states have call predecessors, (81), 2 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-07 21:25:20,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:20,881 INFO L93 Difference]: Finished difference Result 336 states and 488 transitions. [2025-02-07 21:25:20,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:25:20,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (81), 2 states have call predecessors, (81), 2 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 255 [2025-02-07 21:25:20,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:20,885 INFO L225 Difference]: With dead ends: 336 [2025-02-07 21:25:20,885 INFO L226 Difference]: Without dead ends: 170 [2025-02-07 21:25:20,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 507 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:25:20,889 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 0 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:20,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 714 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:20,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-02-07 21:25:20,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-02-07 21:25:20,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 99 states have (on average 1.1717171717171717) internal successors, (116), 100 states have internal predecessors, (116), 65 states have call successors, (65), 5 states have call predecessors, (65), 5 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-07 21:25:20,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 245 transitions. [2025-02-07 21:25:20,916 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 245 transitions. Word has length 255 [2025-02-07 21:25:20,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:20,916 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 245 transitions. [2025-02-07 21:25:20,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (81), 2 states have call predecessors, (81), 2 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-07 21:25:20,916 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 245 transitions. [2025-02-07 21:25:20,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-02-07 21:25:20,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:20,922 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:20,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 21:25:21,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:21,126 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:21,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:21,127 INFO L85 PathProgramCache]: Analyzing trace with hash 115266552, now seen corresponding path program 2 times [2025-02-07 21:25:21,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:21,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064636595] [2025-02-07 21:25:21,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:25:21,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:21,394 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 257 statements into 2 equivalence classes. [2025-02-07 21:25:21,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 257 statements. [2025-02-07 21:25:21,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-07 21:25:21,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:21,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3127 trivial. 0 not checked. [2025-02-07 21:25:21,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:21,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064636595] [2025-02-07 21:25:21,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064636595] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:21,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:21,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:25:21,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567324578] [2025-02-07 21:25:21,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:21,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:25:21,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:21,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:25:21,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:21,806 INFO L87 Difference]: Start difference. First operand 170 states and 245 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-07 21:25:21,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:21,941 INFO L93 Difference]: Finished difference Result 176 states and 250 transitions. [2025-02-07 21:25:21,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:25:21,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 257 [2025-02-07 21:25:21,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:21,944 INFO L225 Difference]: With dead ends: 176 [2025-02-07 21:25:21,944 INFO L226 Difference]: Without dead ends: 174 [2025-02-07 21:25:21,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 21:25:21,945 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 155 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:21,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 686 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:25:21,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-02-07 21:25:21,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2025-02-07 21:25:21,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 102 states have (on average 1.1666666666666667) internal successors, (119), 103 states have internal predecessors, (119), 65 states have call successors, (65), 6 states have call predecessors, (65), 6 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-07 21:25:21,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 248 transitions. [2025-02-07 21:25:21,980 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 248 transitions. Word has length 257 [2025-02-07 21:25:21,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:21,982 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 248 transitions. [2025-02-07 21:25:21,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-07 21:25:21,982 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 248 transitions. [2025-02-07 21:25:21,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-02-07 21:25:21,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:21,987 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:21,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:25:21,988 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:21,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:21,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1782374709, now seen corresponding path program 1 times [2025-02-07 21:25:21,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:21,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9242953] [2025-02-07 21:25:21,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:21,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:22,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-07 21:25:22,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-07 21:25:22,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:22,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:22,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3129 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3126 trivial. 0 not checked. [2025-02-07 21:25:22,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:22,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9242953] [2025-02-07 21:25:22,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9242953] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:22,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440454643] [2025-02-07 21:25:22,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:22,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:22,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:22,479 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:25:22,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 21:25:22,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-07 21:25:23,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-07 21:25:23,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:23,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:23,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 1495 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 21:25:23,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3129 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3128 trivial. 0 not checked. [2025-02-07 21:25:23,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3129 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3126 trivial. 0 not checked. [2025-02-07 21:25:23,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440454643] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:25:23,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:25:23,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-07 21:25:23,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212816212] [2025-02-07 21:25:23,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:23,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 21:25:23,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:23,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 21:25:23,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-07 21:25:23,660 INFO L87 Difference]: Start difference. First operand 174 states and 248 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (83), 2 states have call predecessors, (83), 2 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-07 21:25:27,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:31,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:35,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:39,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:43,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:43,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:43,862 INFO L93 Difference]: Finished difference Result 356 states and 508 transitions. [2025-02-07 21:25:43,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:25:43,904 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (83), 2 states have call predecessors, (83), 2 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 262 [2025-02-07 21:25:43,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:43,908 INFO L225 Difference]: With dead ends: 356 [2025-02-07 21:25:43,908 INFO L226 Difference]: Without dead ends: 189 [2025-02-07 21:25:43,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 521 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-07 21:25:43,911 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 4 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:43,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 474 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2025-02-07 21:25:43,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-02-07 21:25:43,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2025-02-07 21:25:43,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 117 states have (on average 1.170940170940171) internal successors, (137), 118 states have internal predecessors, (137), 65 states have call successors, (65), 6 states have call predecessors, (65), 6 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-07 21:25:43,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 266 transitions. [2025-02-07 21:25:43,940 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 266 transitions. Word has length 262 [2025-02-07 21:25:43,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:43,941 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 266 transitions. [2025-02-07 21:25:43,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (83), 2 states have call predecessors, (83), 2 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-07 21:25:43,941 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 266 transitions. [2025-02-07 21:25:43,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-02-07 21:25:43,945 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:43,946 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 12, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:43,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 21:25:44,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:44,148 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:44,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:44,148 INFO L85 PathProgramCache]: Analyzing trace with hash 134994781, now seen corresponding path program 2 times [2025-02-07 21:25:44,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:44,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722418441] [2025-02-07 21:25:44,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:25:44,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:44,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 277 statements into 2 equivalence classes. [2025-02-07 21:25:44,422 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 277 statements. [2025-02-07 21:25:44,422 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-07 21:25:44,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:44,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3252 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3250 trivial. 0 not checked. [2025-02-07 21:25:44,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:44,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722418441] [2025-02-07 21:25:44,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722418441] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:44,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:44,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:25:44,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736697094] [2025-02-07 21:25:44,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:44,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:25:44,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:44,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:25:44,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:44,781 INFO L87 Difference]: Start difference. First operand 189 states and 266 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-02-07 21:25:44,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:44,818 INFO L93 Difference]: Finished difference Result 352 states and 498 transitions. [2025-02-07 21:25:44,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:25:44,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 277 [2025-02-07 21:25:44,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:44,823 INFO L225 Difference]: With dead ends: 352 [2025-02-07 21:25:44,823 INFO L226 Difference]: Without dead ends: 189 [2025-02-07 21:25:44,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:44,824 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 0 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:44,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 476 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:44,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-02-07 21:25:44,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2025-02-07 21:25:44,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 117 states have (on average 1.1623931623931625) internal successors, (136), 118 states have internal predecessors, (136), 65 states have call successors, (65), 6 states have call predecessors, (65), 6 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-07 21:25:44,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 265 transitions. [2025-02-07 21:25:44,846 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 265 transitions. Word has length 277 [2025-02-07 21:25:44,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:44,847 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 265 transitions. [2025-02-07 21:25:44,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-02-07 21:25:44,848 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 265 transitions. [2025-02-07 21:25:44,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-02-07 21:25:44,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:44,853 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 12, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:44,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 21:25:44,853 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:44,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:44,854 INFO L85 PathProgramCache]: Analyzing trace with hash 951772646, now seen corresponding path program 1 times [2025-02-07 21:25:44,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:44,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396710160] [2025-02-07 21:25:44,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:44,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:45,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-02-07 21:25:45,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-02-07 21:25:45,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:45,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:46,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3759 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3757 trivial. 0 not checked. [2025-02-07 21:25:46,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:46,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396710160] [2025-02-07 21:25:46,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396710160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:46,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:46,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:25:46,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368204942] [2025-02-07 21:25:46,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:46,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:25:46,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:46,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:25:46,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:46,133 INFO L87 Difference]: Start difference. First operand 189 states and 265 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) [2025-02-07 21:25:46,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:46,448 INFO L93 Difference]: Finished difference Result 525 states and 749 transitions. [2025-02-07 21:25:46,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 21:25:46,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) Word has length 320 [2025-02-07 21:25:46,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:46,455 INFO L225 Difference]: With dead ends: 525 [2025-02-07 21:25:46,455 INFO L226 Difference]: Without dead ends: 360 [2025-02-07 21:25:46,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 21:25:46,457 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 239 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:46,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 1425 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:25:46,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-02-07 21:25:46,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 192. [2025-02-07 21:25:46,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 119 states have (on average 1.1596638655462186) internal successors, (138), 121 states have internal predecessors, (138), 65 states have call successors, (65), 6 states have call predecessors, (65), 7 states have return successors, (66), 64 states have call predecessors, (66), 64 states have call successors, (66) [2025-02-07 21:25:46,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 269 transitions. [2025-02-07 21:25:46,493 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 269 transitions. Word has length 320 [2025-02-07 21:25:46,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:46,493 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 269 transitions. [2025-02-07 21:25:46,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) [2025-02-07 21:25:46,496 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 269 transitions. [2025-02-07 21:25:46,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-02-07 21:25:46,500 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:46,500 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 12, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:46,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 21:25:46,501 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:46,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:46,502 INFO L85 PathProgramCache]: Analyzing trace with hash 756417610, now seen corresponding path program 1 times [2025-02-07 21:25:46,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:46,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783192796] [2025-02-07 21:25:46,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:46,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:46,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-02-07 21:25:46,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-02-07 21:25:46,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:46,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:47,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3759 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3757 trivial. 0 not checked. [2025-02-07 21:25:47,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:47,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783192796] [2025-02-07 21:25:47,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783192796] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:47,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:47,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:25:47,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463891688] [2025-02-07 21:25:47,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:47,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:25:47,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:47,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:25:47,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:47,804 INFO L87 Difference]: Start difference. First operand 192 states and 269 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) [2025-02-07 21:25:51,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:55,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:56,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:56,369 INFO L93 Difference]: Finished difference Result 534 states and 761 transitions. [2025-02-07 21:25:56,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 21:25:56,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) Word has length 320 [2025-02-07 21:25:56,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:56,375 INFO L225 Difference]: With dead ends: 534 [2025-02-07 21:25:56,375 INFO L226 Difference]: Without dead ends: 366 [2025-02-07 21:25:56,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 21:25:56,377 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 257 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 17 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:56,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 1245 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 208 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2025-02-07 21:25:56,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-02-07 21:25:56,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 192. [2025-02-07 21:25:56,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 119 states have (on average 1.1596638655462186) internal successors, (138), 121 states have internal predecessors, (138), 65 states have call successors, (65), 6 states have call predecessors, (65), 7 states have return successors, (66), 64 states have call predecessors, (66), 64 states have call successors, (66) [2025-02-07 21:25:56,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 269 transitions. [2025-02-07 21:25:56,424 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 269 transitions. Word has length 320 [2025-02-07 21:25:56,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:56,425 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 269 transitions. [2025-02-07 21:25:56,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) [2025-02-07 21:25:56,425 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 269 transitions. [2025-02-07 21:25:56,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-02-07 21:25:56,430 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:56,430 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 12, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:56,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 21:25:56,430 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:56,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:56,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1131184138, now seen corresponding path program 1 times [2025-02-07 21:25:56,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:56,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762212853] [2025-02-07 21:25:56,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:56,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:56,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-02-07 21:25:56,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-02-07 21:25:56,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:56,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:57,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3950 backedges. 2 proven. 106 refuted. 0 times theorem prover too weak. 3842 trivial. 0 not checked. [2025-02-07 21:25:57,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:57,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762212853] [2025-02-07 21:25:57,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762212853] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:57,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561099160] [2025-02-07 21:25:57,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:57,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:57,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:57,203 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:25:57,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 21:25:57,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-02-07 21:25:58,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-02-07 21:25:58,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:58,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:58,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 2298 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 21:25:58,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:58,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3950 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 3844 trivial. 0 not checked. [2025-02-07 21:25:58,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:58,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3950 backedges. 2 proven. 106 refuted. 0 times theorem prover too weak. 3842 trivial. 0 not checked. [2025-02-07 21:25:58,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561099160] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:25:58,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:25:58,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 9 [2025-02-07 21:25:58,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772494693] [2025-02-07 21:25:58,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:58,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 21:25:58,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:58,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 21:25:58,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:25:58,645 INFO L87 Difference]: Start difference. First operand 192 states and 269 transitions. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 2 states have call successors, (99), 2 states have call predecessors, (99), 2 states have return successors, (98), 2 states have call predecessors, (98), 2 states have call successors, (98) [2025-02-07 21:26:02,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:26:06,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:26:10,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:26:14,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:26:18,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:26:22,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:26:26,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:26:26,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:26:26,880 INFO L93 Difference]: Finished difference Result 372 states and 525 transitions. [2025-02-07 21:26:26,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 21:26:26,904 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 2 states have call successors, (99), 2 states have call predecessors, (99), 2 states have return successors, (98), 2 states have call predecessors, (98), 2 states have call successors, (98) Word has length 343 [2025-02-07 21:26:26,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:26:26,906 INFO L225 Difference]: With dead ends: 372 [2025-02-07 21:26:26,908 INFO L226 Difference]: Without dead ends: 202 [2025-02-07 21:26:26,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 680 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:26:26,911 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 2 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:26:26,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1177 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 7 Unknown, 0 Unchecked, 28.2s Time] [2025-02-07 21:26:26,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-07 21:26:26,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-02-07 21:26:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 129 states have (on average 1.1627906976744187) internal successors, (150), 131 states have internal predecessors, (150), 65 states have call successors, (65), 6 states have call predecessors, (65), 7 states have return successors, (66), 64 states have call predecessors, (66), 64 states have call successors, (66) [2025-02-07 21:26:26,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 281 transitions. [2025-02-07 21:26:26,939 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 281 transitions. Word has length 343 [2025-02-07 21:26:26,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:26:26,939 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 281 transitions. [2025-02-07 21:26:26,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 2 states have call successors, (99), 2 states have call predecessors, (99), 2 states have return successors, (98), 2 states have call predecessors, (98), 2 states have call successors, (98) [2025-02-07 21:26:26,939 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 281 transitions. [2025-02-07 21:26:26,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-02-07 21:26:26,945 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:26:26,945 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 18, 6, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:26:26,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-07 21:26:27,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:26:27,146 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:26:27,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:26:27,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1507240758, now seen corresponding path program 2 times [2025-02-07 21:26:27,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:26:27,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723431551] [2025-02-07 21:26:27,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:26:27,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:26:27,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 353 statements into 2 equivalence classes. [2025-02-07 21:26:27,536 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 353 of 353 statements. [2025-02-07 21:26:27,537 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 21:26:27,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:26:28,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4117 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4111 trivial. 0 not checked. [2025-02-07 21:26:28,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:26:28,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723431551] [2025-02-07 21:26:28,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723431551] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:26:28,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157552449] [2025-02-07 21:26:28,146 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:26:28,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:26:28,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:26:28,149 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:26:28,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 21:26:28,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 353 statements into 2 equivalence classes.