./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:03:14,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:03:14,924 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:03:14,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:03:14,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:03:14,952 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:03:14,953 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:03:14,953 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:03:14,953 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 05:03:14,954 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 05:03:14,954 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:03:14,955 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:03:14,955 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:03:14,955 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:03:14,955 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:03:14,956 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:03:14,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:03:14,956 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:03:14,956 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:03:14,956 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:03:14,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:03:14,956 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:03:14,956 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:03:14,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:03:14,956 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:03:14,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:03:14,956 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:03:14,956 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:03:14,957 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:03:14,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:03:14,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 05:03:14,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:03:14,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:03:14,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:03:14,957 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:03:14,958 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:03:14,958 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:03:14,958 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:03:14,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:03:14,958 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:03:14,958 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:03:14,958 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:03:14,958 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:03:14,958 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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2025-02-08 05:03:15,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:03:15,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:03:15,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:03:15,187 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:03:15,187 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:03:15,189 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_SFH_nondet_test1-2.i [2025-02-08 05:03:16,427 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ade434f78/3f154fc0f49e443b8ea1705b3f618e47/FLAG8175d6f8e [2025-02-08 05:03:16,806 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:03:16,806 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-2.i [2025-02-08 05:03:16,823 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ade434f78/3f154fc0f49e443b8ea1705b3f618e47/FLAG8175d6f8e [2025-02-08 05:03:17,015 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ade434f78/3f154fc0f49e443b8ea1705b3f618e47 [2025-02-08 05:03:17,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:03:17,018 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:03:17,020 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:03:17,020 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:03:17,023 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:03:17,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:03:17" (1/1) ... [2025-02-08 05:03:17,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c9b89d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:03:17, skipping insertion in model container [2025-02-08 05:03:17,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:03:17" (1/1) ... [2025-02-08 05:03:17,060 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:03:17,317 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_SFH_nondet_test1-2.i[33519,33532] [2025-02-08 05:03:17,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:03:17,411 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:03:17,435 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_SFH_nondet_test1-2.i[33519,33532] [2025-02-08 05:03:17,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:03:17,521 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:03:17,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:03:17 WrapperNode [2025-02-08 05:03:17,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:03:17,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:03:17,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:03:17,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:03:17,527 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:03:17" (1/1) ... [2025-02-08 05:03:17,553 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:03:17" (1/1) ... [2025-02-08 05:03:17,599 INFO L138 Inliner]: procedures = 176, calls = 220, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 930 [2025-02-08 05:03:17,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:03:17,599 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:03:17,603 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:03:17,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:03:17,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:03:17" (1/1) ... [2025-02-08 05:03:17,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:03:17" (1/1) ... [2025-02-08 05:03:17,615 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:03:17" (1/1) ... [2025-02-08 05:03:17,686 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 50 writes are split as follows [0, 50]. [2025-02-08 05:03:17,687 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:03:17" (1/1) ... [2025-02-08 05:03:17,687 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:03:17" (1/1) ... [2025-02-08 05:03:17,715 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:03:17" (1/1) ... [2025-02-08 05:03:17,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:03:17" (1/1) ... [2025-02-08 05:03:17,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:03:17" (1/1) ... [2025-02-08 05:03:17,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:03:17" (1/1) ... [2025-02-08 05:03:17,735 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:03:17,736 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:03:17,736 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:03:17,736 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:03:17,737 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:03:17" (1/1) ... [2025-02-08 05:03:17,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:03:17,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:03:17,771 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:03:17,780 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:03:17,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 05:03:17,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 05:03:17,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 05:03:17,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 05:03:17,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 05:03:17,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 05:03:17,797 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 05:03:17,797 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 05:03:17,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:03:17,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:03:17,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 05:03:17,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 05:03:17,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 05:03:17,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 05:03:17,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:03:17,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 05:03:17,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 05:03:17,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:03:17,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:03:17,954 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:03:17,956 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:03:19,745 INFO L? ?]: Removed 216 outVars from TransFormulas that were not future-live. [2025-02-08 05:03:19,746 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:03:19,784 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:03:19,785 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 05:03:19,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:03:19 BoogieIcfgContainer [2025-02-08 05:03:19,785 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:03:19,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:03:19,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:03:19,792 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:03:19,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:03:17" (1/3) ... [2025-02-08 05:03:19,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce466d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:03:19, skipping insertion in model container [2025-02-08 05:03:19,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:03:17" (2/3) ... [2025-02-08 05:03:19,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce466d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:03:19, skipping insertion in model container [2025-02-08 05:03:19,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:03:19" (3/3) ... [2025-02-08 05:03:19,794 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test1-2.i [2025-02-08 05:03:19,803 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:03:19,805 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_nondet_test1-2.i that has 3 procedures, 241 locations, 1 initial locations, 25 loop locations, and 1 error locations. [2025-02-08 05:03:19,850 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:03:19,858 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;@5ae289b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:03:19,859 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 05:03:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand has 237 states, 231 states have (on average 1.6103896103896105) internal successors, (372), 232 states have internal predecessors, (372), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:03:19,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 05:03:19,867 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:03:19,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 05:03:19,867 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 05:03:19,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:03:19,871 INFO L85 PathProgramCache]: Analyzing trace with hash 402037422, now seen corresponding path program 1 times [2025-02-08 05:03:19,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:03:19,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180330092] [2025-02-08 05:03:19,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:03:19,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:03:19,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 05:03:19,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 05:03:19,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:03:19,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:03:20,007 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:03:20,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:03:20,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180330092] [2025-02-08 05:03:20,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180330092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:03:20,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:03:20,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:03:20,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372999035] [2025-02-08 05:03:20,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:03:20,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:03:20,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:03:20,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:03:20,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:03:20,035 INFO L87 Difference]: Start difference. First operand has 237 states, 231 states have (on average 1.6103896103896105) internal successors, (372), 232 states have internal predecessors, (372), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:03:20,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:03:20,196 INFO L93 Difference]: Finished difference Result 665 states and 1066 transitions. [2025-02-08 05:03:20,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:03:20,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 05:03:20,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:03:20,206 INFO L225 Difference]: With dead ends: 665 [2025-02-08 05:03:20,208 INFO L226 Difference]: Without dead ends: 393 [2025-02-08 05:03:20,210 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:03:20,214 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 272 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:03:20,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 621 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:03:20,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-02-08 05:03:20,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 202. [2025-02-08 05:03:20,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 197 states have (on average 1.4416243654822336) internal successors, (284), 197 states have internal predecessors, (284), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:03:20,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 290 transitions. [2025-02-08 05:03:20,262 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 290 transitions. Word has length 5 [2025-02-08 05:03:20,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:03:20,263 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 290 transitions. [2025-02-08 05:03:20,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:03:20,263 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 290 transitions. [2025-02-08 05:03:20,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-08 05:03:20,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:03:20,266 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] [2025-02-08 05:03:20,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:03:20,267 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 05:03:20,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:03:20,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1776368332, now seen corresponding path program 1 times [2025-02-08 05:03:20,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:03:20,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594848469] [2025-02-08 05:03:20,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:03:20,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:03:20,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 05:03:20,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 05:03:20,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:03:20,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:03:20,634 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:03:20,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:03:20,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594848469] [2025-02-08 05:03:20,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594848469] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:03:20,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:03:20,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:03:20,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939488621] [2025-02-08 05:03:20,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:03:20,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:03:20,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:03:20,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:03:20,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:03:20,636 INFO L87 Difference]: Start difference. First operand 202 states and 290 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:03:20,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:03:20,763 INFO L93 Difference]: Finished difference Result 405 states and 581 transitions. [2025-02-08 05:03:20,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:03:20,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-08 05:03:20,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:03:20,765 INFO L225 Difference]: With dead ends: 405 [2025-02-08 05:03:20,765 INFO L226 Difference]: Without dead ends: 205 [2025-02-08 05:03:20,765 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:03:20,766 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 105 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:03:20,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 636 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:03:20,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-08 05:03:20,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2025-02-08 05:03:20,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 197 states have (on average 1.4060913705583757) internal successors, (277), 197 states have internal predecessors, (277), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:03:20,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 283 transitions. [2025-02-08 05:03:20,773 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 283 transitions. Word has length 79 [2025-02-08 05:03:20,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:03:20,773 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 283 transitions. [2025-02-08 05:03:20,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:03:20,773 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 283 transitions. [2025-02-08 05:03:20,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-08 05:03:20,777 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:03:20,778 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] [2025-02-08 05:03:20,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:03:20,778 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 05:03:20,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:03:20,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1738388294, now seen corresponding path program 1 times [2025-02-08 05:03:20,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:03:20,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506774181] [2025-02-08 05:03:20,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:03:20,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:03:20,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 05:03:20,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 05:03:20,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:03:20,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:03:20,978 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:03:20,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:03:20,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506774181] [2025-02-08 05:03:20,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506774181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:03:20,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:03:20,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:03:20,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445777881] [2025-02-08 05:03:20,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:03:20,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:03:20,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:03:20,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:03:20,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:03:20,979 INFO L87 Difference]: Start difference. First operand 202 states and 283 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:03:21,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:03:21,064 INFO L93 Difference]: Finished difference Result 530 states and 752 transitions. [2025-02-08 05:03:21,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:03:21,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-08 05:03:21,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:03:21,066 INFO L225 Difference]: With dead ends: 530 [2025-02-08 05:03:21,066 INFO L226 Difference]: Without dead ends: 330 [2025-02-08 05:03:21,067 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:03:21,067 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 134 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:03:21,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 510 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:03:21,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-02-08 05:03:21,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2025-02-08 05:03:21,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 325 states have (on average 1.4276923076923076) internal successors, (464), 325 states have internal predecessors, (464), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:03:21,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 470 transitions. [2025-02-08 05:03:21,079 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 470 transitions. Word has length 79 [2025-02-08 05:03:21,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:03:21,079 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 470 transitions. [2025-02-08 05:03:21,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:03:21,079 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 470 transitions. [2025-02-08 05:03:21,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-08 05:03:21,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:03:21,080 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] [2025-02-08 05:03:21,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:03:21,081 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 05:03:21,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:03:21,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1825198253, now seen corresponding path program 1 times [2025-02-08 05:03:21,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:03:21,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152692090] [2025-02-08 05:03:21,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:03:21,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:03:21,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 05:03:21,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 05:03:21,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:03:21,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:03:21,279 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:03:21,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:03:21,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152692090] [2025-02-08 05:03:21,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152692090] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:03:21,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591811922] [2025-02-08 05:03:21,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:03:21,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:03:21,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:03:21,282 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:03:21,283 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:03:21,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 05:03:21,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 05:03:21,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:03:21,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:03:21,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 05:03:21,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:03:21,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:03:21,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:03:21,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:03:21,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591811922] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:03:21,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:03:21,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-08 05:03:21,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908338709] [2025-02-08 05:03:21,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:03:21,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:03:21,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:03:21,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:03:21,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:03:21,742 INFO L87 Difference]: Start difference. First operand 330 states and 470 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 05:03:21,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:03:21,916 INFO L93 Difference]: Finished difference Result 780 states and 1103 transitions. [2025-02-08 05:03:21,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:03:21,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 94 [2025-02-08 05:03:21,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:03:21,919 INFO L225 Difference]: With dead ends: 780 [2025-02-08 05:03:21,920 INFO L226 Difference]: Without dead ends: 776 [2025-02-08 05:03:21,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:03:21,920 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 1374 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:03:21,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1382 Valid, 1041 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:03:21,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2025-02-08 05:03:21,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 776. [2025-02-08 05:03:21,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 762 states have (on average 1.4068241469816274) internal successors, (1072), 762 states have internal predecessors, (1072), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 05:03:21,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1096 transitions. [2025-02-08 05:03:21,947 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1096 transitions. Word has length 94 [2025-02-08 05:03:21,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:03:21,948 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1096 transitions. [2025-02-08 05:03:21,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 05:03:21,948 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1096 transitions. [2025-02-08 05:03:21,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-02-08 05:03:21,953 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:03:21,954 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, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:03:21,963 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:03:22,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:03:22,155 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 05:03:22,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:03:22,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2072967569, now seen corresponding path program 1 times [2025-02-08 05:03:22,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:03:22,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564570297] [2025-02-08 05:03:22,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:03:22,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:03:22,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-02-08 05:03:22,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-02-08 05:03:22,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:03:22,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:03:22,902 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 4 proven. 322 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-02-08 05:03:22,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:03:22,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564570297] [2025-02-08 05:03:22,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564570297] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:03:22,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555834726] [2025-02-08 05:03:22,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:03:22,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:03:22,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:03:22,905 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:03:22,908 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:03:23,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-02-08 05:03:23,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-02-08 05:03:23,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:03:23,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:03:23,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 1622 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 05:03:23,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:03:23,716 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:03:23,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:03:24,084 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:03:24,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555834726] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:03:24,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:03:24,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-02-08 05:03:24,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180821436] [2025-02-08 05:03:24,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:03:24,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 05:03:24,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:03:24,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 05:03:24,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-02-08 05:03:24,087 INFO L87 Difference]: Start difference. First operand 776 states and 1096 transitions. Second operand has 16 states, 16 states have (on average 51.375) internal successors, (822), 16 states have internal predecessors, (822), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 05:03:25,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:03:25,408 INFO L93 Difference]: Finished difference Result 2302 states and 3272 transitions. [2025-02-08 05:03:25,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 05:03:25,408 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 51.375) internal successors, (822), 16 states have internal predecessors, (822), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 316 [2025-02-08 05:03:25,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:03:25,415 INFO L225 Difference]: With dead ends: 2302 [2025-02-08 05:03:25,415 INFO L226 Difference]: Without dead ends: 1848 [2025-02-08 05:03:25,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 622 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=312, Invalid=618, Unknown=0, NotChecked=0, Total=930 [2025-02-08 05:03:25,417 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 11257 mSDsluCounter, 2174 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11257 SdHoareTripleChecker+Valid, 2589 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:03:25,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11257 Valid, 2589 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 05:03:25,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2025-02-08 05:03:25,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1848. [2025-02-08 05:03:25,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1848 states, 1834 states have (on average 1.416030534351145) internal successors, (2597), 1834 states have internal predecessors, (2597), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 05:03:25,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2621 transitions. [2025-02-08 05:03:25,488 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2621 transitions. Word has length 316 [2025-02-08 05:03:25,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:03:25,489 INFO L471 AbstractCegarLoop]: Abstraction has 1848 states and 2621 transitions. [2025-02-08 05:03:25,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 51.375) internal successors, (822), 16 states have internal predecessors, (822), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 05:03:25,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2621 transitions. [2025-02-08 05:03:25,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 762 [2025-02-08 05:03:25,507 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:03:25,508 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, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:03:25,519 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:03:25,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:03:25,712 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 05:03:25,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:03:25,713 INFO L85 PathProgramCache]: Analyzing trace with hash -721563384, now seen corresponding path program 1 times [2025-02-08 05:03:25,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:03:25,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445263310] [2025-02-08 05:03:25,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:03:25,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:03:25,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 761 statements into 1 equivalence classes.