./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-3.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_test4-3.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 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:29:52,192 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:29:52,242 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 21:29:52,246 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:29:52,247 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:29:52,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:29:52,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:29:52,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:29:52,273 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 21:29:52,274 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 21:29:52,274 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:29:52,274 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:29:52,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:29:52,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:29:52,275 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:29:52,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:29:52,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:29:52,276 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:29:52,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:29:52,276 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:29:52,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:29:52,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:29:52,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:29:52,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:29:52,276 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:29:52,276 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:29:52,276 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:29:52,276 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:29:52,276 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:29:52,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:29:52,277 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 21:29:52,277 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:29:52,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:29:52,277 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:29:52,277 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:29:52,277 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:29:52,277 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:29:52,277 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:29:52,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:29:52,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:29:52,278 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:29:52,278 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:29:52,278 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:29:52,278 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 -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2025-03-08 21:29:52,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:29:52,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:29:52,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:29:52,520 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:29:52,521 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:29:52,522 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_test4-3.i [2025-03-08 21:29:53,661 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beeab26f2/c7ff2012cbe7491b81d0721382a6b0f5/FLAG2eaa18a76 [2025-03-08 21:29:53,950 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:29:53,952 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-3.i [2025-03-08 21:29:53,966 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beeab26f2/c7ff2012cbe7491b81d0721382a6b0f5/FLAG2eaa18a76 [2025-03-08 21:29:54,223 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beeab26f2/c7ff2012cbe7491b81d0721382a6b0f5 [2025-03-08 21:29:54,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:29:54,227 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:29:54,227 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:29:54,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:29:54,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:29:54,231 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:29:54" (1/1) ... [2025-03-08 21:29:54,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ff858a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:29:54, skipping insertion in model container [2025-03-08 21:29:54,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:29:54" (1/1) ... [2025-03-08 21:29:54,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:29:54,525 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_test4-3.i[33519,33532] [2025-03-08 21:29:54,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:29:54,645 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:29:54,673 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_test4-3.i[33519,33532] [2025-03-08 21:29:54,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:29:54,766 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:29:54,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:29:54 WrapperNode [2025-03-08 21:29:54,767 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:29:54,768 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:29:54,768 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:29:54,768 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:29:54,772 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:29:54" (1/1) ... [2025-03-08 21:29:54,793 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:29:54" (1/1) ... [2025-03-08 21:29:54,848 INFO L138 Inliner]: procedures = 176, calls = 424, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1807 [2025-03-08 21:29:54,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:29:54,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:29:54,849 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:29:54,849 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:29:54,857 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:29:54" (1/1) ... [2025-03-08 21:29:54,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:29:54" (1/1) ... [2025-03-08 21:29:54,872 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:29:54" (1/1) ... [2025-03-08 21:29:54,956 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2025-03-08 21:29:54,956 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:29:54" (1/1) ... [2025-03-08 21:29:54,957 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:29:54" (1/1) ... [2025-03-08 21:29:54,985 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:29:54" (1/1) ... [2025-03-08 21:29:54,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:29:54" (1/1) ... [2025-03-08 21:29:54,999 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:29:54" (1/1) ... [2025-03-08 21:29:55,002 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:29:54" (1/1) ... [2025-03-08 21:29:55,016 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:29:55,017 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:29:55,017 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:29:55,017 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:29:55,018 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:29:54" (1/1) ... [2025-03-08 21:29:55,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:29:55,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:29:55,043 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:29:55,048 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:29:55,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 21:29:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 21:29:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 21:29:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 21:29:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-08 21:29:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-08 21:29:55,064 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-08 21:29:55,064 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-08 21:29:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 21:29:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:29:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 21:29:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 21:29:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 21:29:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 21:29:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 21:29:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 21:29:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 21:29:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:29:55,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:29:55,270 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:29:55,271 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:29:56,570 INFO L? ?]: Removed 417 outVars from TransFormulas that were not future-live. [2025-03-08 21:29:56,571 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:29:56,625 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:29:56,626 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-08 21:29:56,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:29:56 BoogieIcfgContainer [2025-03-08 21:29:56,626 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:29:56,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:29:56,629 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:29:56,632 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:29:56,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:29:54" (1/3) ... [2025-03-08 21:29:56,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354c82f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:29:56, skipping insertion in model container [2025-03-08 21:29:56,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:29:54" (2/3) ... [2025-03-08 21:29:56,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354c82f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:29:56, skipping insertion in model container [2025-03-08 21:29:56,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:29:56" (3/3) ... [2025-03-08 21:29:56,634 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test4-3.i [2025-03-08 21:29:56,645 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:29:56,646 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_nondet_test4-3.i that has 3 procedures, 459 locations, 1 initial locations, 43 loop locations, and 1 error locations. [2025-03-08 21:29:56,705 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:29:56,714 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;@57afcc48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:29:56,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 21:29:56,719 INFO L276 IsEmpty]: Start isEmpty. Operand has 455 states, 446 states have (on average 1.616591928251121) internal successors, (721), 447 states have internal predecessors, (721), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 21:29:56,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 21:29:56,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:29:56,724 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:29:56,724 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:29:56,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:29:56,729 INFO L85 PathProgramCache]: Analyzing trace with hash -81814358, now seen corresponding path program 1 times [2025-03-08 21:29:56,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:29:56,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404871400] [2025-03-08 21:29:56,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:29:56,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:29:56,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 21:29:56,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 21:29:56,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:29:56,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:29:56,926 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:29:56,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:29:56,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404871400] [2025-03-08 21:29:56,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404871400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:29:56,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:29:56,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:29:56,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440989347] [2025-03-08 21:29:56,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:29:56,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:29:56,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:29:56,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:29:56,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:29:56,943 INFO L87 Difference]: Start difference. First operand has 455 states, 446 states have (on average 1.616591928251121) internal successors, (721), 447 states have internal predecessors, (721), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:57,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:29:57,404 INFO L93 Difference]: Finished difference Result 1224 states and 1976 transitions. [2025-03-08 21:29:57,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:29:57,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2025-03-08 21:29:57,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:29:57,416 INFO L225 Difference]: With dead ends: 1224 [2025-03-08 21:29:57,416 INFO L226 Difference]: Without dead ends: 707 [2025-03-08 21:29:57,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:29:57,423 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 462 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 21:29:57,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 1741 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 21:29:57,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-03-08 21:29:57,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2025-03-08 21:29:57,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 696 states have (on average 1.4626436781609196) internal successors, (1018), 696 states have internal predecessors, (1018), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 21:29:57,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1036 transitions. [2025-03-08 21:29:57,510 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1036 transitions. Word has length 9 [2025-03-08 21:29:57,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:29:57,511 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 1036 transitions. [2025-03-08 21:29:57,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:57,511 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1036 transitions. [2025-03-08 21:29:57,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 21:29:57,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:29:57,517 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:29:57,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:29:57,518 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:29:57,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:29:57,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1875241815, now seen corresponding path program 1 times [2025-03-08 21:29:57,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:29:57,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669984033] [2025-03-08 21:29:57,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:29:57,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:29:57,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 21:29:57,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 21:29:57,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:29:57,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:29:58,118 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:29:58,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:29:58,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669984033] [2025-03-08 21:29:58,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669984033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:29:58,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:29:58,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:29:58,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774050380] [2025-03-08 21:29:58,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:29:58,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:29:58,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:29:58,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:29:58,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:29:58,122 INFO L87 Difference]: Start difference. First operand 707 states and 1036 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:29:58,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:29:58,285 INFO L93 Difference]: Finished difference Result 1362 states and 1991 transitions. [2025-03-08 21:29:58,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:29:58,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 166 [2025-03-08 21:29:58,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:29:58,289 INFO L225 Difference]: With dead ends: 1362 [2025-03-08 21:29:58,289 INFO L226 Difference]: Without dead ends: 713 [2025-03-08 21:29:58,292 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:58,293 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 105 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:29:58,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1407 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:29:58,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2025-03-08 21:29:58,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 707. [2025-03-08 21:29:58,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 696 states have (on average 1.4425287356321839) internal successors, (1004), 696 states have internal predecessors, (1004), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 21:29:58,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1022 transitions. [2025-03-08 21:29:58,327 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1022 transitions. Word has length 166 [2025-03-08 21:29:58,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:29:58,328 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 1022 transitions. [2025-03-08 21:29:58,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:29:58,328 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1022 transitions. [2025-03-08 21:29:58,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 21:29:58,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:29:58,334 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:29:58,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:29:58,334 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:29:58,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:29:58,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1004368866, now seen corresponding path program 1 times [2025-03-08 21:29:58,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:29:58,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363411903] [2025-03-08 21:29:58,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:29:58,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:29:58,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 21:29:58,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 21:29:58,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:29:58,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:29:58,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:29:58,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:29:58,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363411903] [2025-03-08 21:29:58,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363411903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:29:58,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:29:58,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:29:58,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402010082] [2025-03-08 21:29:58,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:29:58,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:29:58,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:29:58,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:29:58,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:29:58,608 INFO L87 Difference]: Start difference. First operand 707 states and 1022 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:29:58,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:29:58,747 INFO L93 Difference]: Finished difference Result 1272 states and 1840 transitions. [2025-03-08 21:29:58,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:29:58,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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 166 [2025-03-08 21:29:58,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:29:58,749 INFO L225 Difference]: With dead ends: 1272 [2025-03-08 21:29:58,750 INFO L226 Difference]: Without dead ends: 705 [2025-03-08 21:29:58,750 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:58,753 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 134 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:29:58,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1024 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:29:58,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-03-08 21:29:58,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2025-03-08 21:29:58,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 694 states have (on average 1.442363112391931) internal successors, (1001), 694 states have internal predecessors, (1001), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 21:29:58,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1019 transitions. [2025-03-08 21:29:58,772 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1019 transitions. Word has length 166 [2025-03-08 21:29:58,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:29:58,773 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 1019 transitions. [2025-03-08 21:29:58,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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:58,774 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1019 transitions. [2025-03-08 21:29:58,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 21:29:58,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:29:58,776 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:29:58,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:29:58,777 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:29:58,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:29:58,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1033186037, now seen corresponding path program 1 times [2025-03-08 21:29:58,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:29:58,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386362864] [2025-03-08 21:29:58,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:29:58,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:29:58,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 21:29:58,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 21:29:58,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:29:58,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:29:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 21:29:59,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:29:59,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386362864] [2025-03-08 21:29:59,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386362864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:29:59,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:29:59,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:29:59,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980364971] [2025-03-08 21:29:59,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:29:59,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:29:59,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:29:59,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:29:59,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:29:59,135 INFO L87 Difference]: Start difference. First operand 705 states and 1019 transitions. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 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-03-08 21:29:59,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:29:59,257 INFO L93 Difference]: Finished difference Result 1133 states and 1634 transitions. [2025-03-08 21:29:59,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:29:59,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 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 181 [2025-03-08 21:29:59,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:29:59,260 INFO L225 Difference]: With dead ends: 1133 [2025-03-08 21:29:59,260 INFO L226 Difference]: Without dead ends: 621 [2025-03-08 21:29:59,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:29:59,261 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 30 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:29:59,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1256 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:29:59,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2025-03-08 21:29:59,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2025-03-08 21:29:59,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 610 states have (on average 1.3885245901639345) internal successors, (847), 610 states have internal predecessors, (847), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 21:29:59,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 865 transitions. [2025-03-08 21:29:59,275 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 865 transitions. Word has length 181 [2025-03-08 21:29:59,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:29:59,275 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 865 transitions. [2025-03-08 21:29:59,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 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-03-08 21:29:59,276 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 865 transitions. [2025-03-08 21:29:59,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 21:29:59,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:29:59,277 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:29:59,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:29:59,277 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:29:59,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:29:59,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1396114543, now seen corresponding path program 1 times [2025-03-08 21:29:59,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:29:59,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281338044] [2025-03-08 21:29:59,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:29:59,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:29:59,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 21:29:59,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 21:29:59,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:29:59,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:00,045 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 21:30:00,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:30:00,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281338044] [2025-03-08 21:30:00,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281338044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:30:00,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571893731] [2025-03-08 21:30:00,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:00,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:30:00,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:30:00,049 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:30:00,050 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:30:00,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 21:30:00,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 21:30:00,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:00,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:00,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 21:30:00,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:30:00,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-03-08 21:30:00,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 21:30:00,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 58 [2025-03-08 21:30:01,174 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 21:30:01,174 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:30:01,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571893731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:30:01,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:30:01,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-08 21:30:01,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521856318] [2025-03-08 21:30:01,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:30:01,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 21:30:01,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:30:01,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 21:30:01,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:30:01,175 INFO L87 Difference]: Start difference. First operand 621 states and 865 transitions. Second operand has 11 states, 11 states have (on average 14.909090909090908) internal successors, (164), 11 states have internal predecessors, (164), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 21:30:04,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:30:04,286 INFO L93 Difference]: Finished difference Result 1269 states and 1757 transitions. [2025-03-08 21:30:04,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 21:30:04,287 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.909090909090908) internal successors, (164), 11 states have internal predecessors, (164), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 181 [2025-03-08 21:30:04,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:30:04,289 INFO L225 Difference]: With dead ends: 1269 [2025-03-08 21:30:04,289 INFO L226 Difference]: Without dead ends: 732 [2025-03-08 21:30:04,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-03-08 21:30:04,290 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 731 mSDsluCounter, 2437 mSDsCounter, 0 mSdLazyCounter, 1595 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 2877 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 21:30:04,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 2877 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1595 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 21:30:04,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2025-03-08 21:30:04,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 650. [2025-03-08 21:30:04,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 639 states have (on average 1.381846635367762) internal successors, (883), 639 states have internal predecessors, (883), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 21:30:04,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 901 transitions. [2025-03-08 21:30:04,304 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 901 transitions. Word has length 181 [2025-03-08 21:30:04,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:30:04,305 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 901 transitions. [2025-03-08 21:30:04,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.909090909090908) internal successors, (164), 11 states have internal predecessors, (164), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 21:30:04,305 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 901 transitions. [2025-03-08 21:30:04,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 21:30:04,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:30:04,306 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:30:04,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 21:30:04,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:30:04,507 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:30:04,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:30:04,507 INFO L85 PathProgramCache]: Analyzing trace with hash -260891698, now seen corresponding path program 1 times [2025-03-08 21:30:04,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:30:04,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403797534] [2025-03-08 21:30:04,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:04,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:30:04,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 21:30:04,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 21:30:04,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:04,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:04,672 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 21:30:04,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:30:04,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403797534] [2025-03-08 21:30:04,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403797534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:30:04,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:30:04,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:30:04,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478892823] [2025-03-08 21:30:04,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:30:04,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:30:04,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:30:04,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:30:04,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:30:04,673 INFO L87 Difference]: Start difference. First operand 650 states and 901 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 21:30:04,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:30:04,751 INFO L93 Difference]: Finished difference Result 1222 states and 1698 transitions. [2025-03-08 21:30:04,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:30:04,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 181 [2025-03-08 21:30:04,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:30:04,754 INFO L225 Difference]: With dead ends: 1222 [2025-03-08 21:30:04,754 INFO L226 Difference]: Without dead ends: 666 [2025-03-08 21:30:04,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:30:04,756 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 2 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:30:04,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 852 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:30:04,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-03-08 21:30:04,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 664. [2025-03-08 21:30:04,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 653 states have (on average 1.3705972434915774) internal successors, (895), 653 states have internal predecessors, (895), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 21:30:04,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 913 transitions. [2025-03-08 21:30:04,773 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 913 transitions. Word has length 181 [2025-03-08 21:30:04,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:30:04,773 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 913 transitions. [2025-03-08 21:30:04,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 21:30:04,773 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 913 transitions. [2025-03-08 21:30:04,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 21:30:04,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:30:04,775 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:30:04,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:30:04,775 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:30:04,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:30:04,776 INFO L85 PathProgramCache]: Analyzing trace with hash 788977517, now seen corresponding path program 1 times [2025-03-08 21:30:04,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:30:04,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474433654] [2025-03-08 21:30:04,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:04,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:30:04,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 21:30:04,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 21:30:04,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:04,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:04,975 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 21:30:04,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:30:04,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474433654] [2025-03-08 21:30:04,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474433654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:30:04,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:30:04,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:30:04,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476922801] [2025-03-08 21:30:04,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:30:04,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:30:04,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:30:04,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:30:04,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:30:04,977 INFO L87 Difference]: Start difference. First operand 664 states and 913 transitions. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 21:30:05,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:30:05,057 INFO L93 Difference]: Finished difference Result 1163 states and 1593 transitions. [2025-03-08 21:30:05,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:30:05,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 181 [2025-03-08 21:30:05,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:30:05,059 INFO L225 Difference]: With dead ends: 1163 [2025-03-08 21:30:05,059 INFO L226 Difference]: Without dead ends: 525 [2025-03-08 21:30:05,060 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:30:05,061 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 9 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:30:05,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1052 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:30:05,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-08 21:30:05,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2025-03-08 21:30:05,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 514 states have (on average 1.3346303501945525) internal successors, (686), 514 states have internal predecessors, (686), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 21:30:05,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 704 transitions. [2025-03-08 21:30:05,072 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 704 transitions. Word has length 181 [2025-03-08 21:30:05,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:30:05,072 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 704 transitions. [2025-03-08 21:30:05,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 21:30:05,072 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 704 transitions. [2025-03-08 21:30:05,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 21:30:05,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:30:05,074 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:30:05,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:30:05,074 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:30:05,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:30:05,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1476166058, now seen corresponding path program 1 times [2025-03-08 21:30:05,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:30:05,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707663685] [2025-03-08 21:30:05,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:05,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:30:05,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 21:30:05,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 21:30:05,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:05,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 21:30:05,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:30:05,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707663685] [2025-03-08 21:30:05,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707663685] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:30:05,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937827287] [2025-03-08 21:30:05,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:05,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:30:05,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:30:05,720 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:30:05,722 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:30:05,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 21:30:06,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 21:30:06,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:06,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:06,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 1014 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 21:30:06,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:30:06,241 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 21:30:06,244 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:30:06,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937827287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:30:06,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:30:06,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-08 21:30:06,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843817013] [2025-03-08 21:30:06,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:30:06,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:30:06,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:30:06,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:30:06,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:30:06,246 INFO L87 Difference]: Start difference. First operand 525 states and 704 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 21:30:06,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:30:06,367 INFO L93 Difference]: Finished difference Result 1014 states and 1370 transitions. [2025-03-08 21:30:06,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:30:06,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 182 [2025-03-08 21:30:06,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:30:06,370 INFO L225 Difference]: With dead ends: 1014 [2025-03-08 21:30:06,370 INFO L226 Difference]: Without dead ends: 525 [2025-03-08 21:30:06,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:30:06,371 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 13 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:30:06,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 978 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:30:06,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-08 21:30:06,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2025-03-08 21:30:06,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 514 states have (on average 1.3307392996108949) internal successors, (684), 514 states have internal predecessors, (684), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 21:30:06,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 702 transitions. [2025-03-08 21:30:06,382 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 702 transitions. Word has length 182 [2025-03-08 21:30:06,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:30:06,383 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 702 transitions. [2025-03-08 21:30:06,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 21:30:06,383 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 702 transitions. [2025-03-08 21:30:06,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-08 21:30:06,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:30:06,384 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:30:06,395 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:30:06,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-08 21:30:06,585 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:30:06,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:30:06,585 INFO L85 PathProgramCache]: Analyzing trace with hash 793547154, now seen corresponding path program 1 times [2025-03-08 21:30:06,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:30:06,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357818048] [2025-03-08 21:30:06,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:06,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:30:06,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 21:30:06,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 21:30:06,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:06,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:06,939 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 21:30:06,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:30:06,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357818048] [2025-03-08 21:30:06,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357818048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:30:06,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:30:06,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 21:30:06,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948955285] [2025-03-08 21:30:06,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:30:06,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:30:06,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:30:06,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:30:06,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:30:06,940 INFO L87 Difference]: Start difference. First operand 525 states and 702 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 21:30:07,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:30:07,166 INFO L93 Difference]: Finished difference Result 1017 states and 1372 transitions. [2025-03-08 21:30:07,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:30:07,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 183 [2025-03-08 21:30:07,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:30:07,169 INFO L225 Difference]: With dead ends: 1017 [2025-03-08 21:30:07,169 INFO L226 Difference]: Without dead ends: 531 [2025-03-08 21:30:07,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:30:07,170 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 4 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:30:07,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1274 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:30:07,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-03-08 21:30:07,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2025-03-08 21:30:07,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 520 states have (on average 1.3269230769230769) internal successors, (690), 520 states have internal predecessors, (690), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 21:30:07,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 708 transitions. [2025-03-08 21:30:07,185 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 708 transitions. Word has length 183 [2025-03-08 21:30:07,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:30:07,186 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 708 transitions. [2025-03-08 21:30:07,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 21:30:07,186 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 708 transitions. [2025-03-08 21:30:07,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-08 21:30:07,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:30:07,188 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:30:07,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 21:30:07,188 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:30:07,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:30:07,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1147535671, now seen corresponding path program 1 times [2025-03-08 21:30:07,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:30:07,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605768938] [2025-03-08 21:30:07,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:07,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:30:07,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-08 21:30:07,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-08 21:30:07,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:07,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:07,755 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 21:30:07,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:30:07,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605768938] [2025-03-08 21:30:07,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605768938] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:30:07,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127785468] [2025-03-08 21:30:07,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:07,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:30:07,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:30:07,758 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:30:07,760 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:30:08,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-08 21:30:08,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-08 21:30:08,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:08,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:08,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 21:30:08,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:30:08,329 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 21:30:08,329 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:30:08,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127785468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:30:08,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:30:08,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 6 [2025-03-08 21:30:08,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716821153] [2025-03-08 21:30:08,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:30:08,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 21:30:08,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:30:08,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 21:30:08,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:30:08,332 INFO L87 Difference]: Start difference. First operand 531 states and 708 transitions. Second operand has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 21:30:08,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:30:08,462 INFO L93 Difference]: Finished difference Result 1037 states and 1397 transitions. [2025-03-08 21:30:08,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:30:08,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 184 [2025-03-08 21:30:08,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:30:08,465 INFO L225 Difference]: With dead ends: 1037 [2025-03-08 21:30:08,466 INFO L226 Difference]: Without dead ends: 595 [2025-03-08 21:30:08,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:30:08,467 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 361 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:30:08,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1446 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:30:08,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-03-08 21:30:08,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 534. [2025-03-08 21:30:08,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 522 states have (on average 1.3275862068965518) internal successors, (693), 523 states have internal predecessors, (693), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-08 21:30:08,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 714 transitions. [2025-03-08 21:30:08,482 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 714 transitions. Word has length 184 [2025-03-08 21:30:08,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:30:08,482 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 714 transitions. [2025-03-08 21:30:08,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 21:30:08,483 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 714 transitions. [2025-03-08 21:30:08,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 21:30:08,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:30:08,484 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:30:08,494 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:30:08,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:30:08,685 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:30:08,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:30:08,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1506089663, now seen corresponding path program 1 times [2025-03-08 21:30:08,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:30:08,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169900136] [2025-03-08 21:30:08,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:08,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:30:08,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 21:30:09,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 21:30:09,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:09,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:09,343 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 21:30:09,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:30:09,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169900136] [2025-03-08 21:30:09,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169900136] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:30:09,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720458416] [2025-03-08 21:30:09,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:09,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:30:09,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:30:09,346 INFO L229 MonitoredProcess]: Starting monitored process 5 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:30:09,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 21:30:09,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 21:30:09,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 21:30:09,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:09,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:09,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 1073 conjuncts, 166 conjuncts are in the unsatisfiable core [2025-03-08 21:30:09,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:30:09,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-08 21:30:09,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-03-08 21:30:10,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 21 [2025-03-08 21:30:10,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2025-03-08 21:30:10,496 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 11 treesize of output 7 [2025-03-08 21:30:10,500 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 15 treesize of output 1 [2025-03-08 21:30:10,515 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-03-08 21:30:10,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-03-08 21:30:10,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 21:30:10,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-08 21:30:10,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 21:30:10,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 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:30:10,784 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 21:30:10,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2025-03-08 21:30:10,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2025-03-08 21:30:10,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16