./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-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 99f48cdcb9a25adc64e4307e90599f4e37a0b97f677ff29ab3d60f24a1c8e980 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:34:11,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:34:11,070 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 08:34:11,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:34:11,075 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:34:11,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:34:11,100 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:34:11,100 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:34:11,100 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 08:34:11,100 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 08:34:11,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:34:11,101 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:34:11,101 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:34:11,101 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:34:11,102 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:34:11,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:34:11,102 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:34:11,102 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 08:34:11,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:34:11,102 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 08:34:11,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:34:11,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:34:11,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:34:11,103 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:34:11,103 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 08:34:11,103 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:34:11,103 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:34:11,103 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:34:11,103 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:34:11,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:34:11,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 08:34:11,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:34:11,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:34:11,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:34:11,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:34:11,104 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:34:11,104 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:34:11,104 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:34:11,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:34:11,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:34:11,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:34:11,105 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:34:11,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:34:11,105 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 -> 99f48cdcb9a25adc64e4307e90599f4e37a0b97f677ff29ab3d60f24a1c8e980 [2025-02-06 08:34:11,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:34:11,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:34:11,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:34:11,368 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:34:11,368 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:34:11,370 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i [2025-02-06 08:34:12,580 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c230dda7/d5b0bc44173e43beb3433ae542eb6055/FLAGb7f22f2d9 [2025-02-06 08:34:12,904 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:34:12,909 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i [2025-02-06 08:34:12,927 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c230dda7/d5b0bc44173e43beb3433ae542eb6055/FLAGb7f22f2d9 [2025-02-06 08:34:12,943 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c230dda7/d5b0bc44173e43beb3433ae542eb6055 [2025-02-06 08:34:12,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:34:12,947 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:34:12,948 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:34:12,948 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:34:12,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:34:12,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:34:12" (1/1) ... [2025-02-06 08:34:12,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d12d3a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:12, skipping insertion in model container [2025-02-06 08:34:12,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:34:12" (1/1) ... [2025-02-06 08:34:12,992 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:34:13,287 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/uthash-2.0.2/uthash_BER_test7-2.i[33021,33034] [2025-02-06 08:34:13,386 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/uthash-2.0.2/uthash_BER_test7-2.i[44124,44137] [2025-02-06 08:34:13,387 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/uthash-2.0.2/uthash_BER_test7-2.i[44245,44258] [2025-02-06 08:34:13,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:34:13,414 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:34:13,447 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/uthash-2.0.2/uthash_BER_test7-2.i[33021,33034] [2025-02-06 08:34:13,488 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/uthash-2.0.2/uthash_BER_test7-2.i[44124,44137] [2025-02-06 08:34:13,488 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/uthash-2.0.2/uthash_BER_test7-2.i[44245,44258] [2025-02-06 08:34:13,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:34:13,533 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:34:13,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:13 WrapperNode [2025-02-06 08:34:13,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:34:13,536 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:34:13,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:34:13,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:34:13,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:13" (1/1) ... [2025-02-06 08:34:13,566 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:13" (1/1) ... [2025-02-06 08:34:13,624 INFO L138 Inliner]: procedures = 176, calls = 320, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1537 [2025-02-06 08:34:13,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:34:13,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:34:13,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:34:13,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:34:13,632 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:13" (1/1) ... [2025-02-06 08:34:13,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:13" (1/1) ... [2025-02-06 08:34:13,644 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:13" (1/1) ... [2025-02-06 08:34:13,717 INFO L175 MemorySlicer]: Split 301 memory accesses to 3 slices as follows [2, 34, 265]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 4, 58]. [2025-02-06 08:34:13,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:13" (1/1) ... [2025-02-06 08:34:13,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:13" (1/1) ... [2025-02-06 08:34:13,752 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:13" (1/1) ... [2025-02-06 08:34:13,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:13" (1/1) ... [2025-02-06 08:34:13,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:13" (1/1) ... [2025-02-06 08:34:13,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:13" (1/1) ... [2025-02-06 08:34:13,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:34:13,769 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:34:13,769 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:34:13,769 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:34:13,770 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:13" (1/1) ... [2025-02-06 08:34:13,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:34:13,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:34:13,797 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 08:34:13,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 08:34:13,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 08:34:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 08:34:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 08:34:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 08:34:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 08:34:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 08:34:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 08:34:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 08:34:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 08:34:13,823 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 08:34:13,823 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 08:34:13,823 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 08:34:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 08:34:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:34:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 08:34:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 08:34:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 08:34:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 08:34:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 08:34:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 08:34:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 08:34:13,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 08:34:13,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 08:34:13,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 08:34:13,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 08:34:13,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:34:13,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:34:14,033 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:34:14,034 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:34:15,069 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-06 08:34:15,133 INFO L? ?]: Removed 333 outVars from TransFormulas that were not future-live. [2025-02-06 08:34:15,133 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:34:15,167 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:34:15,168 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 08:34:15,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:34:15 BoogieIcfgContainer [2025-02-06 08:34:15,168 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:34:15,170 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:34:15,170 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:34:15,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:34:15,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:34:12" (1/3) ... [2025-02-06 08:34:15,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737990e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:34:15, skipping insertion in model container [2025-02-06 08:34:15,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:13" (2/3) ... [2025-02-06 08:34:15,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737990e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:34:15, skipping insertion in model container [2025-02-06 08:34:15,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:34:15" (3/3) ... [2025-02-06 08:34:15,175 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test7-2.i [2025-02-06 08:34:15,184 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:34:15,186 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test7-2.i that has 4 procedures, 432 locations, 1 initial locations, 43 loop locations, and 2 error locations. [2025-02-06 08:34:15,224 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:34:15,231 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;@22abcf11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:34:15,232 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-06 08:34:15,235 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 417 states have (on average 1.6211031175059951) internal successors, (676), 419 states have internal predecessors, (676), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:34:15,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 08:34:15,239 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:34:15,239 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:34:15,239 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:34:15,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:34:15,242 INFO L85 PathProgramCache]: Analyzing trace with hash -625529042, now seen corresponding path program 1 times [2025-02-06 08:34:15,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:34:15,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239164136] [2025-02-06 08:34:15,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:15,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:34:15,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 08:34:15,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 08:34:15,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:15,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:15,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:34:15,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:34:15,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239164136] [2025-02-06 08:34:15,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239164136] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:34:15,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:34:15,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:34:15,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539084137] [2025-02-06 08:34:15,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:34:15,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 08:34:15,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:34:15,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 08:34:15,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:34:15,363 INFO L87 Difference]: Start difference. First operand has 424 states, 417 states have (on average 1.6211031175059951) internal successors, (676), 419 states have internal predecessors, (676), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:34:15,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:34:15,485 INFO L93 Difference]: Finished difference Result 846 states and 1362 transitions. [2025-02-06 08:34:15,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 08:34:15,487 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 08:34:15,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:34:15,493 INFO L225 Difference]: With dead ends: 846 [2025-02-06 08:34:15,494 INFO L226 Difference]: Without dead ends: 388 [2025-02-06 08:34:15,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:34:15,498 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:34:15,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 567 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:34:15,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-02-06 08:34:15,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2025-02-06 08:34:15,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 382 states have (on average 1.4528795811518325) internal successors, (555), 383 states have internal predecessors, (555), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:34:15,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 561 transitions. [2025-02-06 08:34:15,551 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 561 transitions. Word has length 8 [2025-02-06 08:34:15,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:34:15,551 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 561 transitions. [2025-02-06 08:34:15,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:34:15,551 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 561 transitions. [2025-02-06 08:34:15,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 08:34:15,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:34:15,552 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:34:15,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:34:15,552 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:34:15,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:34:15,553 INFO L85 PathProgramCache]: Analyzing trace with hash -2061122660, now seen corresponding path program 1 times [2025-02-06 08:34:15,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:34:15,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50692129] [2025-02-06 08:34:15,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:15,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:34:15,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 08:34:15,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 08:34:15,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:15,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:15,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:34:15,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:34:15,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50692129] [2025-02-06 08:34:15,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50692129] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:34:15,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:34:15,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:34:15,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048970230] [2025-02-06 08:34:15,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:34:15,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:34:15,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:34:15,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:34:15,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:34:15,745 INFO L87 Difference]: Start difference. First operand 388 states and 561 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:34:15,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:34:15,982 INFO L93 Difference]: Finished difference Result 958 states and 1389 transitions. [2025-02-06 08:34:15,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:34:15,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-06 08:34:15,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:34:15,986 INFO L225 Difference]: With dead ends: 958 [2025-02-06 08:34:15,988 INFO L226 Difference]: Without dead ends: 769 [2025-02-06 08:34:15,990 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-02-06 08:34:15,991 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 545 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:34:15,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1572 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:34:15,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2025-02-06 08:34:16,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 390. [2025-02-06 08:34:16,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 384 states have (on average 1.4505208333333333) internal successors, (557), 385 states have internal predecessors, (557), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:34:16,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 563 transitions. [2025-02-06 08:34:16,015 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 563 transitions. Word has length 10 [2025-02-06 08:34:16,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:34:16,015 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 563 transitions. [2025-02-06 08:34:16,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:34:16,015 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 563 transitions. [2025-02-06 08:34:16,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-06 08:34:16,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:34:16,017 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:34:16,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:34:16,017 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:34:16,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:34:16,018 INFO L85 PathProgramCache]: Analyzing trace with hash 2085870523, now seen corresponding path program 1 times [2025-02-06 08:34:16,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:34:16,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122254763] [2025-02-06 08:34:16,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:16,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:34:16,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 08:34:16,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 08:34:16,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:16,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:16,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:34:16,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:34:16,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122254763] [2025-02-06 08:34:16,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122254763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:34:16,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:34:16,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:34:16,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394115532] [2025-02-06 08:34:16,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:34:16,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:34:16,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:34:16,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:34:16,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:34:16,389 INFO L87 Difference]: Start difference. First operand 390 states and 563 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:34:16,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:34:16,511 INFO L93 Difference]: Finished difference Result 734 states and 1056 transitions. [2025-02-06 08:34:16,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:34:16,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-02-06 08:34:16,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:34:16,513 INFO L225 Difference]: With dead ends: 734 [2025-02-06 08:34:16,513 INFO L226 Difference]: Without dead ends: 348 [2025-02-06 08:34:16,513 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-02-06 08:34:16,514 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 36 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:34:16,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1258 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:34:16,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-02-06 08:34:16,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2025-02-06 08:34:16,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 342 states have (on average 1.4035087719298245) internal successors, (480), 343 states have internal predecessors, (480), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:34:16,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 486 transitions. [2025-02-06 08:34:16,525 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 486 transitions. Word has length 85 [2025-02-06 08:34:16,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:34:16,526 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 486 transitions. [2025-02-06 08:34:16,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:34:16,526 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 486 transitions. [2025-02-06 08:34:16,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-06 08:34:16,527 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:34:16,527 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:34:16,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:34:16,529 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:34:16,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:34:16,531 INFO L85 PathProgramCache]: Analyzing trace with hash -935734459, now seen corresponding path program 1 times [2025-02-06 08:34:16,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:34:16,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363999252] [2025-02-06 08:34:16,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:16,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:34:16,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 08:34:16,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 08:34:16,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:16,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:16,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:34:16,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:34:16,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363999252] [2025-02-06 08:34:16,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363999252] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:34:16,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:34:16,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:34:16,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323506964] [2025-02-06 08:34:16,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:34:16,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:34:16,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:34:16,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:34:16,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:34:16,743 INFO L87 Difference]: Start difference. First operand 348 states and 486 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:34:16,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:34:16,855 INFO L93 Difference]: Finished difference Result 686 states and 962 transitions. [2025-02-06 08:34:16,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:34:16,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-02-06 08:34:16,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:34:16,857 INFO L225 Difference]: With dead ends: 686 [2025-02-06 08:34:16,858 INFO L226 Difference]: Without dead ends: 342 [2025-02-06 08:34:16,858 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-02-06 08:34:16,860 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 9 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:34:16,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1259 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:34:16,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-02-06 08:34:16,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2025-02-06 08:34:16,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 336 states have (on average 1.3988095238095237) internal successors, (470), 337 states have internal predecessors, (470), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:34:16,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 476 transitions. [2025-02-06 08:34:16,874 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 476 transitions. Word has length 85 [2025-02-06 08:34:16,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:34:16,874 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 476 transitions. [2025-02-06 08:34:16,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:34:16,874 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 476 transitions. [2025-02-06 08:34:16,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-06 08:34:16,878 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:34:16,878 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:34:16,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 08:34:16,878 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:34:16,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:34:16,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1373239359, now seen corresponding path program 1 times [2025-02-06 08:34:16,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:34:16,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292216130] [2025-02-06 08:34:16,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:16,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:34:16,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 08:34:16,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 08:34:16,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:16,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:17,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:34:17,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:34:17,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292216130] [2025-02-06 08:34:17,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292216130] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:34:17,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:34:17,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:34:17,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022436231] [2025-02-06 08:34:17,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:34:17,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:34:17,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:34:17,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:34:17,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:34:17,011 INFO L87 Difference]: Start difference. First operand 342 states and 476 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:34:17,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:34:17,170 INFO L93 Difference]: Finished difference Result 926 states and 1299 transitions. [2025-02-06 08:34:17,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:34:17,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-02-06 08:34:17,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:34:17,173 INFO L225 Difference]: With dead ends: 926 [2025-02-06 08:34:17,173 INFO L226 Difference]: Without dead ends: 588 [2025-02-06 08:34:17,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:34:17,175 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 293 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:34:17,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1027 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:34:17,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-02-06 08:34:17,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 581. [2025-02-06 08:34:17,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 575 states have (on average 1.4156521739130434) internal successors, (814), 576 states have internal predecessors, (814), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:34:17,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 820 transitions. [2025-02-06 08:34:17,189 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 820 transitions. Word has length 85 [2025-02-06 08:34:17,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:34:17,190 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 820 transitions. [2025-02-06 08:34:17,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:34:17,190 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 820 transitions. [2025-02-06 08:34:17,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 08:34:17,191 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:34:17,191 INFO L218 NwaCegarLoop]: trace histogram [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-02-06 08:34:17,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 08:34:17,192 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:34:17,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:34:17,192 INFO L85 PathProgramCache]: Analyzing trace with hash -354611700, now seen corresponding path program 1 times [2025-02-06 08:34:17,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:34:17,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945024584] [2025-02-06 08:34:17,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:17,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:34:17,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 08:34:17,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 08:34:17,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:17,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:17,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 08:34:17,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:34:17,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945024584] [2025-02-06 08:34:17,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945024584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:34:17,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:34:17,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:34:17,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533066186] [2025-02-06 08:34:17,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:34:17,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:34:17,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:34:17,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:34:17,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:34:17,555 INFO L87 Difference]: Start difference. First operand 581 states and 820 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:34:17,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:34:17,706 INFO L93 Difference]: Finished difference Result 861 states and 1216 transitions. [2025-02-06 08:34:17,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:34:17,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2025-02-06 08:34:17,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:34:17,710 INFO L225 Difference]: With dead ends: 861 [2025-02-06 08:34:17,710 INFO L226 Difference]: Without dead ends: 857 [2025-02-06 08:34:17,710 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-02-06 08:34:17,711 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 451 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:34:17,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1260 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:34:17,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2025-02-06 08:34:17,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 583. [2025-02-06 08:34:17,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 577 states have (on average 1.41421143847487) internal successors, (816), 578 states have internal predecessors, (816), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:34:17,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 822 transitions. [2025-02-06 08:34:17,726 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 822 transitions. Word has length 100 [2025-02-06 08:34:17,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:34:17,727 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 822 transitions. [2025-02-06 08:34:17,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:34:17,727 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 822 transitions. [2025-02-06 08:34:17,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 08:34:17,728 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:34:17,728 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:34:17,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 08:34:17,729 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:34:17,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:34:17,729 INFO L85 PathProgramCache]: Analyzing trace with hash 166607229, now seen corresponding path program 1 times [2025-02-06 08:34:17,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:34:17,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687749825] [2025-02-06 08:34:17,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:17,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:34:17,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 08:34:17,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 08:34:17,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:17,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 08:34:17,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:34:17,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687749825] [2025-02-06 08:34:17,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687749825] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:34:17,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:34:17,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:34:17,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293491226] [2025-02-06 08:34:17,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:34:17,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:34:17,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:34:17,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:34:17,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:34:17,947 INFO L87 Difference]: Start difference. First operand 583 states and 822 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:34:18,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:34:18,045 INFO L93 Difference]: Finished difference Result 846 states and 1200 transitions. [2025-02-06 08:34:18,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:34:18,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 153 [2025-02-06 08:34:18,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:34:18,048 INFO L225 Difference]: With dead ends: 846 [2025-02-06 08:34:18,048 INFO L226 Difference]: Without dead ends: 499 [2025-02-06 08:34:18,049 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-02-06 08:34:18,049 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 30 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:34:18,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1028 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:34:18,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-02-06 08:34:18,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2025-02-06 08:34:18,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 493 states have (on average 1.3427991886409736) internal successors, (662), 494 states have internal predecessors, (662), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:34:18,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 668 transitions. [2025-02-06 08:34:18,060 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 668 transitions. Word has length 153 [2025-02-06 08:34:18,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:34:18,061 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 668 transitions. [2025-02-06 08:34:18,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:34:18,061 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 668 transitions. [2025-02-06 08:34:18,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 08:34:18,062 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:34:18,062 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:34:18,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 08:34:18,062 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:34:18,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:34:18,062 INFO L85 PathProgramCache]: Analyzing trace with hash -2069189833, now seen corresponding path program 1 times [2025-02-06 08:34:18,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:34:18,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673690803] [2025-02-06 08:34:18,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:18,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:34:18,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 08:34:18,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 08:34:18,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:18,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:18,266 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:34:18,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:34:18,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673690803] [2025-02-06 08:34:18,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673690803] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:34:18,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:34:18,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:34:18,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285645697] [2025-02-06 08:34:18,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:34:18,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:34:18,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:34:18,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:34:18,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:34:18,268 INFO L87 Difference]: Start difference. First operand 499 states and 668 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:34:18,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:34:18,499 INFO L93 Difference]: Finished difference Result 1059 states and 1420 transitions. [2025-02-06 08:34:18,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:34:18,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 153 [2025-02-06 08:34:18,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:34:18,502 INFO L225 Difference]: With dead ends: 1059 [2025-02-06 08:34:18,502 INFO L226 Difference]: Without dead ends: 644 [2025-02-06 08:34:18,503 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-02-06 08:34:18,503 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 790 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:34:18,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 704 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:34:18,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-02-06 08:34:18,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 637. [2025-02-06 08:34:18,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 631 states have (on average 1.3470681458003169) internal successors, (850), 632 states have internal predecessors, (850), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:34:18,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 856 transitions. [2025-02-06 08:34:18,522 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 856 transitions. Word has length 153 [2025-02-06 08:34:18,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:34:18,522 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 856 transitions. [2025-02-06 08:34:18,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:34:18,522 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 856 transitions. [2025-02-06 08:34:18,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 08:34:18,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:34:18,524 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:34:18,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 08:34:18,524 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:34:18,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:34:18,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1616065655, now seen corresponding path program 1 times [2025-02-06 08:34:18,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:34:18,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78544254] [2025-02-06 08:34:18,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:18,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:34:18,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 08:34:18,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 08:34:18,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:18,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:19,171 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:34:19,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:34:19,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78544254] [2025-02-06 08:34:19,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78544254] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:34:19,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490727131] [2025-02-06 08:34:19,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:19,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:34:19,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:34:19,177 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:34:19,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 08:34:19,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 08:34:19,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 08:34:19,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:19,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:19,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 08:34:19,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:34:19,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 08:34:19,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-06 08:34:19,722 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 15 treesize of output 7 [2025-02-06 08:34:19,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:34:19,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:34:19,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:34:19,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490727131] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:34:19,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:34:19,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-02-06 08:34:19,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596573515] [2025-02-06 08:34:19,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:34:19,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 08:34:19,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:34:19,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 08:34:19,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-02-06 08:34:19,912 INFO L87 Difference]: Start difference. First operand 637 states and 856 transitions. Second operand has 11 states, 11 states have (on average 29.272727272727273) internal successors, (322), 11 states have internal predecessors, (322), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:34:20,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:34:20,362 INFO L93 Difference]: Finished difference Result 2873 states and 3879 transitions. [2025-02-06 08:34:20,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 08:34:20,362 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 29.272727272727273) internal successors, (322), 11 states have internal predecessors, (322), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 163 [2025-02-06 08:34:20,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:34:20,371 INFO L225 Difference]: With dead ends: 2873 [2025-02-06 08:34:20,371 INFO L226 Difference]: Without dead ends: 2469 [2025-02-06 08:34:20,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 319 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-02-06 08:34:20,373 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 2109 mSDsluCounter, 2547 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2113 SdHoareTripleChecker+Valid, 2939 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:34:20,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2113 Valid, 2939 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:34:20,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2025-02-06 08:34:20,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 967. [2025-02-06 08:34:20,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 957 states have (on average 1.3396029258098223) internal successors, (1282), 958 states have internal predecessors, (1282), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 08:34:20,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1294 transitions. [2025-02-06 08:34:20,424 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1294 transitions. Word has length 163 [2025-02-06 08:34:20,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:34:20,425 INFO L471 AbstractCegarLoop]: Abstraction has 967 states and 1294 transitions. [2025-02-06 08:34:20,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 29.272727272727273) internal successors, (322), 11 states have internal predecessors, (322), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:34:20,425 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1294 transitions. [2025-02-06 08:34:20,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2025-02-06 08:34:20,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:34:20,436 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2025-02-06 08:34:20,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 08:34:20,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:34:20,637 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:34:20,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:34:20,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1388318588, now seen corresponding path program 1 times [2025-02-06 08:34:20,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:34:20,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085121441] [2025-02-06 08:34:20,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:20,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:34:20,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-02-06 08:34:20,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-02-06 08:34:20,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:20,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:34:23,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:34:23,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085121441] [2025-02-06 08:34:23,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085121441] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:34:23,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058627636] [2025-02-06 08:34:23,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:23,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:34:23,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:34:23,430 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:34:23,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 08:34:23,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-02-06 08:34:23,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-02-06 08:34:23,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:23,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:23,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 1896 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 08:34:23,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:34:23,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 08:34:24,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-06 08:34:24,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:34:24,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:34:24,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:34:24,515 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 15 treesize of output 7 [2025-02-06 08:34:24,523 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:34:24,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:34:24,960 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:34:24,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058627636] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:34:24,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:34:24,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 20 [2025-02-06 08:34:24,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522912511] [2025-02-06 08:34:24,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:34:24,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 08:34:24,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:34:24,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 08:34:24,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2025-02-06 08:34:24,965 INFO L87 Difference]: Start difference. First operand 967 states and 1294 transitions. Second operand has 20 states, 20 states have (on average 38.9) internal successors, (778), 20 states have internal predecessors, (778), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:34:25,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:34:25,773 INFO L93 Difference]: Finished difference Result 6095 states and 8238 transitions. [2025-02-06 08:34:25,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 08:34:25,774 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 38.9) internal successors, (778), 20 states have internal predecessors, (778), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 388 [2025-02-06 08:34:25,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:34:25,793 INFO L225 Difference]: With dead ends: 6095 [2025-02-06 08:34:25,793 INFO L226 Difference]: Without dead ends: 5691 [2025-02-06 08:34:25,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 794 GetRequests, 767 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=223, Invalid=427, Unknown=0, NotChecked=0, Total=650 [2025-02-06 08:34:25,796 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 6246 mSDsluCounter, 4623 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6256 SdHoareTripleChecker+Valid, 5015 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 08:34:25,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6256 Valid, 5015 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 08:34:25,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5691 states. [2025-02-06 08:34:25,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5691 to 1783. [2025-02-06 08:34:25,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1767 states have (on average 1.3333333333333333) internal successors, (2356), 1768 states have internal predecessors, (2356), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 08:34:25,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2380 transitions. [2025-02-06 08:34:25,857 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2380 transitions. Word has length 388 [2025-02-06 08:34:25,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:34:25,859 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 2380 transitions. [2025-02-06 08:34:25,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 38.9) internal successors, (778), 20 states have internal predecessors, (778), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:34:25,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2380 transitions. [2025-02-06 08:34:25,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2025-02-06 08:34:25,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:34:25,871 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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] [2025-02-06 08:34:25,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 08:34:26,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:34:26,075 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:34:26,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:34:26,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1621625124, now seen corresponding path program 2 times [2025-02-06 08:34:26,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:34:26,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248405732] [2025-02-06 08:34:26,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:34:26,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:34:26,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 838 statements into 2 equivalence classes. [2025-02-06 08:34:26,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 73 of 838 statements. [2025-02-06 08:34:26,288 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 08:34:26,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:26,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3381 trivial. 0 not checked. [2025-02-06 08:34:26,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:34:26,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248405732] [2025-02-06 08:34:26,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248405732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:34:26,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:34:26,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:34:26,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549176924] [2025-02-06 08:34:26,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:34:26,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:34:26,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:34:26,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:34:26,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:34:26,425 INFO L87 Difference]: Start difference. First operand 1783 states and 2380 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:34:26,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:34:26,727 INFO L93 Difference]: Finished difference Result 2199 states and 2949 transitions. [2025-02-06 08:34:26,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:34:26,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 838 [2025-02-06 08:34:26,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:34:26,735 INFO L225 Difference]: With dead ends: 2199 [2025-02-06 08:34:26,735 INFO L226 Difference]: Without dead ends: 1798 [2025-02-06 08:34:26,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:34:26,737 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 14 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:34:26,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1506 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:34:26,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2025-02-06 08:34:26,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1789. [2025-02-06 08:34:26,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1773 states have (on average 1.332205301748449) internal successors, (2362), 1774 states have internal predecessors, (2362), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 08:34:26,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2386 transitions. [2025-02-06 08:34:26,776 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 2386 transitions. Word has length 838 [2025-02-06 08:34:26,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:34:26,777 INFO L471 AbstractCegarLoop]: Abstraction has 1789 states and 2386 transitions. [2025-02-06 08:34:26,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:34:26,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2386 transitions. [2025-02-06 08:34:26,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 840 [2025-02-06 08:34:26,790 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:34:26,791 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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] [2025-02-06 08:34:26,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 08:34:26,791 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:34:26,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:34:26,791 INFO L85 PathProgramCache]: Analyzing trace with hash 691448471, now seen corresponding path program 1 times [2025-02-06 08:34:26,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:34:26,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961723681] [2025-02-06 08:34:26,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:26,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:34:27,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 839 statements into 1 equivalence classes. [2025-02-06 08:34:27,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 839 of 839 statements. [2025-02-06 08:34:27,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:27,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:35,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 3377 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:34:35,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:34:35,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961723681] [2025-02-06 08:34:35,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961723681] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:34:35,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583863380] [2025-02-06 08:34:35,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:35,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:34:35,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:34:35,877 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:34:35,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 08:34:36,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 839 statements into 1 equivalence classes. [2025-02-06 08:34:36,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 839 of 839 statements. [2025-02-06 08:34:36,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:36,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:36,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 4159 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 08:34:36,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:34:36,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 08:34:37,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-06 08:34:37,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:34:37,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:34:37,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:34:37,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:34:37,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:34:37,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:34:37,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:34:37,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:34:37,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:34:37,758 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 15 treesize of output 7 [2025-02-06 08:34:37,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 3377 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:34:37,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:34:38,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 3377 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:34:38,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583863380] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:34:38,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:34:38,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 15, 14] total 38 [2025-02-06 08:34:38,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236104351] [2025-02-06 08:34:38,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:34:38,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-06 08:34:38,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:34:38,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-06 08:34:38,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=836, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 08:34:38,720 INFO L87 Difference]: Start difference. First operand 1789 states and 2386 transitions. Second operand has 38 states, 38 states have (on average 44.5) internal successors, (1691), 38 states have internal predecessors, (1691), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:34:40,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:34:40,792 INFO L93 Difference]: Finished difference Result 12679 states and 17096 transitions. [2025-02-06 08:34:40,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-02-06 08:34:40,797 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 44.5) internal successors, (1691), 38 states have internal predecessors, (1691), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 839 [2025-02-06 08:34:40,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:34:40,862 INFO L225 Difference]: With dead ends: 12679 [2025-02-06 08:34:40,864 INFO L226 Difference]: Without dead ends: 12269 [2025-02-06 08:34:40,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1717 GetRequests, 1666 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=871, Invalid=1579, Unknown=0, NotChecked=0, Total=2450 [2025-02-06 08:34:40,871 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 15416 mSDsluCounter, 9403 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15438 SdHoareTripleChecker+Valid, 9795 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:34:40,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15438 Valid, 9795 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 08:34:40,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12269 states. [2025-02-06 08:34:40,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12269 to 3421. [2025-02-06 08:34:40,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3421 states, 3393 states have (on average 1.3292071912761567) internal successors, (4510), 3394 states have internal predecessors, (4510), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 08:34:40,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3421 states to 3421 states and 4558 transitions. [2025-02-06 08:34:40,993 INFO L78 Accepts]: Start accepts. Automaton has 3421 states and 4558 transitions. Word has length 839 [2025-02-06 08:34:40,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:34:40,994 INFO L471 AbstractCegarLoop]: Abstraction has 3421 states and 4558 transitions. [2025-02-06 08:34:40,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 44.5) internal successors, (1691), 38 states have internal predecessors, (1691), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:34:40,995 INFO L276 IsEmpty]: Start isEmpty. Operand 3421 states and 4558 transitions. [2025-02-06 08:34:41,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1740 [2025-02-06 08:34:41,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:34:41,011 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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] [2025-02-06 08:34:41,028 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-02-06 08:34:41,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:34:41,212 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:34:41,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:34:41,213 INFO L85 PathProgramCache]: Analyzing trace with hash -87582377, now seen corresponding path program 2 times [2025-02-06 08:34:41,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:34:41,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791216637] [2025-02-06 08:34:41,214 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:34:41,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:34:41,599 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1739 statements into 2 equivalence classes. [2025-02-06 08:34:41,607 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 74 of 1739 statements. [2025-02-06 08:34:41,607 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 08:34:41,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:41,830 INFO L134 CoverageAnalysis]: Checked inductivity of 17331 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17331 trivial. 0 not checked. [2025-02-06 08:34:41,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:34:41,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791216637] [2025-02-06 08:34:41,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791216637] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:34:41,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:34:41,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:34:41,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843828385] [2025-02-06 08:34:41,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:34:41,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:34:41,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:34:41,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:34:41,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:34:41,832 INFO L87 Difference]: Start difference. First operand 3421 states and 4558 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:34:42,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:34:42,084 INFO L93 Difference]: Finished difference Result 3828 states and 5109 transitions. [2025-02-06 08:34:42,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:34:42,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 1739 [2025-02-06 08:34:42,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:34:42,092 INFO L225 Difference]: With dead ends: 3828 [2025-02-06 08:34:42,092 INFO L226 Difference]: Without dead ends: 3421 [2025-02-06 08:34:42,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:34:42,094 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 17 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:34:42,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 959 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:34:42,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3421 states. [2025-02-06 08:34:42,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3421 to 3421. [2025-02-06 08:34:42,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3421 states, 3393 states have (on average 1.3283230179781904) internal successors, (4507), 3394 states have internal predecessors, (4507), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 08:34:42,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3421 states to 3421 states and 4555 transitions. [2025-02-06 08:34:42,158 INFO L78 Accepts]: Start accepts. Automaton has 3421 states and 4555 transitions. Word has length 1739 [2025-02-06 08:34:42,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:34:42,159 INFO L471 AbstractCegarLoop]: Abstraction has 3421 states and 4555 transitions. [2025-02-06 08:34:42,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:34:42,160 INFO L276 IsEmpty]: Start isEmpty. Operand 3421 states and 4555 transitions. [2025-02-06 08:34:42,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1740 [2025-02-06 08:34:42,174 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:34:42,174 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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] [2025-02-06 08:34:42,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 08:34:42,175 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:34:42,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:34:42,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1186378850, now seen corresponding path program 1 times [2025-02-06 08:34:42,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:34:42,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547581902] [2025-02-06 08:34:42,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:42,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:34:42,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1739 statements into 1 equivalence classes. [2025-02-06 08:34:43,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1739 of 1739 statements. [2025-02-06 08:34:43,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:43,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:45,641 INFO L134 CoverageAnalysis]: Checked inductivity of 17331 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17331 trivial. 0 not checked. [2025-02-06 08:34:45,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:34:45,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547581902] [2025-02-06 08:34:45,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547581902] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:34:45,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:34:45,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 08:34:45,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197913360] [2025-02-06 08:34:45,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:34:45,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:34:45,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:34:45,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:34:45,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:34:45,643 INFO L87 Difference]: Start difference. First operand 3421 states and 4555 transitions. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:34:45,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:34:45,963 INFO L93 Difference]: Finished difference Result 3843 states and 5127 transitions. [2025-02-06 08:34:45,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:34:45,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 1739 [2025-02-06 08:34:45,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:34:45,971 INFO L225 Difference]: With dead ends: 3843 [2025-02-06 08:34:45,971 INFO L226 Difference]: Without dead ends: 3436 [2025-02-06 08:34:45,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:34:45,973 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 14 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1808 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:34:45,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1808 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:34:45,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3436 states. [2025-02-06 08:34:46,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3436 to 3433. [2025-02-06 08:34:46,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3433 states, 3405 states have (on average 1.3280469897209985) internal successors, (4522), 3406 states have internal predecessors, (4522), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 08:34:46,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3433 states to 3433 states and 4570 transitions. [2025-02-06 08:34:46,075 INFO L78 Accepts]: Start accepts. Automaton has 3433 states and 4570 transitions. Word has length 1739 [2025-02-06 08:34:46,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:34:46,077 INFO L471 AbstractCegarLoop]: Abstraction has 3433 states and 4570 transitions. [2025-02-06 08:34:46,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:34:46,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3433 states and 4570 transitions. [2025-02-06 08:34:46,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1741 [2025-02-06 08:34:46,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:34:46,110 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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] [2025-02-06 08:34:46,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 08:34:46,110 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:34:46,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:34:46,112 INFO L85 PathProgramCache]: Analyzing trace with hash -305252793, now seen corresponding path program 1 times [2025-02-06 08:34:46,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:34:46,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141689511] [2025-02-06 08:34:46,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:46,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:34:46,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1740 statements into 1 equivalence classes. [2025-02-06 08:34:47,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1740 of 1740 statements. [2025-02-06 08:34:47,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:47,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:49,398 INFO L134 CoverageAnalysis]: Checked inductivity of 17331 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17331 trivial. 0 not checked. [2025-02-06 08:34:49,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:34:49,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141689511] [2025-02-06 08:34:49,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141689511] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:34:49,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:34:49,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:34:49,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725982351] [2025-02-06 08:34:49,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:34:49,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:34:49,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:34:49,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:34:49,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:34:49,402 INFO L87 Difference]: Start difference. First operand 3433 states and 4570 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:34:49,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:34:49,671 INFO L93 Difference]: Finished difference Result 3861 states and 5148 transitions. [2025-02-06 08:34:49,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:34:49,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 1740 [2025-02-06 08:34:49,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:34:49,679 INFO L225 Difference]: With dead ends: 3861 [2025-02-06 08:34:49,679 INFO L226 Difference]: Without dead ends: 3442 [2025-02-06 08:34:49,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:34:49,682 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 8 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1527 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:34:49,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1527 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:34:49,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2025-02-06 08:34:49,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 3442. [2025-02-06 08:34:49,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3442 states, 3414 states have (on average 1.3271821909783246) internal successors, (4531), 3415 states have internal predecessors, (4531), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 08:34:49,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3442 states to 3442 states and 4579 transitions. [2025-02-06 08:34:49,750 INFO L78 Accepts]: Start accepts. Automaton has 3442 states and 4579 transitions. Word has length 1740 [2025-02-06 08:34:49,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:34:49,751 INFO L471 AbstractCegarLoop]: Abstraction has 3442 states and 4579 transitions. [2025-02-06 08:34:49,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:34:49,751 INFO L276 IsEmpty]: Start isEmpty. Operand 3442 states and 4579 transitions. [2025-02-06 08:34:49,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1741 [2025-02-06 08:34:49,765 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:34:49,766 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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] [2025-02-06 08:34:49,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 08:34:49,766 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:34:49,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:34:49,767 INFO L85 PathProgramCache]: Analyzing trace with hash -985202261, now seen corresponding path program 1 times [2025-02-06 08:34:49,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:34:49,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444171633] [2025-02-06 08:34:49,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:49,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:34:50,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1740 statements into 1 equivalence classes. [2025-02-06 08:34:50,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1740 of 1740 statements. [2025-02-06 08:34:50,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:50,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 17331 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17331 trivial. 0 not checked. [2025-02-06 08:34:54,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:34:54,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444171633] [2025-02-06 08:34:54,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444171633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:34:54,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:34:54,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 08:34:54,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272836960] [2025-02-06 08:34:54,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:34:54,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 08:34:54,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:34:54,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 08:34:54,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:34:54,167 INFO L87 Difference]: Start difference. First operand 3442 states and 4579 transitions. Second operand has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:34:54,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:34:54,589 INFO L93 Difference]: Finished difference Result 3909 states and 5214 transitions. [2025-02-06 08:34:54,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:34:54,589 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 1740 [2025-02-06 08:34:54,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:34:54,595 INFO L225 Difference]: With dead ends: 3909 [2025-02-06 08:34:54,596 INFO L226 Difference]: Without dead ends: 3481 [2025-02-06 08:34:54,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 08:34:54,597 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 33 mSDsluCounter, 2104 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 2454 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 08:34:54,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 2454 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 08:34:54,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3481 states. [2025-02-06 08:34:54,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3481 to 3472. [2025-02-06 08:34:54,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3472 states, 3444 states have (on average 1.3278164924506388) internal successors, (4573), 3445 states have internal predecessors, (4573), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 08:34:54,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 4621 transitions. [2025-02-06 08:34:54,651 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 4621 transitions. Word has length 1740 [2025-02-06 08:34:54,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:34:54,652 INFO L471 AbstractCegarLoop]: Abstraction has 3472 states and 4621 transitions. [2025-02-06 08:34:54,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:34:54,653 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 4621 transitions. [2025-02-06 08:34:54,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1741 [2025-02-06 08:34:54,667 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:34:54,668 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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] [2025-02-06 08:34:54,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 08:34:54,668 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:34:54,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:34:54,669 INFO L85 PathProgramCache]: Analyzing trace with hash -197000217, now seen corresponding path program 1 times [2025-02-06 08:34:54,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:34:54,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878757571] [2025-02-06 08:34:54,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:54,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:34:55,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1740 statements into 1 equivalence classes. [2025-02-06 08:34:55,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1740 of 1740 statements. [2025-02-06 08:34:55,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:55,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:37,111 INFO L134 CoverageAnalysis]: Checked inductivity of 17331 backedges. 0 proven. 17327 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:35:37,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:37,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878757571] [2025-02-06 08:35:37,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878757571] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:35:37,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540988370] [2025-02-06 08:35:37,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:37,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:35:37,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:35:37,115 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:35:37,116 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