./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_stateful-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_stateful-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 c1d6cba599289c2637bd3d8da41e464d318a32e6ae6e6e0e391ff437e6ce1fcc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:02:10,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:02:10,899 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:02:10,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:02:10,904 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:02:10,927 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:02:10,927 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:02:10,927 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:02:10,928 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:02:10,928 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:02:10,928 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:02:10,928 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:02:10,928 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:02:10,928 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:02:10,928 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:02:10,928 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:02:10,928 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:02:10,928 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:02:10,928 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:02:10,928 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:02:10,928 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:02:10,928 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:02:10,929 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:02:10,929 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:02:10,929 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:02:10,929 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:02:10,929 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:02:10,929 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:02:10,929 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:02:10,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:02:10,929 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:02:10,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:02:10,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:02:10,929 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:02:10,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:02:10,929 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:02:10,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:02:10,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:02:10,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:02:10,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:02:10,929 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:02:10,930 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:02:10,930 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:02:10,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:02:10,930 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:02:10,930 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:02:10,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:02:10,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:02:10,930 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 -> c1d6cba599289c2637bd3d8da41e464d318a32e6ae6e6e0e391ff437e6ce1fcc [2025-01-09 05:02:11,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:02:11,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:02:11,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:02:11,179 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:02:11,179 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:02:11,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_stateful-2.i [2025-01-09 05:02:12,412 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/337406d93/277a7fa84b3848478ed2deef6bebde64/FLAGe1451bf48 [2025-01-09 05:02:12,873 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:02:12,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-2.i [2025-01-09 05:02:12,892 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/337406d93/277a7fa84b3848478ed2deef6bebde64/FLAGe1451bf48 [2025-01-09 05:02:13,001 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/337406d93/277a7fa84b3848478ed2deef6bebde64 [2025-01-09 05:02:13,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:02:13,004 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:02:13,005 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:02:13,005 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:02:13,008 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:02:13,009 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:02:13" (1/1) ... [2025-01-09 05:02:13,009 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a51d58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:13, skipping insertion in model container [2025-01-09 05:02:13,010 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:02:13" (1/1) ... [2025-01-09 05:02:13,039 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:02:13,228 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_stateful-2.i[23607,23620] [2025-01-09 05:02:13,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:02:13,319 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:02:13,355 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_stateful-2.i[23607,23620] [2025-01-09 05:02:13,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:02:13,455 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:02:13,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:13 WrapperNode [2025-01-09 05:02:13,458 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:02:13,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:02:13,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:02:13,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:02:13,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:13" (1/1) ... [2025-01-09 05:02:13,494 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:13" (1/1) ... [2025-01-09 05:02:13,536 INFO L138 Inliner]: procedures = 145, calls = 254, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 548 [2025-01-09 05:02:13,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:02:13,541 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:02:13,541 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:02:13,541 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:02:13,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:13" (1/1) ... [2025-01-09 05:02:13,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:13" (1/1) ... [2025-01-09 05:02:13,563 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:13" (1/1) ... [2025-01-09 05:02:13,611 INFO L175 MemorySlicer]: Split 122 memory accesses to 17 slices as follows [2, 7, 8, 8, 3, 8, 20, 12, 0, 6, 10, 3, 3, 7, 10, 3, 12]. 16 percent of accesses are in the largest equivalence class. The 33 initializations are split as follows [2, 0, 3, 3, 0, 3, 6, 6, 0, 2, 2, 0, 0, 0, 2, 0, 4]. The 37 writes are split as follows [0, 1, 2, 2, 1, 2, 8, 3, 0, 2, 4, 1, 1, 1, 4, 1, 4]. [2025-01-09 05:02:13,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:13" (1/1) ... [2025-01-09 05:02:13,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:13" (1/1) ... [2025-01-09 05:02:13,633 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:13" (1/1) ... [2025-01-09 05:02:13,635 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:13" (1/1) ... [2025-01-09 05:02:13,638 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:13" (1/1) ... [2025-01-09 05:02:13,643 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:13" (1/1) ... [2025-01-09 05:02:13,645 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:13" (1/1) ... [2025-01-09 05:02:13,652 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:02:13,656 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:02:13,656 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:02:13,656 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:02:13,657 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:13" (1/1) ... [2025-01-09 05:02:13,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:02:13,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:02:13,688 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 05:02:13,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 05:02:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 05:02:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 05:02:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 05:02:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 05:02:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 05:02:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 05:02:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 05:02:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 05:02:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 05:02:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 05:02:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 05:02:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 05:02:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 05:02:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 05:02:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 05:02:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 05:02:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 05:02:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 05:02:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 05:02:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 05:02:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 05:02:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 05:02:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 05:02:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 05:02:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 05:02:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 05:02:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 05:02:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 05:02:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 05:02:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 05:02:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 05:02:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 05:02:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 05:02:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 05:02:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 05:02:13,714 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 05:02:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:02:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 05:02:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 05:02:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 05:02:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 05:02:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 05:02:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 05:02:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 05:02:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 05:02:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 05:02:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 05:02:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 05:02:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 05:02:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 05:02:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 05:02:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 05:02:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 05:02:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-09 05:02:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-09 05:02:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2025-01-09 05:02:13,715 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2025-01-09 05:02:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-01-09 05:02:13,715 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-01-09 05:02:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-01-09 05:02:13,715 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-01-09 05:02:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 05:02:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 05:02:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 05:02:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 05:02:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 05:02:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 05:02:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 05:02:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 05:02:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 05:02:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 05:02:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 05:02:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 05:02:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 05:02:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 05:02:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 05:02:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-09 05:02:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-09 05:02:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-01-09 05:02:13,716 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-01-09 05:02:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-01-09 05:02:13,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-01-09 05:02:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 05:02:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 05:02:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 05:02:13,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 05:02:13,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 05:02:13,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 05:02:13,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 05:02:13,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 05:02:13,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 05:02:13,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 05:02:13,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 05:02:13,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 05:02:13,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-09 05:02:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-09 05:02:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-09 05:02:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-01-09 05:02:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-01-09 05:02:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-01-09 05:02:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-01-09 05:02:13,721 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-01-09 05:02:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:02:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 05:02:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 05:02:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 05:02:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 05:02:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 05:02:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 05:02:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 05:02:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 05:02:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 05:02:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 05:02:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 05:02:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 05:02:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 05:02:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 05:02:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 05:02:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 05:02:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-01-09 05:02:13,721 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-01-09 05:02:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:02:13,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:02:13,909 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:02:13,910 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:02:14,295 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint L750: SUMMARY for call __CS_cs(); srcloc: null [2025-01-09 05:02:14,295 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-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_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-01-09 05:02:14,295 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:02:14,295 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:02:14,295 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: 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_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-01-09 05:02:14,295 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:02:14,295 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: 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_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-01-09 05:02:14,647 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2025-01-09 05:02:14,647 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:02:14,661 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:02:14,663 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 05:02:14,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:02:14 BoogieIcfgContainer [2025-01-09 05:02:14,664 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:02:14,665 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:02:14,665 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:02:14,669 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:02:14,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:02:13" (1/3) ... [2025-01-09 05:02:14,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ec9d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:02:14, skipping insertion in model container [2025-01-09 05:02:14,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:13" (2/3) ... [2025-01-09 05:02:14,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ec9d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:02:14, skipping insertion in model container [2025-01-09 05:02:14,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:02:14" (3/3) ... [2025-01-09 05:02:14,671 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_stateful-2.i [2025-01-09 05:02:14,684 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:02:14,685 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_stateful-2.i that has 9 procedures, 170 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 05:02:14,734 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:02:14,746 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;@3b2e3f20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:02:14,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 05:02:14,751 INFO L276 IsEmpty]: Start isEmpty. Operand has 170 states, 106 states have (on average 1.4433962264150944) internal successors, (153), 107 states have internal predecessors, (153), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 05:02:14,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 05:02:14,764 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:14,765 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:02:14,765 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:14,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:14,768 INFO L85 PathProgramCache]: Analyzing trace with hash -255008137, now seen corresponding path program 1 times [2025-01-09 05:02:14,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:14,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362403021] [2025-01-09 05:02:14,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:14,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:14,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 05:02:14,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 05:02:14,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:14,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:15,243 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 05:02:15,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:15,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362403021] [2025-01-09 05:02:15,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362403021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:02:15,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:02:15,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:02:15,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321600235] [2025-01-09 05:02:15,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:02:15,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:02:15,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:15,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:02:15,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:02:15,265 INFO L87 Difference]: Start difference. First operand has 170 states, 106 states have (on average 1.4433962264150944) internal successors, (153), 107 states have internal predecessors, (153), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 05:02:15,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:15,382 INFO L93 Difference]: Finished difference Result 338 states and 562 transitions. [2025-01-09 05:02:15,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:02:15,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2025-01-09 05:02:15,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:15,389 INFO L225 Difference]: With dead ends: 338 [2025-01-09 05:02:15,389 INFO L226 Difference]: Without dead ends: 168 [2025-01-09 05:02:15,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:02:15,395 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 2 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 509 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:15,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 509 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:02:15,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-09 05:02:15,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2025-01-09 05:02:15,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 104 states have internal predecessors, (148), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 05:02:15,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 256 transitions. [2025-01-09 05:02:15,438 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 256 transitions. Word has length 71 [2025-01-09 05:02:15,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:15,438 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 256 transitions. [2025-01-09 05:02:15,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 05:02:15,438 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 256 transitions. [2025-01-09 05:02:15,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 05:02:15,442 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:15,442 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:02:15,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:02:15,442 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:15,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:15,443 INFO L85 PathProgramCache]: Analyzing trace with hash 589571805, now seen corresponding path program 1 times [2025-01-09 05:02:15,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:15,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046509524] [2025-01-09 05:02:15,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:15,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:15,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 05:02:15,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 05:02:15,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:15,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:15,688 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 05:02:15,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:15,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046509524] [2025-01-09 05:02:15,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046509524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:02:15,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:02:15,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:02:15,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786433695] [2025-01-09 05:02:15,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:02:15,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:02:15,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:15,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:02:15,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:02:15,690 INFO L87 Difference]: Start difference. First operand 167 states and 256 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 05:02:15,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:15,731 INFO L93 Difference]: Finished difference Result 332 states and 511 transitions. [2025-01-09 05:02:15,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:02:15,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 73 [2025-01-09 05:02:15,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:15,733 INFO L225 Difference]: With dead ends: 332 [2025-01-09 05:02:15,733 INFO L226 Difference]: Without dead ends: 168 [2025-01-09 05:02:15,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:02:15,737 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 0 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 505 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-01-09 05:02:15,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 505 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:02:15,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-09 05:02:15,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2025-01-09 05:02:15,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 105 states have (on average 1.4190476190476191) internal successors, (149), 105 states have internal predecessors, (149), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 05:02:15,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 257 transitions. [2025-01-09 05:02:15,757 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 257 transitions. Word has length 73 [2025-01-09 05:02:15,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:15,758 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 257 transitions. [2025-01-09 05:02:15,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 05:02:15,758 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 257 transitions. [2025-01-09 05:02:15,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 05:02:15,762 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:15,762 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:02:15,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:02:15,762 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:15,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:15,763 INFO L85 PathProgramCache]: Analyzing trace with hash -2134559961, now seen corresponding path program 1 times [2025-01-09 05:02:15,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:15,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053916812] [2025-01-09 05:02:15,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:15,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:15,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 05:02:15,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 05:02:15,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:15,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 05:02:16,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:16,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053916812] [2025-01-09 05:02:16,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053916812] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:02:16,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393021446] [2025-01-09 05:02:16,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:16,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:02:16,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:02:16,036 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:02:16,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 05:02:16,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 05:02:16,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 05:02:16,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:16,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:16,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 05:02:16,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:02:16,404 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 05:02:16,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:02:16,488 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 05:02:16,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393021446] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:02:16,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:02:16,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-09 05:02:16,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178247666] [2025-01-09 05:02:16,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:02:16,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:02:16,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:16,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:02:16,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:02:16,491 INFO L87 Difference]: Start difference. First operand 168 states and 257 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 05:02:16,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:16,538 INFO L93 Difference]: Finished difference Result 335 states and 515 transitions. [2025-01-09 05:02:16,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:02:16,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 74 [2025-01-09 05:02:16,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:16,541 INFO L225 Difference]: With dead ends: 335 [2025-01-09 05:02:16,541 INFO L226 Difference]: Without dead ends: 170 [2025-01-09 05:02:16,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 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-01-09 05:02:16,542 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 0 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 756 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-01-09 05:02:16,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 756 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:02:16,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-01-09 05:02:16,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-01-09 05:02:16,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 107 states have (on average 1.411214953271028) internal successors, (151), 107 states have internal predecessors, (151), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 05:02:16,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 259 transitions. [2025-01-09 05:02:16,553 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 259 transitions. Word has length 74 [2025-01-09 05:02:16,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:16,554 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 259 transitions. [2025-01-09 05:02:16,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 05:02:16,554 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 259 transitions. [2025-01-09 05:02:16,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 05:02:16,555 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:16,555 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2025-01-09 05:02:16,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 05:02:16,756 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-01-09 05:02:16,757 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:16,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:16,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1356124647, now seen corresponding path program 2 times [2025-01-09 05:02:16,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:16,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070303762] [2025-01-09 05:02:16,758 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 05:02:16,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:16,829 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-01-09 05:02:16,851 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 76 statements. [2025-01-09 05:02:16,852 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 05:02:16,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:17,017 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-01-09 05:02:17,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:17,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070303762] [2025-01-09 05:02:17,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070303762] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:02:17,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:02:17,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 05:02:17,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35066297] [2025-01-09 05:02:17,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:02:17,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:02:17,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:17,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:02:17,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:02:17,020 INFO L87 Difference]: Start difference. First operand 170 states and 259 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 05:02:17,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:17,066 INFO L93 Difference]: Finished difference Result 330 states and 513 transitions. [2025-01-09 05:02:17,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:02:17,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 76 [2025-01-09 05:02:17,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:17,070 INFO L225 Difference]: With dead ends: 330 [2025-01-09 05:02:17,072 INFO L226 Difference]: Without dead ends: 304 [2025-01-09 05:02:17,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:02:17,074 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 218 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:17,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 909 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:02:17,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-01-09 05:02:17,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 303. [2025-01-09 05:02:17,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 189 states have (on average 1.439153439153439) internal successors, (272), 189 states have internal predecessors, (272), 97 states have call successors, (97), 16 states have call predecessors, (97), 16 states have return successors, (105), 97 states have call predecessors, (105), 97 states have call successors, (105) [2025-01-09 05:02:17,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 474 transitions. [2025-01-09 05:02:17,106 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 474 transitions. Word has length 76 [2025-01-09 05:02:17,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:17,107 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 474 transitions. [2025-01-09 05:02:17,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 05:02:17,107 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 474 transitions. [2025-01-09 05:02:17,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 05:02:17,112 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:17,113 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 4, 4, 4, 4, 4, 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] [2025-01-09 05:02:17,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:02:17,113 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:17,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:17,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1151510433, now seen corresponding path program 1 times [2025-01-09 05:02:17,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:17,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858488890] [2025-01-09 05:02:17,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:17,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:17,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 05:02:17,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 05:02:17,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:17,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:17,353 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-01-09 05:02:17,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:17,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858488890] [2025-01-09 05:02:17,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858488890] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:02:17,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829370299] [2025-01-09 05:02:17,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:17,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:02:17,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:02:17,357 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:02:17,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 05:02:17,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 05:02:17,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 05:02:17,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:17,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:17,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 05:02:17,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:02:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-01-09 05:02:17,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:02:17,905 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-01-09 05:02:17,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829370299] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:02:17,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:02:17,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-01-09 05:02:17,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922741496] [2025-01-09 05:02:17,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:02:17,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:02:17,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:17,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:02:17,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:02:17,906 INFO L87 Difference]: Start difference. First operand 303 states and 474 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-01-09 05:02:18,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:18,680 INFO L93 Difference]: Finished difference Result 603 states and 945 transitions. [2025-01-09 05:02:18,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:02:18,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 142 [2025-01-09 05:02:18,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:18,694 INFO L225 Difference]: With dead ends: 603 [2025-01-09 05:02:18,694 INFO L226 Difference]: Without dead ends: 308 [2025-01-09 05:02:18,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 281 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:02:18,699 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 2 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:18,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 502 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:02:18,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-01-09 05:02:18,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2025-01-09 05:02:18,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 194 states have (on average 1.4329896907216495) internal successors, (278), 194 states have internal predecessors, (278), 97 states have call successors, (97), 16 states have call predecessors, (97), 16 states have return successors, (105), 97 states have call predecessors, (105), 97 states have call successors, (105) [2025-01-09 05:02:18,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 480 transitions. [2025-01-09 05:02:18,726 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 480 transitions. Word has length 142 [2025-01-09 05:02:18,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:18,726 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 480 transitions. [2025-01-09 05:02:18,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-01-09 05:02:18,726 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 480 transitions. [2025-01-09 05:02:18,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 05:02:18,728 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:18,728 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 4, 4, 4, 4, 4, 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] [2025-01-09 05:02:18,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 05:02:18,929 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-01-09 05:02:18,929 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:18,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:18,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1478264049, now seen corresponding path program 1 times [2025-01-09 05:02:18,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:18,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123036789] [2025-01-09 05:02:18,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:18,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:18,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 05:02:19,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 05:02:19,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:19,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2025-01-09 05:02:19,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:19,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123036789] [2025-01-09 05:02:19,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123036789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:02:19,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:02:19,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 05:02:19,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373571636] [2025-01-09 05:02:19,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:02:19,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:02:19,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:19,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:02:19,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:02:19,347 INFO L87 Difference]: Start difference. First operand 308 states and 480 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 05:02:19,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:19,561 INFO L93 Difference]: Finished difference Result 872 states and 1372 transitions. [2025-01-09 05:02:19,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:02:19,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2025-01-09 05:02:19,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:19,567 INFO L225 Difference]: With dead ends: 872 [2025-01-09 05:02:19,567 INFO L226 Difference]: Without dead ends: 593 [2025-01-09 05:02:19,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:02:19,568 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 239 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:19,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 838 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:02:19,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-01-09 05:02:19,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 589. [2025-01-09 05:02:19,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 365 states have (on average 1.4383561643835616) internal successors, (525), 365 states have internal predecessors, (525), 191 states have call successors, (191), 32 states have call predecessors, (191), 32 states have return successors, (214), 191 states have call predecessors, (214), 191 states have call successors, (214) [2025-01-09 05:02:19,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 930 transitions. [2025-01-09 05:02:19,602 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 930 transitions. Word has length 147 [2025-01-09 05:02:19,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:19,602 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 930 transitions. [2025-01-09 05:02:19,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 05:02:19,602 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 930 transitions. [2025-01-09 05:02:19,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 05:02:19,605 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:19,605 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 4, 4, 4, 4, 4, 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] [2025-01-09 05:02:19,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:02:19,606 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:19,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:19,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1522560977, now seen corresponding path program 1 times [2025-01-09 05:02:19,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:19,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840304090] [2025-01-09 05:02:19,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:19,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:19,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 05:02:19,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 05:02:19,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:19,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:20,068 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2025-01-09 05:02:20,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:20,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840304090] [2025-01-09 05:02:20,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840304090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:02:20,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:02:20,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 05:02:20,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622747095] [2025-01-09 05:02:20,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:02:20,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:02:20,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:20,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:02:20,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:02:20,069 INFO L87 Difference]: Start difference. First operand 589 states and 930 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 05:02:21,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:02:21,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:21,331 INFO L93 Difference]: Finished difference Result 1094 states and 1713 transitions. [2025-01-09 05:02:21,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:02:21,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2025-01-09 05:02:21,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:21,336 INFO L225 Difference]: With dead ends: 1094 [2025-01-09 05:02:21,338 INFO L226 Difference]: Without dead ends: 520 [2025-01-09 05:02:21,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:02:21,341 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 235 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:21,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 839 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 05:02:21,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-01-09 05:02:21,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 516. [2025-01-09 05:02:21,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 322 states have (on average 1.3540372670807452) internal successors, (436), 321 states have internal predecessors, (436), 164 states have call successors, (164), 29 states have call predecessors, (164), 29 states have return successors, (179), 165 states have call predecessors, (179), 164 states have call successors, (179) [2025-01-09 05:02:21,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 779 transitions. [2025-01-09 05:02:21,387 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 779 transitions. Word has length 147 [2025-01-09 05:02:21,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:21,387 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 779 transitions. [2025-01-09 05:02:21,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 05:02:21,387 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 779 transitions. [2025-01-09 05:02:21,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 05:02:21,389 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:21,389 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 4, 4, 4, 4, 4, 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] [2025-01-09 05:02:21,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:02:21,390 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:21,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:21,390 INFO L85 PathProgramCache]: Analyzing trace with hash -877165921, now seen corresponding path program 1 times [2025-01-09 05:02:21,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:21,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355503494] [2025-01-09 05:02:21,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:21,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:21,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 05:02:21,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 05:02:21,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:21,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:21,948 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2025-01-09 05:02:21,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:21,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355503494] [2025-01-09 05:02:21,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355503494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:02:21,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:02:21,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:02:21,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726305213] [2025-01-09 05:02:21,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:02:21,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:02:21,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:21,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:02:21,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:02:21,950 INFO L87 Difference]: Start difference. First operand 516 states and 779 transitions. Second operand has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 4 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-01-09 05:02:22,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:22,360 INFO L93 Difference]: Finished difference Result 563 states and 837 transitions. [2025-01-09 05:02:22,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 05:02:22,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 4 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 147 [2025-01-09 05:02:22,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:22,364 INFO L225 Difference]: With dead ends: 563 [2025-01-09 05:02:22,364 INFO L226 Difference]: Without dead ends: 441 [2025-01-09 05:02:22,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:02:22,366 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 259 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:22,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 1010 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:02:22,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-01-09 05:02:22,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 437. [2025-01-09 05:02:22,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 277 states have (on average 1.3610108303249098) internal successors, (377), 278 states have internal predecessors, (377), 132 states have call successors, (132), 25 states have call predecessors, (132), 27 states have return successors, (150), 133 states have call predecessors, (150), 132 states have call successors, (150) [2025-01-09 05:02:22,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 659 transitions. [2025-01-09 05:02:22,401 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 659 transitions. Word has length 147 [2025-01-09 05:02:22,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:22,401 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 659 transitions. [2025-01-09 05:02:22,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 4 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-01-09 05:02:22,401 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 659 transitions. [2025-01-09 05:02:22,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 05:02:22,405 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:22,406 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 8, 8, 8, 8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:02:22,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:02:22,406 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:22,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:22,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1759522064, now seen corresponding path program 1 times [2025-01-09 05:02:22,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:22,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334121293] [2025-01-09 05:02:22,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:22,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:22,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 05:02:22,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 05:02:22,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:22,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:22,812 INFO L134 CoverageAnalysis]: Checked inductivity of 790 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2025-01-09 05:02:22,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:22,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334121293] [2025-01-09 05:02:22,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334121293] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:02:22,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257318216] [2025-01-09 05:02:22,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:22,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:02:22,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:02:22,817 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:02:22,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 05:02:23,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 05:02:23,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 05:02:23,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:23,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:23,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 1537 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 05:02:23,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:02:23,334 INFO L134 CoverageAnalysis]: Checked inductivity of 790 backedges. 320 proven. 4 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2025-01-09 05:02:23,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:02:23,708 INFO L134 CoverageAnalysis]: Checked inductivity of 790 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2025-01-09 05:02:23,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257318216] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:02:23,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:02:23,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-01-09 05:02:23,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355552720] [2025-01-09 05:02:23,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:02:23,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 05:02:23,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:23,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 05:02:23,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-01-09 05:02:23,710 INFO L87 Difference]: Start difference. First operand 437 states and 659 transitions. Second operand has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 9 states have call successors, (50), 5 states have call predecessors, (50), 6 states have return successors, (51), 7 states have call predecessors, (51), 9 states have call successors, (51) [2025-01-09 05:02:24,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:24,544 INFO L93 Difference]: Finished difference Result 1089 states and 1673 transitions. [2025-01-09 05:02:24,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:02:24,544 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 9 states have call successors, (50), 5 states have call predecessors, (50), 6 states have return successors, (51), 7 states have call predecessors, (51), 9 states have call successors, (51) Word has length 206 [2025-01-09 05:02:24,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:24,549 INFO L225 Difference]: With dead ends: 1089 [2025-01-09 05:02:24,549 INFO L226 Difference]: Without dead ends: 687 [2025-01-09 05:02:24,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:02:24,551 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 428 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:24,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 890 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:02:24,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-01-09 05:02:24,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 670. [2025-01-09 05:02:24,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 419 states have (on average 1.3818615751789975) internal successors, (579), 422 states have internal predecessors, (579), 205 states have call successors, (205), 43 states have call predecessors, (205), 45 states have return successors, (237), 204 states have call predecessors, (237), 205 states have call successors, (237) [2025-01-09 05:02:24,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1021 transitions. [2025-01-09 05:02:24,586 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1021 transitions. Word has length 206 [2025-01-09 05:02:24,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:24,586 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 1021 transitions. [2025-01-09 05:02:24,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 9 states have call successors, (50), 5 states have call predecessors, (50), 6 states have return successors, (51), 7 states have call predecessors, (51), 9 states have call successors, (51) [2025-01-09 05:02:24,587 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1021 transitions. [2025-01-09 05:02:24,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 05:02:24,590 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:24,590 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 8, 8, 8, 8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:02:24,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 05:02:24,793 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-01-09 05:02:24,794 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:24,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:24,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1353945296, now seen corresponding path program 1 times [2025-01-09 05:02:24,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:24,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954011546] [2025-01-09 05:02:24,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:24,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:24,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 05:02:24,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 05:02:24,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:24,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:26,225 INFO L134 CoverageAnalysis]: Checked inductivity of 790 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2025-01-09 05:02:26,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:26,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954011546] [2025-01-09 05:02:26,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954011546] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:02:26,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721523293] [2025-01-09 05:02:26,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:26,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:02:26,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:02:26,228 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:02:26,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 05:02:26,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 05:02:28,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 05:02:28,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:28,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:28,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 1635 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-09 05:02:28,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:02:28,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 05:02:34,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 05:02:34,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 05:02:34,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 48 [2025-01-09 05:02:36,231 INFO L349 Elim1Store]: treesize reduction 64, result has 54.9 percent of original size [2025-01-09 05:02:36,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 104 [2025-01-09 05:02:58,672 INFO L134 CoverageAnalysis]: Checked inductivity of 790 backedges. 473 proven. 4 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-01-09 05:02:58,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:02:58,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2025-01-09 05:02:58,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-01-09 05:02:59,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-01-09 05:02:59,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2025-01-09 05:02:59,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-01-09 05:02:59,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2025-01-09 05:02:59,452 INFO L134 CoverageAnalysis]: Checked inductivity of 790 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2025-01-09 05:02:59,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721523293] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:02:59,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:02:59,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 9] total 38 [2025-01-09 05:02:59,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875157963] [2025-01-09 05:02:59,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:02:59,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-01-09 05:02:59,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:59,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-01-09 05:02:59,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1258, Unknown=4, NotChecked=0, Total=1406 [2025-01-09 05:02:59,455 INFO L87 Difference]: Start difference. First operand 670 states and 1021 transitions. Second operand has 38 states, 35 states have (on average 4.428571428571429) internal successors, (155), 36 states have internal predecessors, (155), 19 states have call successors, (66), 12 states have call predecessors, (66), 14 states have return successors, (66), 17 states have call predecessors, (66), 19 states have call successors, (66) [2025-01-09 05:03:00,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:03:04,909 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-01-09 05:03:06,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:03:08,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:03:12,079 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-01-09 05:03:16,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 05:03:20,193 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-01-09 05:03:24,201 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-01-09 05:03:29,449 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-01-09 05:03:34,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:03:34,526 INFO L93 Difference]: Finished difference Result 1318 states and 2056 transitions. [2025-01-09 05:03:34,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 05:03:34,526 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 4.428571428571429) internal successors, (155), 36 states have internal predecessors, (155), 19 states have call successors, (66), 12 states have call predecessors, (66), 14 states have return successors, (66), 17 states have call predecessors, (66), 19 states have call successors, (66) Word has length 206 [2025-01-09 05:03:34,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:03:34,531 INFO L225 Difference]: With dead ends: 1318 [2025-01-09 05:03:34,532 INFO L226 Difference]: Without dead ends: 768 [2025-01-09 05:03:34,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 389 SyntacticMatches, 7 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=677, Invalid=3609, Unknown=4, NotChecked=0, Total=4290 [2025-01-09 05:03:34,534 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 1485 mSDsluCounter, 2304 mSDsCounter, 0 mSdLazyCounter, 3507 mSolverCounterSat, 1313 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 2533 SdHoareTripleChecker+Invalid, 4826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1313 IncrementalHoareTripleChecker+Valid, 3507 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:03:34,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1485 Valid, 2533 Invalid, 4826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1313 Valid, 3507 Invalid, 6 Unknown, 0 Unchecked, 33.7s Time] [2025-01-09 05:03:34,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-01-09 05:03:34,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 719. [2025-01-09 05:03:34,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 449 states have (on average 1.3808463251670378) internal successors, (620), 455 states have internal predecessors, (620), 219 states have call successors, (219), 43 states have call predecessors, (219), 50 states have return successors, (276), 220 states have call predecessors, (276), 219 states have call successors, (276) [2025-01-09 05:03:34,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1115 transitions. [2025-01-09 05:03:34,594 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1115 transitions. Word has length 206 [2025-01-09 05:03:34,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:03:34,594 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 1115 transitions. [2025-01-09 05:03:34,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 4.428571428571429) internal successors, (155), 36 states have internal predecessors, (155), 19 states have call successors, (66), 12 states have call predecessors, (66), 14 states have return successors, (66), 17 states have call predecessors, (66), 19 states have call successors, (66) [2025-01-09 05:03:34,594 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1115 transitions. [2025-01-09 05:03:34,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-09 05:03:34,598 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:03:34,599 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 9, 9, 9, 9, 9, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:03:34,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 05:03:34,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 05:03:34,803 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:03:34,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:03:34,804 INFO L85 PathProgramCache]: Analyzing trace with hash -193558314, now seen corresponding path program 1 times [2025-01-09 05:03:34,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:03:34,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4390155] [2025-01-09 05:03:34,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:03:34,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:03:34,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 05:03:34,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 05:03:34,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:03:34,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:03:37,051 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2025-01-09 05:03:37,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:03:37,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4390155] [2025-01-09 05:03:37,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4390155] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:03:37,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66653172] [2025-01-09 05:03:37,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:03:37,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:03:37,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:03:37,054 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:03:37,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 05:03:37,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 05:03:37,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 05:03:37,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:03:37,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:03:37,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 1821 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-09 05:03:37,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:03:37,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2025-01-09 05:03:42,472 INFO L349 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2025-01-09 05:03:42,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 50 [2025-01-09 05:03:42,670 INFO L349 Elim1Store]: treesize reduction 61, result has 60.9 percent of original size [2025-01-09 05:03:42,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 127 [2025-01-09 05:03:43,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 05:03:43,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 29 [2025-01-09 05:03:43,517 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 495 proven. 57 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2025-01-09 05:03:43,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:03:43,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2025-01-09 05:03:43,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 134 [2025-01-09 05:03:44,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2025-01-09 05:03:44,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2025-01-09 05:03:44,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2025-01-09 05:03:44,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2025-01-09 05:03:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2025-01-09 05:03:44,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66653172] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:03:44,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:03:44,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 14] total 40 [2025-01-09 05:03:44,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995624469] [2025-01-09 05:03:44,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:03:44,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-01-09 05:03:44,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:03:44,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-01-09 05:03:44,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1416, Unknown=2, NotChecked=0, Total=1560 [2025-01-09 05:03:44,736 INFO L87 Difference]: Start difference. First operand 719 states and 1115 transitions. Second operand has 40 states, 36 states have (on average 4.388888888888889) internal successors, (158), 37 states have internal predecessors, (158), 19 states have call successors, (68), 11 states have call predecessors, (68), 14 states have return successors, (68), 17 states have call predecessors, (68), 19 states have call successors, (68)