./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_OAT_test4-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 765142a1ef820c0c2cf2fa98a3978a1412f5a1196c629c20848264001100dcc9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:30:51,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:30:51,122 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 10:30:51,126 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:30:51,127 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:30:51,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:30:51,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:30:51,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:30:51,152 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 10:30:51,152 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 10:30:51,153 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:30:51,153 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:30:51,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:30:51,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:30:51,154 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:30:51,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:30:51,154 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:30:51,154 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:30:51,154 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:30:51,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:30:51,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:30:51,155 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:30:51,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:30:51,155 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:30:51,155 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:30:51,155 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:30:51,155 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:30:51,155 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:30:51,155 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:30:51,155 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:30:51,156 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 10:30:51,156 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:30:51,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:30:51,156 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:30:51,156 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:30:51,156 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:30:51,156 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:30:51,156 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:30:51,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:30:51,157 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:30:51,157 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:30:51,157 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:30:51,157 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:30:51,157 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 -> 765142a1ef820c0c2cf2fa98a3978a1412f5a1196c629c20848264001100dcc9 [2025-03-17 10:30:51,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:30:51,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:30:51,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:30:51,376 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:30:51,376 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:30:51,377 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i [2025-03-17 10:30:52,518 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c9d1bd51/7457452c85e7413e8a6a6753ecbd2ef7/FLAG01cfee0bc [2025-03-17 10:30:52,835 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:30:52,836 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i [2025-03-17 10:30:52,853 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c9d1bd51/7457452c85e7413e8a6a6753ecbd2ef7/FLAG01cfee0bc [2025-03-17 10:30:52,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c9d1bd51/7457452c85e7413e8a6a6753ecbd2ef7 [2025-03-17 10:30:52,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:30:52,869 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:30:52,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:30:52,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:30:52,874 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:30:52,875 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:30:52" (1/1) ... [2025-03-17 10:30:52,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a2629a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:52, skipping insertion in model container [2025-03-17 10:30:52,877 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:30:52" (1/1) ... [2025-03-17 10:30:52,912 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:30:53,204 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_OAT_test4-1.i[33021,33034] [2025-03-17 10:30:53,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:30:53,346 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:30:53,369 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_OAT_test4-1.i[33021,33034] [2025-03-17 10:30:53,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:30:53,452 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:30:53,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:53 WrapperNode [2025-03-17 10:30:53,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:30:53,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:30:53,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:30:53,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:30:53,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:53" (1/1) ... [2025-03-17 10:30:53,475 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:53" (1/1) ... [2025-03-17 10:30:53,527 INFO L138 Inliner]: procedures = 176, calls = 335, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1540 [2025-03-17 10:30:53,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:30:53,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:30:53,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:30:53,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:30:53,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:53" (1/1) ... [2025-03-17 10:30:53,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:53" (1/1) ... [2025-03-17 10:30:53,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:53" (1/1) ... [2025-03-17 10:30:53,623 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2025-03-17 10:30:53,623 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:53" (1/1) ... [2025-03-17 10:30:53,623 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:53" (1/1) ... [2025-03-17 10:30:53,662 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:53" (1/1) ... [2025-03-17 10:30:53,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:53" (1/1) ... [2025-03-17 10:30:53,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:53" (1/1) ... [2025-03-17 10:30:53,672 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:53" (1/1) ... [2025-03-17 10:30:53,678 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:30:53,681 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:30:53,681 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:30:53,681 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:30:53,682 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:53" (1/1) ... [2025-03-17 10:30:53,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:30:53,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:30:53,707 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-17 10:30:53,709 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-17 10:30:53,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 10:30:53,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 10:30:53,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 10:30:53,727 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 10:30:53,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 10:30:53,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 10:30:53,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 10:30:53,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 10:30:53,728 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 10:30:53,728 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 10:30:53,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 10:30:53,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:30:53,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 10:30:53,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 10:30:53,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 10:30:53,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 10:30:53,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:30:53,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 10:30:53,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 10:30:53,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:30:53,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:30:53,919 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:30:53,921 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:30:55,101 INFO L? ?]: Removed 385 outVars from TransFormulas that were not future-live. [2025-03-17 10:30:55,101 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:30:55,149 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:30:55,152 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 10:30:55,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:30:55 BoogieIcfgContainer [2025-03-17 10:30:55,153 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:30:55,154 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:30:55,154 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:30:55,158 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:30:55,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:30:52" (1/3) ... [2025-03-17 10:30:55,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c9377f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:30:55, skipping insertion in model container [2025-03-17 10:30:55,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:53" (2/3) ... [2025-03-17 10:30:55,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c9377f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:30:55, skipping insertion in model container [2025-03-17 10:30:55,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:30:55" (3/3) ... [2025-03-17 10:30:55,160 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test4-1.i [2025-03-17 10:30:55,170 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:30:55,171 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test4-1.i that has 4 procedures, 417 locations, 1 initial locations, 34 loop locations, and 1 error locations. [2025-03-17 10:30:55,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:30:55,230 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;@9ccd0a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:30:55,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 10:30:55,237 INFO L276 IsEmpty]: Start isEmpty. Operand has 413 states, 393 states have (on average 1.6208651399491094) internal successors, (637), 404 states have internal predecessors, (637), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 10:30:55,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 10:30:55,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:55,242 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:30:55,242 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:55,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:55,246 INFO L85 PathProgramCache]: Analyzing trace with hash -2147192071, now seen corresponding path program 1 times [2025-03-17 10:30:55,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:55,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713466700] [2025-03-17 10:30:55,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:55,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:55,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 10:30:55,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 10:30:55,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:55,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:55,393 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-17 10:30:55,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:55,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713466700] [2025-03-17 10:30:55,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713466700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:30:55,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:30:55,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:30:55,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234332269] [2025-03-17 10:30:55,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:30:55,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:30:55,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:55,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:30:55,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:30:55,418 INFO L87 Difference]: Start difference. First operand has 413 states, 393 states have (on average 1.6208651399491094) internal successors, (637), 404 states have internal predecessors, (637), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:30:55,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:55,622 INFO L93 Difference]: Finished difference Result 1203 states and 1961 transitions. [2025-03-17 10:30:55,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:30:55,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 10:30:55,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:55,636 INFO L225 Difference]: With dead ends: 1203 [2025-03-17 10:30:55,636 INFO L226 Difference]: Without dead ends: 789 [2025-03-17 10:30:55,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:30:55,647 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 539 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:30:55,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1156 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:30:55,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-03-17 10:30:55,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 412. [2025-03-17 10:30:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 393 states have (on average 1.460559796437659) internal successors, (574), 403 states have internal predecessors, (574), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 10:30:55,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 606 transitions. [2025-03-17 10:30:55,699 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 606 transitions. Word has length 8 [2025-03-17 10:30:55,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:55,699 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 606 transitions. [2025-03-17 10:30:55,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:30:55,700 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 606 transitions. [2025-03-17 10:30:55,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 10:30:55,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:55,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:30:55,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:30:55,705 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:55,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:55,705 INFO L85 PathProgramCache]: Analyzing trace with hash -108512608, now seen corresponding path program 1 times [2025-03-17 10:30:55,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:55,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15473360] [2025-03-17 10:30:55,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:55,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:55,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 10:30:55,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 10:30:55,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:55,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:56,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:30:56,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:56,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15473360] [2025-03-17 10:30:56,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15473360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:30:56,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:30:56,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:30:56,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586117587] [2025-03-17 10:30:56,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:30:56,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:30:56,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:56,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:30:56,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:30:56,198 INFO L87 Difference]: Start difference. First operand 412 states and 606 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:30:56,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:56,375 INFO L93 Difference]: Finished difference Result 842 states and 1240 transitions. [2025-03-17 10:30:56,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:30:56,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2025-03-17 10:30:56,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:56,379 INFO L225 Difference]: With dead ends: 842 [2025-03-17 10:30:56,379 INFO L226 Difference]: Without dead ends: 432 [2025-03-17 10:30:56,380 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-17 10:30:56,381 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 9 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:30:56,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1067 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:30:56,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-03-17 10:30:56,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2025-03-17 10:30:56,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 413 states have (on average 1.4382566585956416) internal successors, (594), 423 states have internal predecessors, (594), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 10:30:56,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 626 transitions. [2025-03-17 10:30:56,401 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 626 transitions. Word has length 150 [2025-03-17 10:30:56,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:56,402 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 626 transitions. [2025-03-17 10:30:56,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:30:56,402 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 626 transitions. [2025-03-17 10:30:56,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 10:30:56,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:56,406 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:30:56,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:30:56,406 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:56,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:56,406 INFO L85 PathProgramCache]: Analyzing trace with hash -30522337, now seen corresponding path program 1 times [2025-03-17 10:30:56,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:56,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886568561] [2025-03-17 10:30:56,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:56,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:56,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 10:30:56,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 10:30:56,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:56,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:56,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:30:56,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:56,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886568561] [2025-03-17 10:30:56,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886568561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:30:56,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:30:56,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:30:56,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266564113] [2025-03-17 10:30:56,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:30:56,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:30:56,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:56,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:30:56,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:30:56,769 INFO L87 Difference]: Start difference. First operand 432 states and 626 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:30:56,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:56,906 INFO L93 Difference]: Finished difference Result 848 states and 1236 transitions. [2025-03-17 10:30:56,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:30:56,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2025-03-17 10:30:56,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:56,911 INFO L225 Difference]: With dead ends: 848 [2025-03-17 10:30:56,911 INFO L226 Difference]: Without dead ends: 418 [2025-03-17 10:30:56,912 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-17 10:30:56,912 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 105 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1518 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-17 10:30:56,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1518 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:30:56,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-17 10:30:56,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2025-03-17 10:30:56,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 399 states have (on average 1.4360902255639099) internal successors, (573), 409 states have internal predecessors, (573), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 10:30:56,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 605 transitions. [2025-03-17 10:30:56,929 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 605 transitions. Word has length 150 [2025-03-17 10:30:56,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:56,930 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 605 transitions. [2025-03-17 10:30:56,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:30:56,931 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 605 transitions. [2025-03-17 10:30:56,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 10:30:56,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:56,933 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:30:56,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:30:56,933 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:56,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:56,934 INFO L85 PathProgramCache]: Analyzing trace with hash -145572570, now seen corresponding path program 1 times [2025-03-17 10:30:56,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:56,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110841938] [2025-03-17 10:30:56,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:56,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:56,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 10:30:57,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 10:30:57,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:57,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:57,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:30:57,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:57,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110841938] [2025-03-17 10:30:57,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110841938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:30:57,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:30:57,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:30:57,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608585901] [2025-03-17 10:30:57,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:30:57,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:30:57,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:57,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:30:57,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:30:57,144 INFO L87 Difference]: Start difference. First operand 418 states and 605 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:30:57,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:57,271 INFO L93 Difference]: Finished difference Result 967 states and 1401 transitions. [2025-03-17 10:30:57,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:30:57,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2025-03-17 10:30:57,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:57,275 INFO L225 Difference]: With dead ends: 967 [2025-03-17 10:30:57,276 INFO L226 Difference]: Without dead ends: 551 [2025-03-17 10:30:57,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:30:57,278 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 134 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1099 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-17 10:30:57,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1099 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:30:57,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-17 10:30:57,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-03-17 10:30:57,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 532 states have (on average 1.4379699248120301) internal successors, (765), 542 states have internal predecessors, (765), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 10:30:57,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 797 transitions. [2025-03-17 10:30:57,298 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 797 transitions. Word has length 150 [2025-03-17 10:30:57,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:57,298 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 797 transitions. [2025-03-17 10:30:57,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:30:57,298 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 797 transitions. [2025-03-17 10:30:57,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-17 10:30:57,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:57,300 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] [2025-03-17 10:30:57,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:30:57,300 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:57,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:57,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1623500319, now seen corresponding path program 1 times [2025-03-17 10:30:57,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:57,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485954677] [2025-03-17 10:30:57,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:57,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:57,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 10:30:57,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 10:30:57,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:57,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:57,641 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-17 10:30:57,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:57,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485954677] [2025-03-17 10:30:57,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485954677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:30:57,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:30:57,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:30:57,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733589286] [2025-03-17 10:30:57,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:30:57,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:30:57,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:57,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:30:57,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:30:57,643 INFO L87 Difference]: Start difference. First operand 551 states and 797 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:30:57,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:57,785 INFO L93 Difference]: Finished difference Result 925 states and 1334 transitions. [2025-03-17 10:30:57,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:30:57,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 165 [2025-03-17 10:30:57,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:57,789 INFO L225 Difference]: With dead ends: 925 [2025-03-17 10:30:57,789 INFO L226 Difference]: Without dead ends: 509 [2025-03-17 10:30:57,790 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-17 10:30:57,791 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 30 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1367 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-17 10:30:57,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1367 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:30:57,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-03-17 10:30:57,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2025-03-17 10:30:57,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 490 states have (on average 1.4040816326530612) internal successors, (688), 500 states have internal predecessors, (688), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 10:30:57,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 720 transitions. [2025-03-17 10:30:57,810 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 720 transitions. Word has length 165 [2025-03-17 10:30:57,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:57,810 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 720 transitions. [2025-03-17 10:30:57,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:30:57,812 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 720 transitions. [2025-03-17 10:30:57,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-17 10:30:57,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:57,813 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] [2025-03-17 10:30:57,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:30:57,813 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:57,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:57,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1335733432, now seen corresponding path program 1 times [2025-03-17 10:30:57,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:57,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694668513] [2025-03-17 10:30:57,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:57,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:57,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 10:30:57,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 10:30:57,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:57,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:58,051 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-17 10:30:58,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:58,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694668513] [2025-03-17 10:30:58,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694668513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:30:58,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:30:58,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:30:58,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996999494] [2025-03-17 10:30:58,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:30:58,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:30:58,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:58,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:30:58,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:30:58,054 INFO L87 Difference]: Start difference. First operand 509 states and 720 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:30:58,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:58,138 INFO L93 Difference]: Finished difference Result 883 states and 1246 transitions. [2025-03-17 10:30:58,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:30:58,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 165 [2025-03-17 10:30:58,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:58,141 INFO L225 Difference]: With dead ends: 883 [2025-03-17 10:30:58,141 INFO L226 Difference]: Without dead ends: 509 [2025-03-17 10:30:58,142 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-17 10:30:58,142 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 1 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:30:58,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 926 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:30:58,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-03-17 10:30:58,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2025-03-17 10:30:58,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 490 states have (on average 1.3979591836734695) internal successors, (685), 500 states have internal predecessors, (685), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 10:30:58,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 717 transitions. [2025-03-17 10:30:58,163 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 717 transitions. Word has length 165 [2025-03-17 10:30:58,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:58,164 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 717 transitions. [2025-03-17 10:30:58,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:30:58,164 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 717 transitions. [2025-03-17 10:30:58,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-17 10:30:58,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:58,169 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] [2025-03-17 10:30:58,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:30:58,169 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:58,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:58,169 INFO L85 PathProgramCache]: Analyzing trace with hash 897723929, now seen corresponding path program 1 times [2025-03-17 10:30:58,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:58,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532173885] [2025-03-17 10:30:58,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:58,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:58,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 10:30:58,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 10:30:58,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:58,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:58,405 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-17 10:30:58,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:58,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532173885] [2025-03-17 10:30:58,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532173885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:30:58,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:30:58,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:30:58,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918823398] [2025-03-17 10:30:58,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:30:58,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:30:58,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:58,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:30:58,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:30:58,408 INFO L87 Difference]: Start difference. First operand 509 states and 717 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:30:58,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:58,533 INFO L93 Difference]: Finished difference Result 1026 states and 1432 transitions. [2025-03-17 10:30:58,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:30:58,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 165 [2025-03-17 10:30:58,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:58,538 INFO L225 Difference]: With dead ends: 1026 [2025-03-17 10:30:58,538 INFO L226 Difference]: Without dead ends: 652 [2025-03-17 10:30:58,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:30:58,541 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 242 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:30:58,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 950 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:30:58,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-03-17 10:30:58,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2025-03-17 10:30:58,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 630 states have (on average 1.380952380952381) internal successors, (870), 640 states have internal predecessors, (870), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 10:30:58,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 908 transitions. [2025-03-17 10:30:58,564 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 908 transitions. Word has length 165 [2025-03-17 10:30:58,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:58,565 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 908 transitions. [2025-03-17 10:30:58,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:30:58,565 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 908 transitions. [2025-03-17 10:30:58,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-17 10:30:58,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:58,567 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] [2025-03-17 10:30:58,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:30:58,567 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:58,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:58,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1554100653, now seen corresponding path program 1 times [2025-03-17 10:30:58,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:58,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672993872] [2025-03-17 10:30:58,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:58,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:58,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-17 10:30:58,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-17 10:30:58,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:58,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:58,877 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:30:58,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:58,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672993872] [2025-03-17 10:30:58,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672993872] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:30:58,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429909077] [2025-03-17 10:30:58,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:58,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:30:58,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:30:58,880 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-17 10:30:58,882 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-17 10:30:59,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-17 10:30:59,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-17 10:30:59,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:59,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:59,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 1034 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 10:30:59,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:30:59,461 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:30:59,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:30:59,681 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:30:59,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429909077] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:30:59,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:30:59,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 10:30:59,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608860018] [2025-03-17 10:30:59,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:30:59,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:30:59,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:59,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:30:59,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:30:59,683 INFO L87 Difference]: Start difference. First operand 652 states and 908 transitions. Second operand has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 10:30:59,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:59,986 INFO L93 Difference]: Finished difference Result 1426 states and 1982 transitions. [2025-03-17 10:30:59,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:30:59,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 180 [2025-03-17 10:30:59,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:59,992 INFO L225 Difference]: With dead ends: 1426 [2025-03-17 10:30:59,992 INFO L226 Difference]: Without dead ends: 1398 [2025-03-17 10:30:59,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:30:59,993 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 2218 mSDsluCounter, 1932 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2234 SdHoareTripleChecker+Valid, 2409 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:30:59,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2234 Valid, 2409 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:30:59,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2025-03-17 10:31:00,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1398. [2025-03-17 10:31:00,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1361 states have (on average 1.3695811903012491) internal successors, (1864), 1371 states have internal predecessors, (1864), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 25 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 10:31:00,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 1932 transitions. [2025-03-17 10:31:00,028 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 1932 transitions. Word has length 180 [2025-03-17 10:31:00,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:31:00,028 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 1932 transitions. [2025-03-17 10:31:00,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 10:31:00,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1932 transitions. [2025-03-17 10:31:00,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2025-03-17 10:31:00,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:31:00,040 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:31:00,050 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-17 10:31:00,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:31:00,245 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:31:00,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:31:00,245 INFO L85 PathProgramCache]: Analyzing trace with hash 194265992, now seen corresponding path program 1 times [2025-03-17 10:31:00,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:31:00,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169699337] [2025-03-17 10:31:00,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:31:00,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:31:00,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-03-17 10:31:00,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-03-17 10:31:00,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:31:00,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:31:01,714 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 844 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:31:01,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:31:01,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169699337] [2025-03-17 10:31:01,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169699337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:31:01,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917224291] [2025-03-17 10:31:01,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:31:01,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:31:01,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:31:01,717 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-17 10:31:01,719 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-17 10:31:02,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-03-17 10:31:02,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-03-17 10:31:02,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:31:02,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:31:02,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 3104 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 10:31:02,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:31:03,189 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 844 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:31:03,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:31:03,757 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 844 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:31:03,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917224291] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:31:03,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:31:03,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-17 10:31:03,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955540910] [2025-03-17 10:31:03,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:31:03,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 10:31:03,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:31:03,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 10:31:03,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 10:31:03,762 INFO L87 Difference]: Start difference. First operand 1398 states and 1932 transitions. Second operand has 13 states, 13 states have (on average 101.61538461538461) internal successors, (1321), 13 states have internal predecessors, (1321), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 10:31:04,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:31:04,417 INFO L93 Difference]: Finished difference Result 3478 states and 4811 transitions. [2025-03-17 10:31:04,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 10:31:04,418 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 101.61538461538461) internal successors, (1321), 13 states have internal predecessors, (1321), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 606 [2025-03-17 10:31:04,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:31:04,433 INFO L225 Difference]: With dead ends: 3478 [2025-03-17 10:31:04,433 INFO L226 Difference]: Without dead ends: 3450 [2025-03-17 10:31:04,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1217 GetRequests, 1206 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 10:31:04,436 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 5895 mSDsluCounter, 4130 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5947 SdHoareTripleChecker+Valid, 4802 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 10:31:04,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5947 Valid, 4802 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 10:31:04,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3450 states. [2025-03-17 10:31:04,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3450 to 3450. [2025-03-17 10:31:04,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3450 states, 3377 states have (on average 1.3674859342611785) internal successors, (4618), 3387 states have internal predecessors, (4618), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 61 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-17 10:31:04,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3450 states to 3450 states and 4758 transitions. [2025-03-17 10:31:04,518 INFO L78 Accepts]: Start accepts. Automaton has 3450 states and 4758 transitions. Word has length 606 [2025-03-17 10:31:04,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:31:04,519 INFO L471 AbstractCegarLoop]: Abstraction has 3450 states and 4758 transitions. [2025-03-17 10:31:04,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 101.61538461538461) internal successors, (1321), 13 states have internal predecessors, (1321), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 10:31:04,520 INFO L276 IsEmpty]: Start isEmpty. Operand 3450 states and 4758 transitions. [2025-03-17 10:31:04,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1459 [2025-03-17 10:31:04,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:31:04,553 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:31:04,567 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-17 10:31:04,753 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,SelfDestructingSolverStorable8 [2025-03-17 10:31:04,754 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:31:04,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:31:04,755 INFO L85 PathProgramCache]: Analyzing trace with hash 39401266, now seen corresponding path program 2 times [2025-03-17 10:31:04,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:31:04,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740730222] [2025-03-17 10:31:04,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:31:04,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:31:05,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1458 statements into 2 equivalence classes.