./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-1.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 8d4416b38cd75f122474354d64a020f92e3751959548582c6308a6e879679f77 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:01:31,568 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:01:31,629 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 05:01:31,635 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:01:31,635 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:01:31,657 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:01:31,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:01:31,659 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:01:31,659 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 05:01:31,659 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 05:01:31,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:01:31,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:01:31,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:01:31,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:01:31,661 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:01:31,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:01:31,661 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:01:31,661 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:01:31,661 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:01:31,661 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:01:31,661 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:01:31,661 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:01:31,662 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:01:31,662 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:01:31,662 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:01:31,662 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:01:31,662 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:01:31,662 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:01:31,662 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:01:31,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:01:31,662 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 05:01:31,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:01:31,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:01:31,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:01:31,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:01:31,663 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:01:31,663 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:01:31,663 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:01:31,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:01:31,663 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:01:31,663 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:01:31,664 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:01:31,664 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:01:31,664 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 -> 8d4416b38cd75f122474354d64a020f92e3751959548582c6308a6e879679f77 [2025-02-08 05:01:31,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:01:31,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:01:31,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:01:31,877 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:01:31,877 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:01:31,878 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_SAX_test4-1.i [2025-02-08 05:01:33,089 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3f20d562/fbddeb5cd72344759d91da9c0574dc28/FLAGf40a60432 [2025-02-08 05:01:33,449 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:01:33,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-1.i [2025-02-08 05:01:33,467 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3f20d562/fbddeb5cd72344759d91da9c0574dc28/FLAGf40a60432 [2025-02-08 05:01:33,484 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3f20d562/fbddeb5cd72344759d91da9c0574dc28 [2025-02-08 05:01:33,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:01:33,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:01:33,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:01:33,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:01:33,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:01:33,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:01:33" (1/1) ... [2025-02-08 05:01:33,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35585358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:01:33, skipping insertion in model container [2025-02-08 05:01:33,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:01:33" (1/1) ... [2025-02-08 05:01:33,530 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:01:33,815 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_SAX_test4-1.i[33021,33034] [2025-02-08 05:01:33,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:01:33,929 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:01:33,960 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_SAX_test4-1.i[33021,33034] [2025-02-08 05:01:34,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:01:34,032 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:01:34,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:01:34 WrapperNode [2025-02-08 05:01:34,032 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:01:34,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:01:34,034 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:01:34,034 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:01:34,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:01:34" (1/1) ... [2025-02-08 05:01:34,058 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:01:34" (1/1) ... [2025-02-08 05:01:34,097 INFO L138 Inliner]: procedures = 176, calls = 335, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1540 [2025-02-08 05:01:34,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:01:34,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:01:34,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:01:34,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:01:34,115 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:01:34" (1/1) ... [2025-02-08 05:01:34,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:01:34" (1/1) ... [2025-02-08 05:01:34,129 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:01:34" (1/1) ... [2025-02-08 05:01:34,200 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2025-02-08 05:01:34,201 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:01:34" (1/1) ... [2025-02-08 05:01:34,203 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:01:34" (1/1) ... [2025-02-08 05:01:34,248 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:01:34" (1/1) ... [2025-02-08 05:01:34,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:01:34" (1/1) ... [2025-02-08 05:01:34,257 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:01:34" (1/1) ... [2025-02-08 05:01:34,264 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:01:34" (1/1) ... [2025-02-08 05:01:34,275 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:01:34,276 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:01:34,277 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:01:34,277 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:01:34,278 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:01:34" (1/1) ... [2025-02-08 05:01:34,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:01:34,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:01:34,305 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-08 05:01:34,312 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-08 05:01:34,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 05:01:34,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 05:01:34,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 05:01:34,329 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 05:01:34,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 05:01:34,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 05:01:34,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 05:01:34,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 05:01:34,330 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 05:01:34,330 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 05:01:34,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:01:34,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:01:34,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 05:01:34,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 05:01:34,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 05:01:34,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 05:01:34,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:01:34,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 05:01:34,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 05:01:34,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:01:34,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:01:34,513 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:01:34,515 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:01:35,767 INFO L? ?]: Removed 384 outVars from TransFormulas that were not future-live. [2025-02-08 05:01:35,767 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:01:35,805 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:01:35,805 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-08 05:01:35,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:01:35 BoogieIcfgContainer [2025-02-08 05:01:35,806 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:01:35,807 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:01:35,808 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:01:35,811 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:01:35,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:01:33" (1/3) ... [2025-02-08 05:01:35,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4694f1e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:01:35, skipping insertion in model container [2025-02-08 05:01:35,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:01:34" (2/3) ... [2025-02-08 05:01:35,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4694f1e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:01:35, skipping insertion in model container [2025-02-08 05:01:35,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:01:35" (3/3) ... [2025-02-08 05:01:35,813 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test4-1.i [2025-02-08 05:01:35,824 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:01:35,825 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test4-1.i that has 4 procedures, 419 locations, 1 initial locations, 36 loop locations, and 1 error locations. [2025-02-08 05:01:35,875 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:01:35,883 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;@5ee3b4e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:01:35,883 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 05:01:35,887 INFO L276 IsEmpty]: Start isEmpty. Operand has 415 states, 394 states have (on average 1.619289340101523) internal successors, (638), 405 states have internal predecessors, (638), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-08 05:01:35,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 05:01:35,891 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:01:35,892 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:01:35,892 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 05:01:35,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:01:35,896 INFO L85 PathProgramCache]: Analyzing trace with hash -296579657, now seen corresponding path program 1 times [2025-02-08 05:01:35,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:01:35,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057283683] [2025-02-08 05:01:35,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:01:35,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:01:35,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 05:01:35,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 05:01:35,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:01:35,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:01:36,017 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-08 05:01:36,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:01:36,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057283683] [2025-02-08 05:01:36,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057283683] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:01:36,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:01:36,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:01:36,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823264311] [2025-02-08 05:01:36,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:01:36,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:01:36,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:01:36,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:01:36,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:01:36,046 INFO L87 Difference]: Start difference. First operand has 415 states, 394 states have (on average 1.619289340101523) internal successors, (638), 405 states have internal predecessors, (638), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:01:36,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:01:36,258 INFO L93 Difference]: Finished difference Result 1209 states and 1965 transitions. [2025-02-08 05:01:36,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:01:36,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 05:01:36,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:01:36,270 INFO L225 Difference]: With dead ends: 1209 [2025-02-08 05:01:36,271 INFO L226 Difference]: Without dead ends: 790 [2025-02-08 05:01:36,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-08 05:01:36,276 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 541 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:01:36,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1167 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:01:36,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2025-02-08 05:01:36,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 411. [2025-02-08 05:01:36,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 393 states have (on average 1.4580152671755726) internal successors, (573), 402 states have internal predecessors, (573), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 05:01:36,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 595 transitions. [2025-02-08 05:01:36,326 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 595 transitions. Word has length 8 [2025-02-08 05:01:36,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:01:36,326 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 595 transitions. [2025-02-08 05:01:36,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:01:36,327 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 595 transitions. [2025-02-08 05:01:36,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-08 05:01:36,331 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:01:36,331 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:01:36,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:01:36,332 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 05:01:36,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:01:36,332 INFO L85 PathProgramCache]: Analyzing trace with hash 278561608, now seen corresponding path program 1 times [2025-02-08 05:01:36,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:01:36,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749552814] [2025-02-08 05:01:36,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:01:36,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:01:36,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-08 05:01:36,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 05:01:36,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:01:36,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:01:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:01:36,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:01:36,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749552814] [2025-02-08 05:01:36,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749552814] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:01:36,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:01:36,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:01:36,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313160278] [2025-02-08 05:01:36,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:01:36,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:01:36,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:01:36,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:01:36,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:01:36,884 INFO L87 Difference]: Start difference. First operand 411 states and 595 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:01:37,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:01:37,024 INFO L93 Difference]: Finished difference Result 823 states and 1191 transitions. [2025-02-08 05:01:37,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:01:37,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2025-02-08 05:01:37,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:01:37,027 INFO L225 Difference]: With dead ends: 823 [2025-02-08 05:01:37,027 INFO L226 Difference]: Without dead ends: 414 [2025-02-08 05:01:37,028 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-08 05:01:37,029 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 106 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:01:37,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1485 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:01:37,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-02-08 05:01:37,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 411. [2025-02-08 05:01:37,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 393 states have (on average 1.440203562340967) internal successors, (566), 402 states have internal predecessors, (566), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 05:01:37,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 588 transitions. [2025-02-08 05:01:37,041 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 588 transitions. Word has length 152 [2025-02-08 05:01:37,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:01:37,042 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 588 transitions. [2025-02-08 05:01:37,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:01:37,042 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 588 transitions. [2025-02-08 05:01:37,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-08 05:01:37,046 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:01:37,046 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:01:37,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:01:37,046 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 05:01:37,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:01:37,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1006971681, now seen corresponding path program 1 times [2025-02-08 05:01:37,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:01:37,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86287268] [2025-02-08 05:01:37,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:01:37,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:01:37,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-08 05:01:37,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 05:01:37,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:01:37,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:01:37,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:01:37,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:01:37,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86287268] [2025-02-08 05:01:37,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86287268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:01:37,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:01:37,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:01:37,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449917577] [2025-02-08 05:01:37,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:01:37,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:01:37,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:01:37,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:01:37,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:01:37,342 INFO L87 Difference]: Start difference. First operand 411 states and 588 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:01:37,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:01:37,466 INFO L93 Difference]: Finished difference Result 772 states and 1099 transitions. [2025-02-08 05:01:37,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:01:37,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2025-02-08 05:01:37,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:01:37,469 INFO L225 Difference]: With dead ends: 772 [2025-02-08 05:01:37,469 INFO L226 Difference]: Without dead ends: 363 [2025-02-08 05:01:37,470 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-08 05:01:37,470 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 9 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:01:37,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1352 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:01:37,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-02-08 05:01:37,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2025-02-08 05:01:37,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 345 states have (on average 1.4086956521739131) internal successors, (486), 354 states have internal predecessors, (486), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 05:01:37,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 508 transitions. [2025-02-08 05:01:37,486 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 508 transitions. Word has length 152 [2025-02-08 05:01:37,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:01:37,486 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 508 transitions. [2025-02-08 05:01:37,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:01:37,486 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 508 transitions. [2025-02-08 05:01:37,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-08 05:01:37,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:01:37,490 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:01:37,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:01:37,491 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 05:01:37,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:01:37,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1478092030, now seen corresponding path program 1 times [2025-02-08 05:01:37,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:01:37,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615522142] [2025-02-08 05:01:37,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:01:37,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:01:37,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-08 05:01:37,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 05:01:37,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:01:37,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:01:37,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:01:37,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:01:37,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615522142] [2025-02-08 05:01:37,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615522142] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:01:37,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:01:37,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:01:37,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850950072] [2025-02-08 05:01:37,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:01:37,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:01:37,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:01:37,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:01:37,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:01:37,725 INFO L87 Difference]: Start difference. First operand 363 states and 508 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:01:37,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:01:37,818 INFO L93 Difference]: Finished difference Result 804 states and 1122 transitions. [2025-02-08 05:01:37,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:01:37,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2025-02-08 05:01:37,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:01:37,820 INFO L225 Difference]: With dead ends: 804 [2025-02-08 05:01:37,820 INFO L226 Difference]: Without dead ends: 443 [2025-02-08 05:01:37,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-08 05:01:37,821 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 54 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:01:37,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 935 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:01:37,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-02-08 05:01:37,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2025-02-08 05:01:37,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 425 states have (on average 1.3952941176470588) internal successors, (593), 434 states have internal predecessors, (593), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 05:01:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 615 transitions. [2025-02-08 05:01:37,839 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 615 transitions. Word has length 152 [2025-02-08 05:01:37,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:01:37,843 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 615 transitions. [2025-02-08 05:01:37,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:01:37,843 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 615 transitions. [2025-02-08 05:01:37,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-08 05:01:37,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:01:37,844 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:01:37,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:01:37,845 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 05:01:37,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:01:37,845 INFO L85 PathProgramCache]: Analyzing trace with hash 390371253, now seen corresponding path program 1 times [2025-02-08 05:01:37,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:01:37,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56234422] [2025-02-08 05:01:37,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:01:37,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:01:37,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-08 05:01:37,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-08 05:01:37,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:01:37,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:01:38,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:01:38,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:01:38,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56234422] [2025-02-08 05:01:38,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56234422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:01:38,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:01:38,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:01:38,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106570538] [2025-02-08 05:01:38,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:01:38,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:01:38,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:01:38,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:01:38,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:01:38,185 INFO L87 Difference]: Start difference. First operand 443 states and 615 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:01:38,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:01:38,299 INFO L93 Difference]: Finished difference Result 762 states and 1055 transitions. [2025-02-08 05:01:38,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:01:38,300 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 167 [2025-02-08 05:01:38,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:01:38,302 INFO L225 Difference]: With dead ends: 762 [2025-02-08 05:01:38,302 INFO L226 Difference]: Without dead ends: 401 [2025-02-08 05:01:38,302 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-08 05:01:38,303 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 30 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:01:38,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1121 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:01:38,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-02-08 05:01:38,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2025-02-08 05:01:38,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 383 states have (on average 1.3472584856396868) internal successors, (516), 392 states have internal predecessors, (516), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 05:01:38,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 538 transitions. [2025-02-08 05:01:38,315 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 538 transitions. Word has length 167 [2025-02-08 05:01:38,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:01:38,316 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 538 transitions. [2025-02-08 05:01:38,316 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:01:38,316 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 538 transitions. [2025-02-08 05:01:38,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-08 05:01:38,320 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:01:38,321 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:01:38,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:01:38,321 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 05:01:38,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:01:38,321 INFO L85 PathProgramCache]: Analyzing trace with hash -2017682833, now seen corresponding path program 1 times [2025-02-08 05:01:38,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:01:38,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226593381] [2025-02-08 05:01:38,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:01:38,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:01:38,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-08 05:01:38,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-08 05:01:38,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:01:38,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:01:38,627 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:01:38,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:01:38,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226593381] [2025-02-08 05:01:38,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226593381] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:01:38,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:01:38,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:01:38,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066682784] [2025-02-08 05:01:38,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:01:38,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:01:38,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:01:38,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:01:38,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:01:38,629 INFO L87 Difference]: Start difference. First operand 401 states and 538 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:01:38,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:01:38,720 INFO L93 Difference]: Finished difference Result 864 states and 1163 transitions. [2025-02-08 05:01:38,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:01:38,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 167 [2025-02-08 05:01:38,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:01:38,723 INFO L225 Difference]: With dead ends: 864 [2025-02-08 05:01:38,723 INFO L226 Difference]: Without dead ends: 545 [2025-02-08 05:01:38,726 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-08 05:01:38,727 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 162 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:01:38,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 786 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:01:38,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-02-08 05:01:38,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-02-08 05:01:38,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 524 states have (on average 1.3454198473282444) internal successors, (705), 533 states have internal predecessors, (705), 19 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 05:01:38,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 733 transitions. [2025-02-08 05:01:38,753 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 733 transitions. Word has length 167 [2025-02-08 05:01:38,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:01:38,754 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 733 transitions. [2025-02-08 05:01:38,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:01:38,754 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 733 transitions. [2025-02-08 05:01:38,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-08 05:01:38,759 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:01:38,759 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:01:38,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:01:38,759 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 05:01:38,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:01:38,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1521601184, now seen corresponding path program 1 times [2025-02-08 05:01:38,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:01:38,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889552601] [2025-02-08 05:01:38,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:01:38,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:01:38,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-08 05:01:38,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-08 05:01:38,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:01:38,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:01:39,095 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 05:01:39,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:01:39,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889552601] [2025-02-08 05:01:39,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889552601] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:01:39,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844384586] [2025-02-08 05:01:39,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:01:39,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:01:39,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:01:39,103 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-08 05:01:39,104 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-08 05:01:39,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-08 05:01:39,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-08 05:01:39,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:01:39,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:01:39,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 05:01:39,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:01:39,690 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 05:01:39,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:01:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 05:01:39,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844384586] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:01:39,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:01:39,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 05:01:39,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191765434] [2025-02-08 05:01:39,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:01:39,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:01:39,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:01:39,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:01:39,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:01:39,906 INFO L87 Difference]: Start difference. First operand 545 states and 733 transitions. Second operand has 7 states, 7 states have (on average 67.85714285714286) internal successors, (475), 7 states have internal predecessors, (475), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-08 05:01:40,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:01:40,117 INFO L93 Difference]: Finished difference Result 1212 states and 1632 transitions. [2025-02-08 05:01:40,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:01:40,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 67.85714285714286) internal successors, (475), 7 states have internal predecessors, (475), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 182 [2025-02-08 05:01:40,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:01:40,122 INFO L225 Difference]: With dead ends: 1212 [2025-02-08 05:01:40,122 INFO L226 Difference]: Without dead ends: 1187 [2025-02-08 05:01:40,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:01:40,123 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 1732 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1748 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 05:01:40,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1748 Valid, 1595 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 05:01:40,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2025-02-08 05:01:40,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1187. [2025-02-08 05:01:40,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 1151 states have (on average 1.3353605560382276) internal successors, (1537), 1160 states have internal predecessors, (1537), 34 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-08 05:01:40,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1595 transitions. [2025-02-08 05:01:40,154 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1595 transitions. Word has length 182 [2025-02-08 05:01:40,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:01:40,154 INFO L471 AbstractCegarLoop]: Abstraction has 1187 states and 1595 transitions. [2025-02-08 05:01:40,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 67.85714285714286) internal successors, (475), 7 states have internal predecessors, (475), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-08 05:01:40,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1595 transitions. [2025-02-08 05:01:40,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2025-02-08 05:01:40,162 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:01:40,162 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:01:40,174 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-08 05:01:40,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:01:40,367 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 05:01:40,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:01:40,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1361768815, now seen corresponding path program 1 times [2025-02-08 05:01:40,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:01:40,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746973264] [2025-02-08 05:01:40,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:01:40,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:01:40,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 614 statements into 1 equivalence classes. [2025-02-08 05:01:40,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 614 of 614 statements. [2025-02-08 05:01:40,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:01:40,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:01:41,622 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 05:01:41,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:01:41,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746973264] [2025-02-08 05:01:41,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746973264] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:01:41,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233972130] [2025-02-08 05:01:41,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:01:41,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:01:41,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:01:41,628 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-08 05:01:41,630 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-08 05:01:42,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 614 statements into 1 equivalence classes. [2025-02-08 05:01:42,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 614 of 614 statements. [2025-02-08 05:01:42,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:01:42,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:01:42,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 3076 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 05:01:42,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:01:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 05:01:43,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:01:43,624 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 05:01:43,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233972130] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:01:43,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:01:43,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-08 05:01:43,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431795037] [2025-02-08 05:01:43,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:01:43,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 05:01:43,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:01:43,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 05:01:43,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 05:01:43,627 INFO L87 Difference]: Start difference. First operand 1187 states and 1595 transitions. Second operand has 13 states, 13 states have (on average 103.0) internal successors, (1339), 13 states have internal predecessors, (1339), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-08 05:01:44,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:01:44,144 INFO L93 Difference]: Finished difference Result 2952 states and 3975 transitions. [2025-02-08 05:01:44,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 05:01:44,145 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 103.0) internal successors, (1339), 13 states have internal predecessors, (1339), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 614 [2025-02-08 05:01:44,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:01:44,156 INFO L225 Difference]: With dead ends: 2952 [2025-02-08 05:01:44,157 INFO L226 Difference]: Without dead ends: 2927 [2025-02-08 05:01:44,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1233 GetRequests, 1222 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 05:01:44,158 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 4820 mSDsluCounter, 3439 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4872 SdHoareTripleChecker+Valid, 3951 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 05:01:44,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4872 Valid, 3951 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 05:01:44,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2025-02-08 05:01:44,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 2927. [2025-02-08 05:01:44,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2927 states, 2855 states have (on average 1.3327495621716288) internal successors, (3805), 2864 states have internal predecessors, (3805), 70 states have call successors, (70), 2 states have call predecessors, (70), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-08 05:01:44,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 3935 transitions. [2025-02-08 05:01:44,266 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 3935 transitions. Word has length 614 [2025-02-08 05:01:44,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:01:44,267 INFO L471 AbstractCegarLoop]: Abstraction has 2927 states and 3935 transitions. [2025-02-08 05:01:44,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 103.0) internal successors, (1339), 13 states have internal predecessors, (1339), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-08 05:01:44,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 3935 transitions. [2025-02-08 05:01:44,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1479 [2025-02-08 05:01:44,310 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:01:44,310 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:01:44,325 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-08 05:01:44,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:01:44,515 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 05:01:44,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:01:44,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1330187149, now seen corresponding path program 2 times [2025-02-08 05:01:44,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:01:44,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061525677] [2025-02-08 05:01:44,517 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:01:44,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:01:44,985 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1478 statements into 2 equivalence classes.