./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:28:56,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:28:56,057 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 21:28:56,062 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:28:56,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:28:56,084 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:28:56,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:28:56,086 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:28:56,086 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 21:28:56,086 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 21:28:56,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:28:56,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:28:56,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:28:56,088 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:28:56,088 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:28:56,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:28:56,088 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:28:56,088 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:28:56,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:28:56,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:28:56,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:28:56,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:28:56,089 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:28:56,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:28:56,089 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:28:56,089 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:28:56,089 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:28:56,089 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:28:56,089 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:28:56,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:28:56,089 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 21:28:56,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:28:56,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:28:56,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:28:56,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:28:56,089 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:28:56,089 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:28:56,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:28:56,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:28:56,089 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:28:56,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:28:56,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:28:56,090 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:28:56,090 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/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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2025-03-08 21:28:56,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:28:56,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:28:56,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:28:56,307 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:28:56,307 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:28:56,308 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-1.i [2025-03-08 21:28:57,413 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad3db582d/72a8c3ed2ae94c91b8e63700c5ad3f5b/FLAGcc62a9b34 [2025-03-08 21:28:57,758 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:28:57,758 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-1.i [2025-03-08 21:28:57,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad3db582d/72a8c3ed2ae94c91b8e63700c5ad3f5b/FLAGcc62a9b34 [2025-03-08 21:28:57,987 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad3db582d/72a8c3ed2ae94c91b8e63700c5ad3f5b [2025-03-08 21:28:57,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:28:57,990 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:28:57,990 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:28:57,990 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:28:57,993 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:28:57,994 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:28:57" (1/1) ... [2025-03-08 21:28:57,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f4a6b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:28:57, skipping insertion in model container [2025-03-08 21:28:57,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:28:57" (1/1) ... [2025-03-08 21:28:58,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:28:58,275 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-1.i[33519,33532] [2025-03-08 21:28:58,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:28:58,349 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:28:58,379 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-1.i[33519,33532] [2025-03-08 21:28:58,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:28:58,443 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:28:58,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:28:58 WrapperNode [2025-03-08 21:28:58,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:28:58,444 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:28:58,444 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:28:58,444 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:28:58,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:28:58" (1/1) ... [2025-03-08 21:28:58,462 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:28:58" (1/1) ... [2025-03-08 21:28:58,491 INFO L138 Inliner]: procedures = 176, calls = 169, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 771 [2025-03-08 21:28:58,492 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:28:58,492 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:28:58,492 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:28:58,492 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:28:58,498 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:28:58" (1/1) ... [2025-03-08 21:28:58,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:28:58" (1/1) ... [2025-03-08 21:28:58,503 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:28:58" (1/1) ... [2025-03-08 21:28:58,535 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2025-03-08 21:28:58,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:28:58" (1/1) ... [2025-03-08 21:28:58,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:28:58" (1/1) ... [2025-03-08 21:28:58,552 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:28:58" (1/1) ... [2025-03-08 21:28:58,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:28:58" (1/1) ... [2025-03-08 21:28:58,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:28:58" (1/1) ... [2025-03-08 21:28:58,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:28:58" (1/1) ... [2025-03-08 21:28:58,570 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:28:58,575 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:28:58,575 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:28:58,575 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:28:58,575 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:28:58" (1/1) ... [2025-03-08 21:28:58,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:28:58,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:28:58,598 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 21:28:58,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 21:28:58,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 21:28:58,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 21:28:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 21:28:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 21:28:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-08 21:28:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-08 21:28:58,619 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-08 21:28:58,619 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-08 21:28:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 21:28:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:28:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 21:28:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 21:28:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 21:28:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 21:28:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 21:28:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 21:28:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 21:28:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:28:58,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:28:58,739 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:28:58,741 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:28:59,417 INFO L? ?]: Removed 194 outVars from TransFormulas that were not future-live. [2025-03-08 21:28:59,417 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:28:59,447 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:28:59,448 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 21:28:59,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:28:59 BoogieIcfgContainer [2025-03-08 21:28:59,449 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:28:59,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:28:59,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:28:59,454 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:28:59,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:28:57" (1/3) ... [2025-03-08 21:28:59,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105acdc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:28:59, skipping insertion in model container [2025-03-08 21:28:59,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:28:58" (2/3) ... [2025-03-08 21:28:59,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105acdc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:28:59, skipping insertion in model container [2025-03-08 21:28:59,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:28:59" (3/3) ... [2025-03-08 21:28:59,456 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test1-1.i [2025-03-08 21:28:59,466 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:28:59,467 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_nondet_test1-1.i that has 3 procedures, 209 locations, 1 initial locations, 19 loop locations, and 1 error locations. [2025-03-08 21:28:59,505 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:28:59,513 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;@7c169a71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:28:59,513 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 21:28:59,518 INFO L276 IsEmpty]: Start isEmpty. Operand has 205 states, 199 states have (on average 1.6030150753768844) internal successors, (319), 200 states have internal predecessors, (319), 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-03-08 21:28:59,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 21:28:59,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:28:59,522 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 21:28:59,522 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:28:59,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:28:59,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1683917923, now seen corresponding path program 1 times [2025-03-08 21:28:59,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:28:59,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365747349] [2025-03-08 21:28:59,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:28:59,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:28:59,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 21:28:59,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 21:28:59,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:28:59,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:28:59,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:28:59,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:28:59,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365747349] [2025-03-08 21:28:59,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365747349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:28:59,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:28:59,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:28:59,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461907456] [2025-03-08 21:28:59,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:28:59,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:28:59,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:28:59,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:28:59,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:28:59,695 INFO L87 Difference]: Start difference. First operand has 205 states, 199 states have (on average 1.6030150753768844) internal successors, (319), 200 states have internal predecessors, (319), 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 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-03-08 21:28:59,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:28:59,826 INFO L93 Difference]: Finished difference Result 599 states and 958 transitions. [2025-03-08 21:28:59,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:28:59,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-03-08 21:28:59,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:28:59,836 INFO L225 Difference]: With dead ends: 599 [2025-03-08 21:28:59,836 INFO L226 Difference]: Without dead ends: 392 [2025-03-08 21:28:59,838 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-03-08 21:28:59,839 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 271 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:28:59,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 533 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:28:59,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-08 21:28:59,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 202. [2025-03-08 21:28:59,873 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-03-08 21:28:59,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 290 transitions. [2025-03-08 21:28:59,876 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 290 transitions. Word has length 6 [2025-03-08 21:28:59,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:28:59,877 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 290 transitions. [2025-03-08 21:28:59,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-03-08 21:28:59,877 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 290 transitions. [2025-03-08 21:28:59,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 21:28:59,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:28:59,879 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-03-08 21:28:59,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:28:59,880 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:28:59,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:28:59,880 INFO L85 PathProgramCache]: Analyzing trace with hash -535919042, now seen corresponding path program 1 times [2025-03-08 21:28:59,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:28:59,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607129708] [2025-03-08 21:28:59,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:28:59,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:28:59,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 21:28:59,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 21:28:59,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:28:59,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:29:00,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:29:00,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:29:00,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607129708] [2025-03-08 21:29:00,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607129708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:29:00,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:29:00,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:29:00,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639386158] [2025-03-08 21:29:00,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:29:00,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:29:00,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:29:00,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:29:00,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:29:00,190 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-03-08 21:29:00,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:29:00,279 INFO L93 Difference]: Finished difference Result 404 states and 580 transitions. [2025-03-08 21:29:00,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:29:00,279 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-03-08 21:29:00,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:29:00,281 INFO L225 Difference]: With dead ends: 404 [2025-03-08 21:29:00,281 INFO L226 Difference]: Without dead ends: 205 [2025-03-08 21:29:00,282 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-03-08 21:29:00,284 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-03-08 21:29:00,284 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-03-08 21:29:00,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-08 21:29:00,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2025-03-08 21:29:00,294 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-03-08 21:29:00,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 283 transitions. [2025-03-08 21:29:00,295 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 283 transitions. Word has length 79 [2025-03-08 21:29:00,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:29:00,296 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 283 transitions. [2025-03-08 21:29:00,296 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-03-08 21:29:00,296 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 283 transitions. [2025-03-08 21:29:00,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 21:29:00,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:29:00,298 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-03-08 21:29:00,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:29:00,298 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:29:00,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:29:00,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1664635323, now seen corresponding path program 1 times [2025-03-08 21:29:00,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:29:00,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497339536] [2025-03-08 21:29:00,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:29:00,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:29:00,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 21:29:00,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 21:29:00,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:29:00,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:29:00,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:29:00,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:29:00,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497339536] [2025-03-08 21:29:00,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497339536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:29:00,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:29:00,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:29:00,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415417356] [2025-03-08 21:29:00,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:29:00,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:29:00,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:29:00,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:29:00,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:29:00,448 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), 3 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-03-08 21:29:00,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:29:00,537 INFO L93 Difference]: Finished difference Result 528 states and 750 transitions. [2025-03-08 21:29:00,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:29:00,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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-03-08 21:29:00,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:29:00,539 INFO L225 Difference]: With dead ends: 528 [2025-03-08 21:29:00,539 INFO L226 Difference]: Without dead ends: 329 [2025-03-08 21:29:00,540 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-03-08 21:29:00,541 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-03-08 21:29:00,542 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-03-08 21:29:00,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-03-08 21:29:00,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2025-03-08 21:29:00,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 324 states have (on average 1.4290123456790123) internal successors, (463), 324 states have internal predecessors, (463), 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-03-08 21:29:00,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 469 transitions. [2025-03-08 21:29:00,563 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 469 transitions. Word has length 79 [2025-03-08 21:29:00,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:29:00,563 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 469 transitions. [2025-03-08 21:29:00,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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-03-08 21:29:00,564 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 469 transitions. [2025-03-08 21:29:00,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 21:29:00,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:29:00,567 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-03-08 21:29:00,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:29:00,567 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:29:00,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:29:00,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1825542831, now seen corresponding path program 1 times [2025-03-08 21:29:00,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:29:00,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443082261] [2025-03-08 21:29:00,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:29:00,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:29:00,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 21:29:00,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 21:29:00,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:29:00,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:29:00,816 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:29:00,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:29:00,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443082261] [2025-03-08 21:29:00,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443082261] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:29:00,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863259288] [2025-03-08 21:29:00,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:29:00,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:29:00,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:29:00,820 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:29:00,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 21:29:00,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 21:29:01,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 21:29:01,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:29:01,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:29:01,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 21:29:01,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:29:01,185 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:29:01,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:29:01,310 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:29:01,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863259288] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:29:01,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:29:01,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 21:29:01,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451083492] [2025-03-08 21:29:01,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:29:01,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 21:29:01,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:29:01,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 21:29:01,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:29:01,315 INFO L87 Difference]: Start difference. First operand 329 states and 469 transitions. Second operand has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 7 states have internal predecessors, (246), 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-03-08 21:29:01,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:29:01,500 INFO L93 Difference]: Finished difference Result 777 states and 1100 transitions. [2025-03-08 21:29:01,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:29:01,501 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 7 states have internal predecessors, (246), 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 94 [2025-03-08 21:29:01,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:29:01,505 INFO L225 Difference]: With dead ends: 777 [2025-03-08 21:29:01,505 INFO L226 Difference]: Without dead ends: 773 [2025-03-08 21:29:01,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 185 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-03-08 21:29:01,506 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 1460 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:29:01,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 1286 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:29:01,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2025-03-08 21:29:01,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 773. [2025-03-08 21:29:01,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 759 states have (on average 1.4084321475625823) internal successors, (1069), 759 states have internal predecessors, (1069), 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-03-08 21:29:01,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1093 transitions. [2025-03-08 21:29:01,537 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1093 transitions. Word has length 94 [2025-03-08 21:29:01,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:29:01,538 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 1093 transitions. [2025-03-08 21:29:01,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 7 states have internal predecessors, (246), 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-03-08 21:29:01,538 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1093 transitions. [2025-03-08 21:29:01,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-08 21:29:01,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:29:01,547 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, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:29:01,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 21:29:01,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:29:01,748 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:29:01,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:29:01,749 INFO L85 PathProgramCache]: Analyzing trace with hash -243579149, now seen corresponding path program 1 times [2025-03-08 21:29:01,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:29:01,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065797175] [2025-03-08 21:29:01,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:29:01,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:29:01,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-08 21:29:01,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-08 21:29:01,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:29:01,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:29:02,341 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 4 proven. 156 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-08 21:29:02,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:29:02,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065797175] [2025-03-08 21:29:02,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065797175] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:29:02,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854791223] [2025-03-08 21:29:02,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:29:02,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:29:02,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:29:02,344 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:29:02,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 21:29:02,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-08 21:29:02,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-08 21:29:02,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:29:02,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:29:02,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 1654 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 21:29:02,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:29:03,119 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 436 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:29:03,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:29:03,431 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 436 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:29:03,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854791223] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:29:03,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:29:03,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-03-08 21:29:03,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790035725] [2025-03-08 21:29:03,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:29:03,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 21:29:03,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:29:03,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 21:29:03,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-08 21:29:03,439 INFO L87 Difference]: Start difference. First operand 773 states and 1093 transitions. Second operand has 14 states, 14 states have (on average 52.92857142857143) internal successors, (741), 14 states have internal predecessors, (741), 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-03-08 21:29:04,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:29:04,526 INFO L93 Difference]: Finished difference Result 2291 states and 3261 transitions. [2025-03-08 21:29:04,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 21:29:04,527 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 52.92857142857143) internal successors, (741), 14 states have internal predecessors, (741), 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 313 [2025-03-08 21:29:04,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:29:04,534 INFO L225 Difference]: With dead ends: 2291 [2025-03-08 21:29:04,534 INFO L226 Difference]: Without dead ends: 1839 [2025-03-08 21:29:04,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 617 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=238, Invalid=412, Unknown=0, NotChecked=0, Total=650 [2025-03-08 21:29:04,536 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 7193 mSDsluCounter, 2203 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7193 SdHoareTripleChecker+Valid, 2617 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 21:29:04,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7193 Valid, 2617 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 21:29:04,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2025-03-08 21:29:04,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1839. [2025-03-08 21:29:04,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1839 states, 1825 states have (on average 1.418082191780822) internal successors, (2588), 1825 states have internal predecessors, (2588), 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-03-08 21:29:04,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2612 transitions. [2025-03-08 21:29:04,575 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2612 transitions. Word has length 313 [2025-03-08 21:29:04,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:29:04,576 INFO L471 AbstractCegarLoop]: Abstraction has 1839 states and 2612 transitions. [2025-03-08 21:29:04,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 52.92857142857143) internal successors, (741), 14 states have internal predecessors, (741), 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-03-08 21:29:04,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2612 transitions. [2025-03-08 21:29:04,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2025-03-08 21:29:04,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:29:04,589 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, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:29:04,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 21:29:04,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:29:04,790 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:29:04,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:29:04,790 INFO L85 PathProgramCache]: Analyzing trace with hash 756590841, now seen corresponding path program 1 times [2025-03-08 21:29:04,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:29:04,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346981647] [2025-03-08 21:29:04,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:29:04,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:29:04,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 752 statements into 1 equivalence classes. [2025-03-08 21:29:38,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 752 of 752 statements. [2025-03-08 21:29:38,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:29:38,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:29:39,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3282 backedges. 478 proven. 3 refuted. 0 times theorem prover too weak. 2801 trivial. 0 not checked. [2025-03-08 21:29:39,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:29:39,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346981647] [2025-03-08 21:29:39,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346981647] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:29:39,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012293021] [2025-03-08 21:29:39,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:29:39,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:29:39,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:29:39,007 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:29:39,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 21:29:39,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 752 statements into 1 equivalence classes. [2025-03-08 21:29:52,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 752 of 752 statements. [2025-03-08 21:29:52,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:29:52,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:29:52,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 3869 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-08 21:29:52,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:29:52,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 21:29:52,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-03-08 21:29:52,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 21:29:53,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3282 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 3011 trivial. 0 not checked. [2025-03-08 21:29:53,106 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:29:53,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012293021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:29:53,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:29:53,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2025-03-08 21:29:53,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332986592] [2025-03-08 21:29:53,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:29:53,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 21:29:53,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:29:53,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 21:29:53,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-08 21:29:53,109 INFO L87 Difference]: Start difference. First operand 1839 states and 2612 transitions. Second operand has 12 states, 12 states have (on average 10.083333333333334) internal successors, (121), 12 states have internal predecessors, (121), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:29:54,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:29:54,831 INFO L93 Difference]: Finished difference Result 3651 states and 5176 transitions. [2025-03-08 21:29:54,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 21:29:54,831 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.083333333333334) internal successors, (121), 12 states have internal predecessors, (121), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 752 [2025-03-08 21:29:54,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:29:54,837 INFO L225 Difference]: With dead ends: 3651 [2025-03-08 21:29:54,837 INFO L226 Difference]: Without dead ends: 1895 [2025-03-08 21:29:54,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 743 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2025-03-08 21:29:54,839 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 515 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 21:29:54,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 1330 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 21:29:54,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2025-03-08 21:29:54,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1864. [2025-03-08 21:29:54,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1864 states, 1850 states have (on average 1.4151351351351351) internal successors, (2618), 1850 states have internal predecessors, (2618), 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-03-08 21:29:54,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 2642 transitions. [2025-03-08 21:29:54,870 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 2642 transitions. Word has length 752 [2025-03-08 21:29:54,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:29:54,870 INFO L471 AbstractCegarLoop]: Abstraction has 1864 states and 2642 transitions. [2025-03-08 21:29:54,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.083333333333334) internal successors, (121), 12 states have internal predecessors, (121), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:29:54,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2642 transitions. [2025-03-08 21:29:54,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 754 [2025-03-08 21:29:54,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:29:54,882 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, 9, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:29:54,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 21:29:55,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:29:55,083 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:29:55,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:29:55,083 INFO L85 PathProgramCache]: Analyzing trace with hash -547856275, now seen corresponding path program 1 times [2025-03-08 21:29:55,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:29:55,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729573809] [2025-03-08 21:29:55,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:29:55,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:29:55,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 753 statements into 1 equivalence classes.