./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.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 9a343b75818c5d561b79c31bb62e9abdd9bdb0bf3f01f7efa313d9ef0f4204f4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:18:37,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:18:37,452 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 06:18:37,457 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:18:37,457 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:18:37,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:18:37,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:18:37,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:18:37,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 06:18:37,483 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 06:18:37,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:18:37,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:18:37,484 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:18:37,484 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:18:37,485 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:18:37,485 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:18:37,485 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:18:37,485 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:18:37,485 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:18:37,485 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:18:37,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:18:37,486 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:18:37,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:18:37,486 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:18:37,486 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:18:37,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:18:37,486 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:18:37,486 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:18:37,486 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:18:37,486 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:18:37,486 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 06:18:37,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:18:37,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:18:37,487 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:18:37,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:18:37,487 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:18:37,487 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:18:37,487 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:18:37,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:18:37,487 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:18:37,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:18:37,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:18:37,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:18:37,488 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 -> 9a343b75818c5d561b79c31bb62e9abdd9bdb0bf3f01f7efa313d9ef0f4204f4 [2025-03-04 06:18:37,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:18:37,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:18:37,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:18:37,738 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:18:37,738 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:18:37,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i [2025-03-04 06:18:38,903 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cccf6f32/b4ebbbd04d494ff59d1dc2179592570d/FLAG7e98a10a0 [2025-03-04 06:18:39,242 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:18:39,243 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i [2025-03-04 06:18:39,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cccf6f32/b4ebbbd04d494ff59d1dc2179592570d/FLAG7e98a10a0 [2025-03-04 06:18:39,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cccf6f32/b4ebbbd04d494ff59d1dc2179592570d [2025-03-04 06:18:39,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:18:39,285 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:18:39,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:18:39,286 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:18:39,290 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:18:39,291 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:18:39" (1/1) ... [2025-03-04 06:18:39,292 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3798012 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:18:39, skipping insertion in model container [2025-03-04 06:18:39,292 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:18:39" (1/1) ... [2025-03-04 06:18:39,332 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:18:39,591 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i[33022,33035] [2025-03-04 06:18:39,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:18:39,759 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:18:39,793 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i[33022,33035] [2025-03-04 06:18:39,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:18:39,899 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:18:39,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:18:39 WrapperNode [2025-03-04 06:18:39,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:18:39,901 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:18:39,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:18:39,901 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:18:39,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:18:39" (1/1) ... [2025-03-04 06:18:39,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:18:39" (1/1) ... [2025-03-04 06:18:40,015 INFO L138 Inliner]: procedures = 177, calls = 557, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3464 [2025-03-04 06:18:40,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:18:40,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:18:40,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:18:40,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:18:40,025 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:18:39" (1/1) ... [2025-03-04 06:18:40,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:18:39" (1/1) ... [2025-03-04 06:18:40,043 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:18:39" (1/1) ... [2025-03-04 06:18:40,184 INFO L175 MemorySlicer]: Split 528 memory accesses to 3 slices as follows [106, 2, 420]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 94 writes are split as follows [4, 0, 90]. [2025-03-04 06:18:40,185 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:18:39" (1/1) ... [2025-03-04 06:18:40,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:18:39" (1/1) ... [2025-03-04 06:18:40,225 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:18:39" (1/1) ... [2025-03-04 06:18:40,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:18:39" (1/1) ... [2025-03-04 06:18:40,238 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:18:39" (1/1) ... [2025-03-04 06:18:40,245 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:18:39" (1/1) ... [2025-03-04 06:18:40,257 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:18:40,258 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:18:40,259 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:18:40,259 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:18:40,260 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:18:39" (1/1) ... [2025-03-04 06:18:40,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:18:40,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:18:40,284 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-04 06:18:40,287 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-04 06:18:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2025-03-04 06:18:40,309 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2025-03-04 06:18:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 06:18:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 06:18:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 06:18:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 06:18:40,309 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 06:18:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 06:18:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 06:18:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 06:18:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 06:18:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 06:18:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 06:18:40,310 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 06:18:40,310 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 06:18:40,310 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 06:18:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:18:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:18:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 06:18:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 06:18:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 06:18:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:18:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 06:18:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 06:18:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 06:18:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:18:40,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 06:18:40,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 06:18:40,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 06:18:40,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:18:40,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:18:40,553 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:18:40,554 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:18:42,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L731: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-04 06:18:42,623 INFO L? ?]: Removed 806 outVars from TransFormulas that were not future-live. [2025-03-04 06:18:42,623 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:18:42,703 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:18:42,704 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 06:18:42,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:18:42 BoogieIcfgContainer [2025-03-04 06:18:42,704 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:18:42,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:18:42,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:18:42,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:18:42,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:18:39" (1/3) ... [2025-03-04 06:18:42,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54cb368e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:18:42, skipping insertion in model container [2025-03-04 06:18:42,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:18:39" (2/3) ... [2025-03-04 06:18:42,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54cb368e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:18:42, skipping insertion in model container [2025-03-04 06:18:42,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:18:42" (3/3) ... [2025-03-04 06:18:42,714 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test10-2.i [2025-03-04 06:18:42,725 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:18:42,726 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test10-2.i that has 6 procedures, 1057 locations, 1 initial locations, 83 loop locations, and 1 error locations. [2025-03-04 06:18:42,791 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:18:42,804 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;@67476a0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:18:42,804 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 06:18:42,811 INFO L276 IsEmpty]: Start isEmpty. Operand has 1049 states, 1030 states have (on average 1.6252427184466018) internal successors, (1674), 1035 states have internal predecessors, (1674), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 06:18:42,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 06:18:42,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:42,819 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:18:42,819 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:42,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:42,824 INFO L85 PathProgramCache]: Analyzing trace with hash -785307605, now seen corresponding path program 1 times [2025-03-04 06:18:42,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:42,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190134463] [2025-03-04 06:18:42,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:42,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:42,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 06:18:42,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 06:18:42,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:42,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:42,962 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-04 06:18:42,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:42,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190134463] [2025-03-04 06:18:42,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190134463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:42,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:18:42,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:18:42,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342767073] [2025-03-04 06:18:42,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:42,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 06:18:42,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:42,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 06:18:42,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:18:42,988 INFO L87 Difference]: Start difference. First operand has 1049 states, 1030 states have (on average 1.6252427184466018) internal successors, (1674), 1035 states have internal predecessors, (1674), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:18:43,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:43,201 INFO L93 Difference]: Finished difference Result 2096 states and 3410 transitions. [2025-03-04 06:18:43,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 06:18:43,203 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-04 06:18:43,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:43,213 INFO L225 Difference]: With dead ends: 2096 [2025-03-04 06:18:43,213 INFO L226 Difference]: Without dead ends: 1012 [2025-03-04 06:18:43,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:18:43,221 INFO L435 NwaCegarLoop]: 1426 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:43,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1426 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:18:43,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2025-03-04 06:18:43,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1012. [2025-03-04 06:18:43,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 994 states have (on average 1.4788732394366197) internal successors, (1470), 999 states have internal predecessors, (1470), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 06:18:43,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1497 transitions. [2025-03-04 06:18:43,293 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1497 transitions. Word has length 13 [2025-03-04 06:18:43,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:43,293 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1497 transitions. [2025-03-04 06:18:43,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:18:43,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1497 transitions. [2025-03-04 06:18:43,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 06:18:43,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:43,298 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:18:43,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:18:43,299 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:43,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:43,300 INFO L85 PathProgramCache]: Analyzing trace with hash -75367763, now seen corresponding path program 1 times [2025-03-04 06:18:43,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:43,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299788791] [2025-03-04 06:18:43,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:43,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:43,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 06:18:43,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 06:18:43,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:43,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:43,705 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-04 06:18:43,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:43,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299788791] [2025-03-04 06:18:43,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299788791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:43,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:18:43,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:18:43,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589589911] [2025-03-04 06:18:43,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:43,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:18:43,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:43,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:18:43,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:18:43,707 INFO L87 Difference]: Start difference. First operand 1012 states and 1497 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:18:44,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:44,108 INFO L93 Difference]: Finished difference Result 2018 states and 2988 transitions. [2025-03-04 06:18:44,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:18:44,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-04 06:18:44,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:44,118 INFO L225 Difference]: With dead ends: 2018 [2025-03-04 06:18:44,118 INFO L226 Difference]: Without dead ends: 1392 [2025-03-04 06:18:44,119 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-04 06:18:44,120 INFO L435 NwaCegarLoop]: 1373 mSDtfsCounter, 542 mSDsluCounter, 2680 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 4053 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:44,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 4053 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:18:44,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2025-03-04 06:18:44,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1014. [2025-03-04 06:18:44,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 996 states have (on average 1.4779116465863453) internal successors, (1472), 1001 states have internal predecessors, (1472), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 06:18:44,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1499 transitions. [2025-03-04 06:18:44,156 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1499 transitions. Word has length 66 [2025-03-04 06:18:44,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:44,156 INFO L471 AbstractCegarLoop]: Abstraction has 1014 states and 1499 transitions. [2025-03-04 06:18:44,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:18:44,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1499 transitions. [2025-03-04 06:18:44,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 06:18:44,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:44,160 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 06:18:44,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:18:44,161 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:44,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:44,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1641475536, now seen corresponding path program 1 times [2025-03-04 06:18:44,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:44,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546736757] [2025-03-04 06:18:44,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:44,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:44,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 06:18:44,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 06:18:44,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:44,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:44,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:18:44,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:44,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546736757] [2025-03-04 06:18:44,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546736757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:44,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:18:44,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 06:18:44,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732895370] [2025-03-04 06:18:44,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:44,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:18:44,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:44,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:18:44,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:18:44,715 INFO L87 Difference]: Start difference. First operand 1014 states and 1499 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:18:45,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:45,190 INFO L93 Difference]: Finished difference Result 2402 states and 3547 transitions. [2025-03-04 06:18:45,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:18:45,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2025-03-04 06:18:45,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:45,196 INFO L225 Difference]: With dead ends: 2402 [2025-03-04 06:18:45,196 INFO L226 Difference]: Without dead ends: 1392 [2025-03-04 06:18:45,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:18:45,201 INFO L435 NwaCegarLoop]: 1419 mSDtfsCounter, 1078 mSDsluCounter, 4074 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 5493 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:45,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 5493 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 06:18:45,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2025-03-04 06:18:45,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1017. [2025-03-04 06:18:45,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 999 states have (on average 1.4764764764764764) internal successors, (1475), 1004 states have internal predecessors, (1475), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 06:18:45,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1502 transitions. [2025-03-04 06:18:45,264 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1502 transitions. Word has length 141 [2025-03-04 06:18:45,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:45,264 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 1502 transitions. [2025-03-04 06:18:45,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:18:45,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1502 transitions. [2025-03-04 06:18:45,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-04 06:18:45,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:45,269 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:18:45,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:18:45,270 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:45,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:45,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1689625149, now seen corresponding path program 1 times [2025-03-04 06:18:45,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:45,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339147122] [2025-03-04 06:18:45,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:45,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:45,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-04 06:18:45,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-04 06:18:45,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:45,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:45,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:18:45,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:45,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339147122] [2025-03-04 06:18:45,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339147122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:45,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:18:45,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:18:45,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416364951] [2025-03-04 06:18:45,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:45,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:18:45,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:45,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:18:45,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:18:45,547 INFO L87 Difference]: Start difference. First operand 1017 states and 1502 transitions. Second operand has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:18:45,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:45,819 INFO L93 Difference]: Finished difference Result 2030 states and 3000 transitions. [2025-03-04 06:18:45,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:18:45,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210 [2025-03-04 06:18:45,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:45,823 INFO L225 Difference]: With dead ends: 2030 [2025-03-04 06:18:45,823 INFO L226 Difference]: Without dead ends: 1020 [2025-03-04 06:18:45,825 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-04 06:18:45,827 INFO L435 NwaCegarLoop]: 1350 mSDtfsCounter, 105 mSDsluCounter, 2616 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 3966 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:45,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 3966 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:18:45,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2025-03-04 06:18:45,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 1017. [2025-03-04 06:18:45,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 999 states have (on average 1.4694694694694694) internal successors, (1468), 1004 states have internal predecessors, (1468), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 06:18:45,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1495 transitions. [2025-03-04 06:18:45,852 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1495 transitions. Word has length 210 [2025-03-04 06:18:45,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:45,852 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 1495 transitions. [2025-03-04 06:18:45,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:18:45,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1495 transitions. [2025-03-04 06:18:45,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-04 06:18:45,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:45,854 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:18:45,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:18:45,854 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:45,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:45,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1866534525, now seen corresponding path program 1 times [2025-03-04 06:18:45,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:45,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137118693] [2025-03-04 06:18:45,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:45,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:45,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-04 06:18:45,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-04 06:18:45,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:45,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:46,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:18:46,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:46,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137118693] [2025-03-04 06:18:46,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137118693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:46,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:18:46,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:18:46,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517302101] [2025-03-04 06:18:46,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:46,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:18:46,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:46,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:18:46,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:18:46,058 INFO L87 Difference]: Start difference. First operand 1017 states and 1495 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:18:46,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:46,332 INFO L93 Difference]: Finished difference Result 2592 states and 3828 transitions. [2025-03-04 06:18:46,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:18:46,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210 [2025-03-04 06:18:46,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:46,338 INFO L225 Difference]: With dead ends: 2592 [2025-03-04 06:18:46,338 INFO L226 Difference]: Without dead ends: 1582 [2025-03-04 06:18:46,340 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-04 06:18:46,341 INFO L435 NwaCegarLoop]: 1368 mSDtfsCounter, 786 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 2718 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:46,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 2718 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:18:46,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2025-03-04 06:18:46,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1425. [2025-03-04 06:18:46,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1425 states, 1405 states have (on average 1.4761565836298933) internal successors, (2074), 1410 states have internal predecessors, (2074), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 06:18:46,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 2105 transitions. [2025-03-04 06:18:46,394 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 2105 transitions. Word has length 210 [2025-03-04 06:18:46,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:46,394 INFO L471 AbstractCegarLoop]: Abstraction has 1425 states and 2105 transitions. [2025-03-04 06:18:46,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:18:46,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 2105 transitions. [2025-03-04 06:18:46,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-04 06:18:46,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:46,397 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:18:46,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:18:46,397 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:46,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:46,398 INFO L85 PathProgramCache]: Analyzing trace with hash 977475382, now seen corresponding path program 1 times [2025-03-04 06:18:46,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:46,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676247480] [2025-03-04 06:18:46,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:46,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:46,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-04 06:18:46,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-04 06:18:46,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:46,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:46,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:18:46,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:46,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676247480] [2025-03-04 06:18:46,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676247480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:46,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:18:46,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:18:46,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786933024] [2025-03-04 06:18:46,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:46,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:18:46,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:46,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:18:46,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:18:46,708 INFO L87 Difference]: Start difference. First operand 1425 states and 2105 transitions. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:18:46,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:46,983 INFO L93 Difference]: Finished difference Result 2721 states and 4022 transitions. [2025-03-04 06:18:46,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:18:46,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 225 [2025-03-04 06:18:46,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:46,989 INFO L225 Difference]: With dead ends: 2721 [2025-03-04 06:18:46,989 INFO L226 Difference]: Without dead ends: 1428 [2025-03-04 06:18:46,991 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-04 06:18:46,991 INFO L435 NwaCegarLoop]: 1343 mSDtfsCounter, 105 mSDsluCounter, 2602 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 3945 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:46,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 3945 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:18:46,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2025-03-04 06:18:47,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1425. [2025-03-04 06:18:47,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1425 states, 1405 states have (on average 1.4711743772241992) internal successors, (2067), 1410 states have internal predecessors, (2067), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 06:18:47,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 2098 transitions. [2025-03-04 06:18:47,021 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 2098 transitions. Word has length 225 [2025-03-04 06:18:47,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:47,022 INFO L471 AbstractCegarLoop]: Abstraction has 1425 states and 2098 transitions. [2025-03-04 06:18:47,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:18:47,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 2098 transitions. [2025-03-04 06:18:47,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-04 06:18:47,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:47,024 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:18:47,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:18:47,025 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:47,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:47,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1841799869, now seen corresponding path program 1 times [2025-03-04 06:18:47,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:47,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123241257] [2025-03-04 06:18:47,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:47,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:47,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-04 06:18:47,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-04 06:18:47,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:47,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:47,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:18:47,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:47,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123241257] [2025-03-04 06:18:47,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123241257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:47,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:18:47,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:18:47,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790131305] [2025-03-04 06:18:47,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:47,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:18:47,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:47,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:18:47,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:18:47,290 INFO L87 Difference]: Start difference. First operand 1425 states and 2098 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:18:47,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:47,592 INFO L93 Difference]: Finished difference Result 3322 states and 4900 transitions. [2025-03-04 06:18:47,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:18:47,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 225 [2025-03-04 06:18:47,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:47,603 INFO L225 Difference]: With dead ends: 3322 [2025-03-04 06:18:47,603 INFO L226 Difference]: Without dead ends: 2029 [2025-03-04 06:18:47,606 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-04 06:18:47,606 INFO L435 NwaCegarLoop]: 1361 mSDtfsCounter, 744 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 2704 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:47,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 2704 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:18:47,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2025-03-04 06:18:47,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 2024. [2025-03-04 06:18:47,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2024 states, 1998 states have (on average 1.472972972972973) internal successors, (2943), 2003 states have internal predecessors, (2943), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 06:18:47,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2986 transitions. [2025-03-04 06:18:47,663 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2986 transitions. Word has length 225 [2025-03-04 06:18:47,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:47,664 INFO L471 AbstractCegarLoop]: Abstraction has 2024 states and 2986 transitions. [2025-03-04 06:18:47,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:18:47,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2986 transitions. [2025-03-04 06:18:47,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-04 06:18:47,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:47,668 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:18:47,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:18:47,668 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:47,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:47,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1733276465, now seen corresponding path program 1 times [2025-03-04 06:18:47,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:47,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672633771] [2025-03-04 06:18:47,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:47,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:47,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-04 06:18:47,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-04 06:18:47,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:47,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:18:48,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:48,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672633771] [2025-03-04 06:18:48,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672633771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:48,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:18:48,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:18:48,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115126088] [2025-03-04 06:18:48,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:48,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:18:48,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:48,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:18:48,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:18:48,010 INFO L87 Difference]: Start difference. First operand 2024 states and 2986 transitions. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 06:18:48,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:48,427 INFO L93 Difference]: Finished difference Result 3308 states and 4882 transitions. [2025-03-04 06:18:48,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:18:48,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 240 [2025-03-04 06:18:48,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:48,433 INFO L225 Difference]: With dead ends: 3308 [2025-03-04 06:18:48,433 INFO L226 Difference]: Without dead ends: 1601 [2025-03-04 06:18:48,435 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-04 06:18:48,436 INFO L435 NwaCegarLoop]: 1457 mSDtfsCounter, 2652 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2652 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:48,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2652 Valid, 1706 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 06:18:48,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2025-03-04 06:18:48,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1601. [2025-03-04 06:18:48,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1580 states have (on average 1.4645569620253165) internal successors, (2314), 1585 states have internal predecessors, (2314), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 06:18:48,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2347 transitions. [2025-03-04 06:18:48,471 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2347 transitions. Word has length 240 [2025-03-04 06:18:48,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:48,471 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2347 transitions. [2025-03-04 06:18:48,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 06:18:48,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2347 transitions. [2025-03-04 06:18:48,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-04 06:18:48,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:48,474 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:18:48,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:18:48,474 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:48,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:48,474 INFO L85 PathProgramCache]: Analyzing trace with hash 7572547, now seen corresponding path program 1 times [2025-03-04 06:18:48,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:48,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648298441] [2025-03-04 06:18:48,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:48,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:48,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-04 06:18:48,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-04 06:18:48,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:48,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:48,836 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 06:18:48,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:48,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648298441] [2025-03-04 06:18:48,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648298441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:48,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:18:48,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:18:48,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140863719] [2025-03-04 06:18:48,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:48,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:18:48,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:48,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:18:48,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:18:48,838 INFO L87 Difference]: Start difference. First operand 1601 states and 2347 transitions. Second operand has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:18:49,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:49,093 INFO L93 Difference]: Finished difference Result 2465 states and 3636 transitions. [2025-03-04 06:18:49,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:18:49,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 250 [2025-03-04 06:18:49,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:49,099 INFO L225 Difference]: With dead ends: 2465 [2025-03-04 06:18:49,099 INFO L226 Difference]: Without dead ends: 1559 [2025-03-04 06:18:49,100 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-04 06:18:49,101 INFO L435 NwaCegarLoop]: 1269 mSDtfsCounter, 30 mSDsluCounter, 2519 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3788 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:49,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3788 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:18:49,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2025-03-04 06:18:49,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1559. [2025-03-04 06:18:49,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1538 states have (on average 1.4544863459037711) internal successors, (2237), 1543 states have internal predecessors, (2237), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 06:18:49,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2270 transitions. [2025-03-04 06:18:49,136 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2270 transitions. Word has length 250 [2025-03-04 06:18:49,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:49,136 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2270 transitions. [2025-03-04 06:18:49,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:18:49,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2270 transitions. [2025-03-04 06:18:49,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-04 06:18:49,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:49,139 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:18:49,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:18:49,139 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:49,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:49,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1378371172, now seen corresponding path program 1 times [2025-03-04 06:18:49,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:49,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863283778] [2025-03-04 06:18:49,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:49,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:49,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-04 06:18:49,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-04 06:18:49,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:49,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:49,934 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:18:49,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:49,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863283778] [2025-03-04 06:18:49,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863283778] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:18:49,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722271996] [2025-03-04 06:18:49,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:49,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:18:49,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:18:49,939 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-04 06:18:49,941 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-04 06:18:50,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-04 06:18:50,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-04 06:18:50,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:50,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:50,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 1260 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 06:18:50,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:18:50,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:18:50,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 06:18:50,922 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:18:50,924 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:18:50,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722271996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:50,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:18:50,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-03-04 06:18:50,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99236553] [2025-03-04 06:18:50,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:50,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:18:50,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:50,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:18:50,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-04 06:18:50,926 INFO L87 Difference]: Start difference. First operand 1559 states and 2270 transitions. Second operand has 7 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:18:51,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:51,605 INFO L93 Difference]: Finished difference Result 2829 states and 4122 transitions. [2025-03-04 06:18:51,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:18:51,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 250 [2025-03-04 06:18:51,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:51,614 INFO L225 Difference]: With dead ends: 2829 [2025-03-04 06:18:51,615 INFO L226 Difference]: Without dead ends: 1962 [2025-03-04 06:18:51,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 239 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-04 06:18:51,617 INFO L435 NwaCegarLoop]: 1227 mSDtfsCounter, 1485 mSDsluCounter, 4079 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 5306 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:51,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 5306 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 06:18:51,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2025-03-04 06:18:51,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1769. [2025-03-04 06:18:51,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1738 states have (on average 1.4499424626006905) internal successors, (2520), 1747 states have internal predecessors, (2520), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (23), 17 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 06:18:51,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2567 transitions. [2025-03-04 06:18:51,659 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2567 transitions. Word has length 250 [2025-03-04 06:18:51,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:51,659 INFO L471 AbstractCegarLoop]: Abstraction has 1769 states and 2567 transitions. [2025-03-04 06:18:51,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:18:51,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2567 transitions. [2025-03-04 06:18:51,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-04 06:18:51,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:51,664 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:18:51,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 06:18:51,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 06:18:51,865 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:51,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:51,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1548604866, now seen corresponding path program 1 times [2025-03-04 06:18:51,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:51,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906954351] [2025-03-04 06:18:51,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:51,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:51,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-04 06:18:52,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-04 06:18:52,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:52,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:52,955 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 72 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:18:52,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:52,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906954351] [2025-03-04 06:18:52,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906954351] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:18:52,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992746178] [2025-03-04 06:18:52,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:52,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:18:52,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:18:52,957 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-04 06:18:52,959 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-04 06:18:53,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-04 06:18:53,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-04 06:18:53,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:53,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:53,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 1639 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:18:53,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:18:53,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 06:18:53,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:18:53,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 06:18:53,858 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 72 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:18:53,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:18:54,109 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 72 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:18:54,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992746178] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:18:54,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:18:54,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 12 [2025-03-04 06:18:54,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752463776] [2025-03-04 06:18:54,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:18:54,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 06:18:54,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:54,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 06:18:54,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-04 06:18:54,111 INFO L87 Difference]: Start difference. First operand 1769 states and 2567 transitions. Second operand has 12 states, 12 states have (on average 39.5) internal successors, (474), 12 states have internal predecessors, (474), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 06:18:54,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:54,935 INFO L93 Difference]: Finished difference Result 4399 states and 6351 transitions. [2025-03-04 06:18:54,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 06:18:54,936 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 39.5) internal successors, (474), 12 states have internal predecessors, (474), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 325 [2025-03-04 06:18:54,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:54,948 INFO L225 Difference]: With dead ends: 4399 [2025-03-04 06:18:54,948 INFO L226 Difference]: Without dead ends: 2947 [2025-03-04 06:18:54,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 661 GetRequests, 640 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2025-03-04 06:18:54,952 INFO L435 NwaCegarLoop]: 1255 mSDtfsCounter, 3406 mSDsluCounter, 5616 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3424 SdHoareTripleChecker+Valid, 6871 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:54,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3424 Valid, 6871 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 06:18:54,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2025-03-04 06:18:55,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 2581. [2025-03-04 06:18:55,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2581 states, 2538 states have (on average 1.4357762017336486) internal successors, (3644), 2547 states have internal predecessors, (3644), 35 states have call successors, (35), 7 states have call predecessors, (35), 7 states have return successors, (34), 28 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 06:18:55,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2581 states to 2581 states and 3713 transitions. [2025-03-04 06:18:55,018 INFO L78 Accepts]: Start accepts. Automaton has 2581 states and 3713 transitions. Word has length 325 [2025-03-04 06:18:55,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:55,019 INFO L471 AbstractCegarLoop]: Abstraction has 2581 states and 3713 transitions. [2025-03-04 06:18:55,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 39.5) internal successors, (474), 12 states have internal predecessors, (474), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 06:18:55,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2581 states and 3713 transitions. [2025-03-04 06:18:55,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 758 [2025-03-04 06:18:55,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:55,030 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:18:55,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 06:18:55,231 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,SelfDestructingSolverStorable10 [2025-03-04 06:18:55,231 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:55,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:55,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1035103065, now seen corresponding path program 1 times [2025-03-04 06:18:55,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:55,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427029541] [2025-03-04 06:18:55,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:55,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:55,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 757 statements into 1 equivalence classes. [2025-03-04 06:18:55,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 757 of 757 statements. [2025-03-04 06:18:55,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:55,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:59,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 288 proven. 872 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:18:59,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:59,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427029541] [2025-03-04 06:18:59,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427029541] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:18:59,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330995733] [2025-03-04 06:18:59,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:59,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:18:59,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:18:59,432 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:18:59,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 06:18:59,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 757 statements into 1 equivalence classes. [2025-03-04 06:19:00,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 757 of 757 statements. [2025-03-04 06:19:00,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:00,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:00,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 3754 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 06:19:00,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:19:00,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 06:19:00,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:19:00,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:19:01,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:19:01,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:19:01,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 06:19:01,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 288 proven. 872 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:19:01,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:19:01,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 288 proven. 872 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:19:01,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330995733] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:19:01,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:19:01,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 21 [2025-03-04 06:19:01,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162003650] [2025-03-04 06:19:01,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:19:01,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 06:19:01,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:01,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 06:19:01,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2025-03-04 06:19:01,824 INFO L87 Difference]: Start difference. First operand 2581 states and 3713 transitions. Second operand has 21 states, 21 states have (on average 64.0) internal successors, (1344), 21 states have internal predecessors, (1344), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 06:19:03,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:03,287 INFO L93 Difference]: Finished difference Result 6625 states and 9522 transitions. [2025-03-04 06:19:03,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 06:19:03,288 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 64.0) internal successors, (1344), 21 states have internal predecessors, (1344), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 757 [2025-03-04 06:19:03,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:03,306 INFO L225 Difference]: With dead ends: 6625 [2025-03-04 06:19:03,306 INFO L226 Difference]: Without dead ends: 5173 [2025-03-04 06:19:03,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1537 GetRequests, 1501 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=286, Invalid=644, Unknown=0, NotChecked=0, Total=930 [2025-03-04 06:19:03,311 INFO L435 NwaCegarLoop]: 1255 mSDtfsCounter, 8012 mSDsluCounter, 10409 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8054 SdHoareTripleChecker+Valid, 11664 SdHoareTripleChecker+Invalid, 1492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:03,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8054 Valid, 11664 Invalid, 1492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 06:19:03,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5173 states. [2025-03-04 06:19:03,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5173 to 4807. [2025-03-04 06:19:03,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4807 states, 4740 states have (on average 1.4270042194092827) internal successors, (6764), 4749 states have internal predecessors, (6764), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-04 06:19:03,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4807 states to 4807 states and 6881 transitions. [2025-03-04 06:19:03,416 INFO L78 Accepts]: Start accepts. Automaton has 4807 states and 6881 transitions. Word has length 757 [2025-03-04 06:19:03,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:03,417 INFO L471 AbstractCegarLoop]: Abstraction has 4807 states and 6881 transitions. [2025-03-04 06:19:03,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 64.0) internal successors, (1344), 21 states have internal predecessors, (1344), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 06:19:03,421 INFO L276 IsEmpty]: Start isEmpty. Operand 4807 states and 6881 transitions. [2025-03-04 06:19:03,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1622 [2025-03-04 06:19:03,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:03,573 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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] [2025-03-04 06:19:03,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 06:19:03,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:19:03,789 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:03,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:03,792 INFO L85 PathProgramCache]: Analyzing trace with hash -60524657, now seen corresponding path program 2 times [2025-03-04 06:19:03,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:03,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322274660] [2025-03-04 06:19:03,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:19:03,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:04,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1621 statements into 2 equivalence classes. [2025-03-04 06:19:04,222 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 76 of 1621 statements. [2025-03-04 06:19:04,222 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:19:04,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:04,389 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-04 06:19:04,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:04,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322274660] [2025-03-04 06:19:04,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322274660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:19:04,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:19:04,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 06:19:04,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429773106] [2025-03-04 06:19:04,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:19:04,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:19:04,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:04,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:19:04,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:19:04,392 INFO L87 Difference]: Start difference. First operand 4807 states and 6881 transitions. Second operand has 8 states, 8 states have (on average 29.625) internal successors, (237), 8 states have internal predecessors, (237), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:19:05,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:05,193 INFO L93 Difference]: Finished difference Result 5668 states and 8162 transitions. [2025-03-04 06:19:05,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:19:05,194 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.625) internal successors, (237), 8 states have internal predecessors, (237), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1621 [2025-03-04 06:19:05,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:05,207 INFO L225 Difference]: With dead ends: 5668 [2025-03-04 06:19:05,207 INFO L226 Difference]: Without dead ends: 4822 [2025-03-04 06:19:05,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-04 06:19:05,210 INFO L435 NwaCegarLoop]: 1275 mSDtfsCounter, 53 mSDsluCounter, 6051 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 7326 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:05,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 7326 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 06:19:05,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4822 states. [2025-03-04 06:19:05,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4822 to 4818. [2025-03-04 06:19:05,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4818 states, 4751 states have (on average 1.4260155756682804) internal successors, (6775), 4760 states have internal predecessors, (6775), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-04 06:19:05,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4818 states to 4818 states and 6892 transitions. [2025-03-04 06:19:05,292 INFO L78 Accepts]: Start accepts. Automaton has 4818 states and 6892 transitions. Word has length 1621 [2025-03-04 06:19:05,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:05,294 INFO L471 AbstractCegarLoop]: Abstraction has 4818 states and 6892 transitions. [2025-03-04 06:19:05,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.625) internal successors, (237), 8 states have internal predecessors, (237), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:19:05,294 INFO L276 IsEmpty]: Start isEmpty. Operand 4818 states and 6892 transitions. [2025-03-04 06:19:05,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1623 [2025-03-04 06:19:05,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:05,312 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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] [2025-03-04 06:19:05,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:19:05,312 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:05,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:05,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1888617809, now seen corresponding path program 1 times [2025-03-04 06:19:05,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:05,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760054633] [2025-03-04 06:19:05,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:05,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:05,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1622 statements into 1 equivalence classes. [2025-03-04 06:19:06,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1622 of 1622 statements. [2025-03-04 06:19:06,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:06,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:09,538 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-04 06:19:09,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:09,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760054633] [2025-03-04 06:19:09,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760054633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:19:09,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:19:09,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 06:19:09,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325454584] [2025-03-04 06:19:09,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:19:09,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:19:09,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:09,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:19:09,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:19:09,542 INFO L87 Difference]: Start difference. First operand 4818 states and 6892 transitions. Second operand has 8 states, 8 states have (on average 29.75) internal successors, (238), 8 states have internal predecessors, (238), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:19:10,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:10,172 INFO L93 Difference]: Finished difference Result 5662 states and 8148 transitions. [2025-03-04 06:19:10,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:19:10,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.75) internal successors, (238), 8 states have internal predecessors, (238), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1622 [2025-03-04 06:19:10,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:10,189 INFO L225 Difference]: With dead ends: 5662 [2025-03-04 06:19:10,190 INFO L226 Difference]: Without dead ends: 4826 [2025-03-04 06:19:10,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:19:10,194 INFO L435 NwaCegarLoop]: 1280 mSDtfsCounter, 24 mSDsluCounter, 7271 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 8551 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:10,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 8551 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1277 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 06:19:10,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4826 states. [2025-03-04 06:19:10,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4826 to 4818. [2025-03-04 06:19:10,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4818 states, 4751 states have (on average 1.4260155756682804) internal successors, (6775), 4760 states have internal predecessors, (6775), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-04 06:19:10,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4818 states to 4818 states and 6892 transitions. [2025-03-04 06:19:10,315 INFO L78 Accepts]: Start accepts. Automaton has 4818 states and 6892 transitions. Word has length 1622 [2025-03-04 06:19:10,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:10,317 INFO L471 AbstractCegarLoop]: Abstraction has 4818 states and 6892 transitions. [2025-03-04 06:19:10,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.75) internal successors, (238), 8 states have internal predecessors, (238), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:19:10,318 INFO L276 IsEmpty]: Start isEmpty. Operand 4818 states and 6892 transitions. [2025-03-04 06:19:10,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1623 [2025-03-04 06:19:10,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:10,352 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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] [2025-03-04 06:19:10,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:19:10,352 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:10,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:10,354 INFO L85 PathProgramCache]: Analyzing trace with hash -690799592, now seen corresponding path program 1 times [2025-03-04 06:19:10,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:10,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545385265] [2025-03-04 06:19:10,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:10,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:10,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1622 statements into 1 equivalence classes. [2025-03-04 06:19:11,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1622 of 1622 statements. [2025-03-04 06:19:11,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:11,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:14,602 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-04 06:19:14,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:14,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545385265] [2025-03-04 06:19:14,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545385265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:19:14,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:19:14,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:19:14,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321135614] [2025-03-04 06:19:14,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:19:14,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:19:14,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:14,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:19:14,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:19:14,604 INFO L87 Difference]: Start difference. First operand 4818 states and 6892 transitions. Second operand has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:19:15,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:15,251 INFO L93 Difference]: Finished difference Result 5668 states and 8157 transitions. [2025-03-04 06:19:15,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:19:15,251 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1622 [2025-03-04 06:19:15,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:15,262 INFO L225 Difference]: With dead ends: 5668 [2025-03-04 06:19:15,262 INFO L226 Difference]: Without dead ends: 4823 [2025-03-04 06:19:15,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:19:15,267 INFO L435 NwaCegarLoop]: 1281 mSDtfsCounter, 20 mSDsluCounter, 6036 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 7317 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:15,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 7317 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 06:19:15,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4823 states. [2025-03-04 06:19:15,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4823 to 4822. [2025-03-04 06:19:15,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4822 states, 4755 states have (on average 1.4258675078864353) internal successors, (6780), 4764 states have internal predecessors, (6780), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-04 06:19:15,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4822 states to 4822 states and 6897 transitions. [2025-03-04 06:19:15,347 INFO L78 Accepts]: Start accepts. Automaton has 4822 states and 6897 transitions. Word has length 1622 [2025-03-04 06:19:15,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:15,349 INFO L471 AbstractCegarLoop]: Abstraction has 4822 states and 6897 transitions. [2025-03-04 06:19:15,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:19:15,350 INFO L276 IsEmpty]: Start isEmpty. Operand 4822 states and 6897 transitions. [2025-03-04 06:19:15,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1624 [2025-03-04 06:19:15,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:15,368 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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] [2025-03-04 06:19:15,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:19:15,369 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:15,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:15,370 INFO L85 PathProgramCache]: Analyzing trace with hash -396925290, now seen corresponding path program 1 times [2025-03-04 06:19:15,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:15,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014045686] [2025-03-04 06:19:15,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:15,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:15,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1623 statements into 1 equivalence classes. [2025-03-04 06:19:16,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1623 of 1623 statements. [2025-03-04 06:19:16,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:16,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:19,602 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-04 06:19:19,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:19,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014045686] [2025-03-04 06:19:19,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014045686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:19:19,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:19:19,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:19:19,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365385339] [2025-03-04 06:19:19,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:19:19,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 06:19:19,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:19,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 06:19:19,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:19:19,606 INFO L87 Difference]: Start difference. First operand 4822 states and 6897 transitions. Second operand has 9 states, 9 states have (on average 26.555555555555557) internal successors, (239), 9 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:19:20,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:20,540 INFO L93 Difference]: Finished difference Result 5674 states and 8164 transitions. [2025-03-04 06:19:20,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:19:20,540 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 26.555555555555557) internal successors, (239), 9 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1623 [2025-03-04 06:19:20,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:20,552 INFO L225 Difference]: With dead ends: 5674 [2025-03-04 06:19:20,552 INFO L226 Difference]: Without dead ends: 4833 [2025-03-04 06:19:20,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 06:19:20,556 INFO L435 NwaCegarLoop]: 1275 mSDtfsCounter, 31 mSDsluCounter, 8555 mSDsCounter, 0 mSdLazyCounter, 1388 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 9830 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:20,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 9830 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1388 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 06:19:20,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4833 states. [2025-03-04 06:19:20,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4833 to 4830. [2025-03-04 06:19:20,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4830 states, 4763 states have (on average 1.425572118412765) internal successors, (6790), 4772 states have internal predecessors, (6790), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-04 06:19:20,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4830 states to 4830 states and 6907 transitions. [2025-03-04 06:19:20,667 INFO L78 Accepts]: Start accepts. Automaton has 4830 states and 6907 transitions. Word has length 1623 [2025-03-04 06:19:20,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:20,669 INFO L471 AbstractCegarLoop]: Abstraction has 4830 states and 6907 transitions. [2025-03-04 06:19:20,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.555555555555557) internal successors, (239), 9 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:19:20,669 INFO L276 IsEmpty]: Start isEmpty. Operand 4830 states and 6907 transitions. [2025-03-04 06:19:20,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1625 [2025-03-04 06:19:20,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:20,702 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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] [2025-03-04 06:19:20,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:19:20,702 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:20,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:20,704 INFO L85 PathProgramCache]: Analyzing trace with hash 680238828, now seen corresponding path program 1 times [2025-03-04 06:19:20,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:20,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941165522] [2025-03-04 06:19:20,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:20,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:21,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1624 statements into 1 equivalence classes. [2025-03-04 06:19:21,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1624 of 1624 statements. [2025-03-04 06:19:21,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:21,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:26,521 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 1961 proven. 74 refuted. 0 times theorem prover too weak. 5203 trivial. 0 not checked. [2025-03-04 06:19:26,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:26,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941165522] [2025-03-04 06:19:26,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941165522] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:19:26,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711493981] [2025-03-04 06:19:26,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:26,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:19:26,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:19:26,525 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:19:26,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 06:19:27,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1624 statements into 1 equivalence classes. [2025-03-04 06:19:28,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1624 of 1624 statements. [2025-03-04 06:19:28,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:28,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:28,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 7984 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 06:19:28,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:19:29,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:19:29,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:19:29,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:19:29,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:19:29,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:19:29,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:19:30,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:19:30,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:19:30,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:19:30,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:19:30,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:19:30,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 06:19:30,526 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 42 proven. 7172 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:19:30,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:19:32,044 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 42 proven. 7172 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:19:32,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711493981] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:19:32,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:19:32,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 16] total 34 [2025-03-04 06:19:32,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089620973] [2025-03-04 06:19:32,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:19:32,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 06:19:32,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:32,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 06:19:32,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=735, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 06:19:32,051 INFO L87 Difference]: Start difference. First operand 4830 states and 6907 transitions. Second operand has 34 states, 34 states have (on average 97.11764705882354) internal successors, (3302), 34 states have internal predecessors, (3302), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 06:19:36,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 06:19:38,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:38,793 INFO L93 Difference]: Finished difference Result 9984 states and 14288 transitions. [2025-03-04 06:19:38,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-03-04 06:19:38,794 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 97.11764705882354) internal successors, (3302), 34 states have internal predecessors, (3302), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 1624 [2025-03-04 06:19:38,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:38,811 INFO L225 Difference]: With dead ends: 9984 [2025-03-04 06:19:38,811 INFO L226 Difference]: Without dead ends: 9078 [2025-03-04 06:19:38,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3303 GetRequests, 3217 SyntacticMatches, 7 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1731, Invalid=4749, Unknown=0, NotChecked=0, Total=6480 [2025-03-04 06:19:38,817 INFO L435 NwaCegarLoop]: 1222 mSDtfsCounter, 13604 mSDsluCounter, 12097 mSDsCounter, 0 mSdLazyCounter, 1950 mSolverCounterSat, 57 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13676 SdHoareTripleChecker+Valid, 13319 SdHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1950 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:38,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13676 Valid, 13319 Invalid, 2008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1950 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2025-03-04 06:19:38,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9078 states. [2025-03-04 06:19:38,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9078 to 9076. [2025-03-04 06:19:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9076 states, 8943 states have (on average 1.418539639941854) internal successors, (12686), 8952 states have internal predecessors, (12686), 125 states have call successors, (125), 7 states have call predecessors, (125), 7 states have return successors, (124), 118 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-04 06:19:38,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9076 states to 9076 states and 12935 transitions. [2025-03-04 06:19:38,999 INFO L78 Accepts]: Start accepts. Automaton has 9076 states and 12935 transitions. Word has length 1624 [2025-03-04 06:19:39,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:39,000 INFO L471 AbstractCegarLoop]: Abstraction has 9076 states and 12935 transitions. [2025-03-04 06:19:39,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 97.11764705882354) internal successors, (3302), 34 states have internal predecessors, (3302), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 06:19:39,001 INFO L276 IsEmpty]: Start isEmpty. Operand 9076 states and 12935 transitions. [2025-03-04 06:19:39,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3275 [2025-03-04 06:19:39,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:39,058 INFO L218 NwaCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 32, 32, 32, 23, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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] [2025-03-04 06:19:39,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 06:19:39,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 06:19:39,259 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:39,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:39,261 INFO L85 PathProgramCache]: Analyzing trace with hash 507699052, now seen corresponding path program 2 times [2025-03-04 06:19:39,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:39,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920305287] [2025-03-04 06:19:39,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:19:39,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:39,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3274 statements into 2 equivalence classes. [2025-03-04 06:19:39,921 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 79 of 3274 statements. [2025-03-04 06:19:39,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:19:39,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:40,372 INFO L134 CoverageAnalysis]: Checked inductivity of 42713 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42713 trivial. 0 not checked. [2025-03-04 06:19:40,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:40,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920305287] [2025-03-04 06:19:40,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920305287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:19:40,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:19:40,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 06:19:40,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411031327] [2025-03-04 06:19:40,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:19:40,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 06:19:40,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:40,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 06:19:40,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-04 06:19:40,376 INFO L87 Difference]: Start difference. First operand 9076 states and 12935 transitions. Second operand has 13 states, 13 states have (on average 18.46153846153846) internal successors, (240), 13 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:19:41,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:41,871 INFO L93 Difference]: Finished difference Result 9942 states and 14220 transitions. [2025-03-04 06:19:41,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 06:19:41,872 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 18.46153846153846) internal successors, (240), 13 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 3274 [2025-03-04 06:19:41,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:41,890 INFO L225 Difference]: With dead ends: 9942 [2025-03-04 06:19:41,891 INFO L226 Difference]: Without dead ends: 9121 [2025-03-04 06:19:41,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-04 06:19:41,896 INFO L435 NwaCegarLoop]: 1282 mSDtfsCounter, 85 mSDsluCounter, 12370 mSDsCounter, 0 mSdLazyCounter, 2141 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 13652 SdHoareTripleChecker+Invalid, 2148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:41,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 13652 Invalid, 2148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2141 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 06:19:41,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9121 states. [2025-03-04 06:19:42,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9121 to 9082. [2025-03-04 06:19:42,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9082 states, 8949 states have (on average 1.4184825120125153) internal successors, (12694), 8958 states have internal predecessors, (12694), 125 states have call successors, (125), 7 states have call predecessors, (125), 7 states have return successors, (124), 118 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-04 06:19:42,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9082 states to 9082 states and 12943 transitions. [2025-03-04 06:19:42,091 INFO L78 Accepts]: Start accepts. Automaton has 9082 states and 12943 transitions. Word has length 3274 [2025-03-04 06:19:42,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:42,095 INFO L471 AbstractCegarLoop]: Abstraction has 9082 states and 12943 transitions. [2025-03-04 06:19:42,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.46153846153846) internal successors, (240), 13 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:19:42,096 INFO L276 IsEmpty]: Start isEmpty. Operand 9082 states and 12943 transitions. [2025-03-04 06:19:42,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3275 [2025-03-04 06:19:42,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:42,157 INFO L218 NwaCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 32, 32, 32, 23, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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] [2025-03-04 06:19:42,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:19:42,158 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:42,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:42,159 INFO L85 PathProgramCache]: Analyzing trace with hash -354217387, now seen corresponding path program 1 times [2025-03-04 06:19:42,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:42,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4173658] [2025-03-04 06:19:42,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:42,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:42,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3274 statements into 1 equivalence classes. [2025-03-04 06:19:44,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3274 of 3274 statements. [2025-03-04 06:19:44,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:44,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat