./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_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 3db5e6ee1090a5741e563a010c3676d5357df7fec89fabe5a888b2d307357a0e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:19:11,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:19:11,952 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 21:19:11,955 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:19:11,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:19:11,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:19:11,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:19:11,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:19:11,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 21:19:11,974 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 21:19:11,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:19:11,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:19:11,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:19:11,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:19:11,975 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:19:11,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:19:11,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:19:11,976 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:19:11,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:19:11,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:19:11,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:19:11,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:19:11,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:19:11,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:19:11,976 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:19:11,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:19:11,976 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:19:11,976 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:19:11,976 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:19:11,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:19:11,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 21:19:11,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:19:11,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:19:11,976 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:19:11,976 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:19:11,976 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:19:11,977 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:19:11,977 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:19:11,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:19:11,977 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:19:11,977 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:19:11,977 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:19:11,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:19:11,977 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 -> 3db5e6ee1090a5741e563a010c3676d5357df7fec89fabe5a888b2d307357a0e [2025-03-08 21:19:12,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:19:12,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:19:12,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:19:12,193 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:19:12,193 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:19:12,194 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-2.i [2025-03-08 21:19:13,291 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/579af7302/ae62a41a72954b82a039b8f9ff6ea4a6/FLAGe896a0205 [2025-03-08 21:19:13,624 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:19:13,624 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-2.i [2025-03-08 21:19:13,646 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/579af7302/ae62a41a72954b82a039b8f9ff6ea4a6/FLAGe896a0205 [2025-03-08 21:19:13,658 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/579af7302/ae62a41a72954b82a039b8f9ff6ea4a6 [2025-03-08 21:19:13,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:19:13,662 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:19:13,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:19:13,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:19:13,666 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:19:13,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:19:13" (1/1) ... [2025-03-08 21:19:13,668 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5403b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:19:13, skipping insertion in model container [2025-03-08 21:19:13,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:19:13" (1/1) ... [2025-03-08 21:19:13,708 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:19:13,981 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_JEN_test10-2.i[33022,33035] [2025-03-08 21:19:14,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:19:14,142 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:19:14,172 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_JEN_test10-2.i[33022,33035] [2025-03-08 21:19:14,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:19:14,284 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:19:14,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:19:14 WrapperNode [2025-03-08 21:19:14,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:19:14,287 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:19:14,287 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:19:14,287 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:19:14,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:19:14" (1/1) ... [2025-03-08 21:19:14,317 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:19:14" (1/1) ... [2025-03-08 21:19:14,400 INFO L138 Inliner]: procedures = 177, calls = 557, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3464 [2025-03-08 21:19:14,401 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:19:14,401 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:19:14,401 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:19:14,401 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:19:14,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:19:14" (1/1) ... [2025-03-08 21:19:14,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:19:14" (1/1) ... [2025-03-08 21:19:14,426 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:19:14" (1/1) ... [2025-03-08 21:19:14,563 INFO L175 MemorySlicer]: Split 528 memory accesses to 3 slices as follows [2, 420, 106]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 94 writes are split as follows [0, 90, 4]. [2025-03-08 21:19:14,563 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:19:14" (1/1) ... [2025-03-08 21:19:14,563 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:19:14" (1/1) ... [2025-03-08 21:19:14,621 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:19:14" (1/1) ... [2025-03-08 21:19:14,627 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:19:14" (1/1) ... [2025-03-08 21:19:14,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:19:14" (1/1) ... [2025-03-08 21:19:14,645 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:19:14" (1/1) ... [2025-03-08 21:19:14,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:19:14,660 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:19:14,660 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:19:14,660 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:19:14,660 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:19:14" (1/1) ... [2025-03-08 21:19:14,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:19:14,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:19:14,686 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 21:19:14,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 21:19:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2025-03-08 21:19:14,705 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2025-03-08 21:19:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 21:19:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 21:19:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 21:19:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 21:19:14,705 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 21:19:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 21:19:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 21:19:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 21:19:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-08 21:19:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-08 21:19:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-08 21:19:14,705 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-08 21:19:14,705 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-08 21:19:14,705 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-08 21:19:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 21:19:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:19:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 21:19:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 21:19:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 21:19:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 21:19:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 21:19:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 21:19:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 21:19:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 21:19:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 21:19:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 21:19:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 21:19:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:19:14,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:19:14,945 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:19:14,946 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:19:17,187 INFO L1307 $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-08 21:19:17,389 INFO L? ?]: Removed 806 outVars from TransFormulas that were not future-live. [2025-03-08 21:19:17,390 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:19:17,478 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:19:17,482 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-08 21:19:17,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:19:17 BoogieIcfgContainer [2025-03-08 21:19:17,483 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:19:17,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:19:17,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:19:17,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:19:17,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:19:13" (1/3) ... [2025-03-08 21:19:17,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a32a298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:19:17, skipping insertion in model container [2025-03-08 21:19:17,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:19:14" (2/3) ... [2025-03-08 21:19:17,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a32a298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:19:17, skipping insertion in model container [2025-03-08 21:19:17,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:19:17" (3/3) ... [2025-03-08 21:19:17,491 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test10-2.i [2025-03-08 21:19:17,503 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:19:17,504 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test10-2.i that has 6 procedures, 1057 locations, 1 initial locations, 83 loop locations, and 1 error locations. [2025-03-08 21:19:17,574 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:19:17,583 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;@4704b399, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:19:17,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 21:19:17,589 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-08 21:19:17,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 21:19:17,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:19:17,597 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:19:17,597 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:19:17,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:19:17,601 INFO L85 PathProgramCache]: Analyzing trace with hash -785307605, now seen corresponding path program 1 times [2025-03-08 21:19:17,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:19:17,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892484748] [2025-03-08 21:19:17,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:19:17,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:19:17,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 21:19:17,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 21:19:17,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:19:17,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:19:17,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:19:17,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:19:17,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892484748] [2025-03-08 21:19:17,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892484748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:19:17,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:19:17,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:19:17,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244182062] [2025-03-08 21:19:17,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:19:17,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 21:19:17,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:19:17,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 21:19:17,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 21:19:17,759 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-08 21:19:18,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:19:18,000 INFO L93 Difference]: Finished difference Result 2096 states and 3410 transitions. [2025-03-08 21:19:18,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 21:19:18,002 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-08 21:19:18,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:19:18,020 INFO L225 Difference]: With dead ends: 2096 [2025-03-08 21:19:18,020 INFO L226 Difference]: Without dead ends: 1012 [2025-03-08 21:19:18,026 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-08 21:19:18,028 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-08 21:19:18,028 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-08 21:19:18,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2025-03-08 21:19:18,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1012. [2025-03-08 21:19:18,092 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-08 21:19:18,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1497 transitions. [2025-03-08 21:19:18,104 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1497 transitions. Word has length 13 [2025-03-08 21:19:18,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:19:18,104 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1497 transitions. [2025-03-08 21:19:18,105 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-08 21:19:18,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1497 transitions. [2025-03-08 21:19:18,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 21:19:18,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:19:18,112 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-08 21:19:18,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:19:18,112 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:19:18,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:19:18,113 INFO L85 PathProgramCache]: Analyzing trace with hash -75367763, now seen corresponding path program 1 times [2025-03-08 21:19:18,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:19:18,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956321551] [2025-03-08 21:19:18,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:19:18,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:19:18,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 21:19:18,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 21:19:18,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:19:18,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:19:18,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:19:18,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:19:18,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956321551] [2025-03-08 21:19:18,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956321551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:19:18,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:19:18,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:19:18,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328049780] [2025-03-08 21:19:18,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:19:18,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:19:18,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:19:18,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:19:18,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:19:18,543 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-08 21:19:18,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:19:18,974 INFO L93 Difference]: Finished difference Result 2018 states and 2988 transitions. [2025-03-08 21:19:18,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:19:18,975 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-08 21:19:18,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:19:18,981 INFO L225 Difference]: With dead ends: 2018 [2025-03-08 21:19:18,981 INFO L226 Difference]: Without dead ends: 1392 [2025-03-08 21:19:18,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:19:18,983 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.4s IncrementalHoareTripleChecker+Time [2025-03-08 21:19:18,984 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.4s Time] [2025-03-08 21:19:18,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2025-03-08 21:19:19,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1014. [2025-03-08 21:19:19,013 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-08 21:19:19,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1499 transitions. [2025-03-08 21:19:19,019 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1499 transitions. Word has length 66 [2025-03-08 21:19:19,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:19:19,019 INFO L471 AbstractCegarLoop]: Abstraction has 1014 states and 1499 transitions. [2025-03-08 21:19:19,019 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-08 21:19:19,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1499 transitions. [2025-03-08 21:19:19,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 21:19:19,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:19:19,027 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-08 21:19:19,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:19:19,028 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:19:19,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:19:19,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1641475536, now seen corresponding path program 1 times [2025-03-08 21:19:19,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:19:19,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640321539] [2025-03-08 21:19:19,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:19:19,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:19:19,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 21:19:19,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 21:19:19,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:19:19,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:19:19,581 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-08 21:19:19,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:19:19,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640321539] [2025-03-08 21:19:19,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640321539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:19:19,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:19:19,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 21:19:19,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066936022] [2025-03-08 21:19:19,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:19:19,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:19:19,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:19:19,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:19:19,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:19:19,583 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-08 21:19:20,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:19:20,056 INFO L93 Difference]: Finished difference Result 2402 states and 3547 transitions. [2025-03-08 21:19:20,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:19:20,057 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-08 21:19:20,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:19:20,062 INFO L225 Difference]: With dead ends: 2402 [2025-03-08 21:19:20,062 INFO L226 Difference]: Without dead ends: 1392 [2025-03-08 21:19:20,064 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-08 21:19:20,065 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-08 21:19:20,066 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-08 21:19:20,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2025-03-08 21:19:20,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1017. [2025-03-08 21:19:20,095 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-08 21:19:20,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1502 transitions. [2025-03-08 21:19:20,099 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1502 transitions. Word has length 141 [2025-03-08 21:19:20,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:19:20,099 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 1502 transitions. [2025-03-08 21:19:20,099 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-08 21:19:20,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1502 transitions. [2025-03-08 21:19:20,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-08 21:19:20,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:19:20,103 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-08 21:19:20,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:19:20,104 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:19:20,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:19:20,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1689625149, now seen corresponding path program 1 times [2025-03-08 21:19:20,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:19:20,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791762893] [2025-03-08 21:19:20,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:19:20,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:19:20,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-08 21:19:20,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 21:19:20,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:19:20,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:19:20,415 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-08 21:19:20,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:19:20,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791762893] [2025-03-08 21:19:20,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791762893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:19:20,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:19:20,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:19:20,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69760059] [2025-03-08 21:19:20,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:19:20,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:19:20,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:19:20,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:19:20,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:19:20,419 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-08 21:19:20,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:19:20,700 INFO L93 Difference]: Finished difference Result 1985 states and 2931 transitions. [2025-03-08 21:19:20,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:19:20,701 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-08 21:19:20,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:19:20,705 INFO L225 Difference]: With dead ends: 1985 [2025-03-08 21:19:20,705 INFO L226 Difference]: Without dead ends: 975 [2025-03-08 21:19:20,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:19:20,708 INFO L435 NwaCegarLoop]: 1285 mSDtfsCounter, 30 mSDsluCounter, 2551 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3836 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-08 21:19:20,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3836 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:19:20,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-03-08 21:19:20,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 975. [2025-03-08 21:19:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 957 states have (on average 1.4608150470219436) internal successors, (1398), 962 states have internal predecessors, (1398), 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-08 21:19:20,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1425 transitions. [2025-03-08 21:19:20,730 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1425 transitions. Word has length 210 [2025-03-08 21:19:20,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:19:20,730 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1425 transitions. [2025-03-08 21:19:20,730 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-08 21:19:20,730 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1425 transitions. [2025-03-08 21:19:20,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-08 21:19:20,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:19:20,732 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-08 21:19:20,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:19:20,733 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:19:20,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:19:20,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1866534525, now seen corresponding path program 1 times [2025-03-08 21:19:20,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:19:20,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104606412] [2025-03-08 21:19:20,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:19:20,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:19:20,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-08 21:19:20,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 21:19:20,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:19:20,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:19:20,938 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-08 21:19:20,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:19:20,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104606412] [2025-03-08 21:19:20,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104606412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:19:20,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:19:20,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:19:20,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946667239] [2025-03-08 21:19:20,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:19:20,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:19:20,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:19:20,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:19:20,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:19:20,940 INFO L87 Difference]: Start difference. First operand 975 states and 1425 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-08 21:19:21,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:19:21,204 INFO L93 Difference]: Finished difference Result 2466 states and 3618 transitions. [2025-03-08 21:19:21,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:19:21,204 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-08 21:19:21,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:19:21,210 INFO L225 Difference]: With dead ends: 2466 [2025-03-08 21:19:21,210 INFO L226 Difference]: Without dead ends: 1498 [2025-03-08 21:19:21,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:19:21,212 INFO L435 NwaCegarLoop]: 1301 mSDtfsCounter, 710 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 2584 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:19:21,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 2584 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:19:21,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2025-03-08 21:19:21,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1341. [2025-03-08 21:19:21,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 1321 states have (on average 1.4640423921271764) internal successors, (1934), 1326 states have internal predecessors, (1934), 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-08 21:19:21,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1965 transitions. [2025-03-08 21:19:21,241 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1965 transitions. Word has length 210 [2025-03-08 21:19:21,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:19:21,242 INFO L471 AbstractCegarLoop]: Abstraction has 1341 states and 1965 transitions. [2025-03-08 21:19:21,242 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-08 21:19:21,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1965 transitions. [2025-03-08 21:19:21,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-08 21:19:21,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:19:21,244 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-08 21:19:21,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:19:21,245 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:19:21,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:19:21,245 INFO L85 PathProgramCache]: Analyzing trace with hash -127402442, now seen corresponding path program 1 times [2025-03-08 21:19:21,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:19:21,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633244223] [2025-03-08 21:19:21,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:19:21,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:19:21,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 21:19:21,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 21:19:21,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:19:21,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:19:21,601 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-08 21:19:21,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:19:21,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633244223] [2025-03-08 21:19:21,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633244223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:19:21,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:19:21,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:19:21,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577089519] [2025-03-08 21:19:21,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:19:21,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:19:21,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:19:21,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:19:21,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:19:21,605 INFO L87 Difference]: Start difference. First operand 1341 states and 1965 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-08 21:19:21,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:19:21,853 INFO L93 Difference]: Finished difference Result 2550 states and 3743 transitions. [2025-03-08 21:19:21,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:19:21,853 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-08 21:19:21,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:19:21,860 INFO L225 Difference]: With dead ends: 2550 [2025-03-08 21:19:21,860 INFO L226 Difference]: Without dead ends: 1299 [2025-03-08 21:19:21,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:19:21,863 INFO L435 NwaCegarLoop]: 1211 mSDtfsCounter, 30 mSDsluCounter, 2403 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3614 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:19:21,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3614 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:19:21,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2025-03-08 21:19:21,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1299. [2025-03-08 21:19:21,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1299 states, 1279 states have (on average 1.4519155590304926) internal successors, (1857), 1284 states have internal predecessors, (1857), 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-08 21:19:21,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1888 transitions. [2025-03-08 21:19:21,895 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1888 transitions. Word has length 225 [2025-03-08 21:19:21,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:19:21,896 INFO L471 AbstractCegarLoop]: Abstraction has 1299 states and 1888 transitions. [2025-03-08 21:19:21,896 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-08 21:19:21,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1888 transitions. [2025-03-08 21:19:21,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-08 21:19:21,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:19:21,898 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-08 21:19:21,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:19:21,899 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:19:21,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:19:21,899 INFO L85 PathProgramCache]: Analyzing trace with hash 736922045, now seen corresponding path program 1 times [2025-03-08 21:19:21,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:19:21,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557470421] [2025-03-08 21:19:21,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:19:21,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:19:21,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 21:19:21,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 21:19:21,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:19:21,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:19:22,168 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-08 21:19:22,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:19:22,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557470421] [2025-03-08 21:19:22,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557470421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:19:22,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:19:22,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:19:22,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586003355] [2025-03-08 21:19:22,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:19:22,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:19:22,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:19:22,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:19:22,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:19:22,171 INFO L87 Difference]: Start difference. First operand 1299 states and 1888 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-08 21:19:22,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:19:22,456 INFO L93 Difference]: Finished difference Result 3070 states and 4480 transitions. [2025-03-08 21:19:22,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:19:22,457 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-08 21:19:22,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:19:22,464 INFO L225 Difference]: With dead ends: 3070 [2025-03-08 21:19:22,464 INFO L226 Difference]: Without dead ends: 1861 [2025-03-08 21:19:22,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:19:22,467 INFO L435 NwaCegarLoop]: 1431 mSDtfsCounter, 591 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 2640 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:19:22,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 2640 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:19:22,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2025-03-08 21:19:22,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1856. [2025-03-08 21:19:22,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1830 states have (on average 1.4551912568306011) internal successors, (2663), 1835 states have internal predecessors, (2663), 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-08 21:19:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 2706 transitions. [2025-03-08 21:19:22,522 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 2706 transitions. Word has length 225 [2025-03-08 21:19:22,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:19:22,523 INFO L471 AbstractCegarLoop]: Abstraction has 1856 states and 2706 transitions. [2025-03-08 21:19:22,523 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-08 21:19:22,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2706 transitions. [2025-03-08 21:19:22,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-08 21:19:22,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:19:22,526 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-08 21:19:22,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:19:22,527 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:19:22,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:19:22,527 INFO L85 PathProgramCache]: Analyzing trace with hash 676242737, now seen corresponding path program 1 times [2025-03-08 21:19:22,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:19:22,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934425453] [2025-03-08 21:19:22,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:19:22,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:19:22,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-08 21:19:22,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-08 21:19:22,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:19:22,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:19:22,884 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-08 21:19:22,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:19:22,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934425453] [2025-03-08 21:19:22,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934425453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:19:22,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:19:22,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:19:22,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259087189] [2025-03-08 21:19:22,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:19:22,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:19:22,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:19:22,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:19:22,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:19:22,886 INFO L87 Difference]: Start difference. First operand 1856 states and 2706 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-08 21:19:23,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:19:23,487 INFO L93 Difference]: Finished difference Result 3056 states and 4462 transitions. [2025-03-08 21:19:23,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:19:23,488 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-08 21:19:23,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:19:23,493 INFO L225 Difference]: With dead ends: 3056 [2025-03-08 21:19:23,493 INFO L226 Difference]: Without dead ends: 1433 [2025-03-08 21:19:23,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:19:23,495 INFO L435 NwaCegarLoop]: 1256 mSDtfsCounter, 2348 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2348 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 21:19:23,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2348 Valid, 1438 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 21:19:23,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2025-03-08 21:19:23,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1433. [2025-03-08 21:19:23,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 1412 states have (on average 1.4405099150141643) internal successors, (2034), 1417 states have internal predecessors, (2034), 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-08 21:19:23,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 2067 transitions. [2025-03-08 21:19:23,526 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 2067 transitions. Word has length 240 [2025-03-08 21:19:23,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:19:23,526 INFO L471 AbstractCegarLoop]: Abstraction has 1433 states and 2067 transitions. [2025-03-08 21:19:23,526 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-08 21:19:23,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2067 transitions. [2025-03-08 21:19:23,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-08 21:19:23,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:19:23,529 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-08 21:19:23,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:19:23,529 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:19:23,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:19:23,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1290534467, now seen corresponding path program 1 times [2025-03-08 21:19:23,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:19:23,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475231376] [2025-03-08 21:19:23,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:19:23,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:19:23,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-08 21:19:23,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-08 21:19:23,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:19:23,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:19:23,845 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-08 21:19:23,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:19:23,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475231376] [2025-03-08 21:19:23,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475231376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:19:23,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:19:23,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:19:23,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401522934] [2025-03-08 21:19:23,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:19:23,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:19:23,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:19:23,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:19:23,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:19:23,848 INFO L87 Difference]: Start difference. First operand 1433 states and 2067 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-08 21:19:24,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:19:24,078 INFO L93 Difference]: Finished difference Result 2297 states and 3356 transitions. [2025-03-08 21:19:24,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:19:24,079 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-08 21:19:24,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:19:24,084 INFO L225 Difference]: With dead ends: 2297 [2025-03-08 21:19:24,084 INFO L226 Difference]: Without dead ends: 1391 [2025-03-08 21:19:24,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:19:24,087 INFO L435 NwaCegarLoop]: 1135 mSDtfsCounter, 30 mSDsluCounter, 2251 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3386 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:19:24,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3386 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:19:24,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2025-03-08 21:19:24,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1391. [2025-03-08 21:19:24,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 1370 states have (on average 1.4284671532846716) internal successors, (1957), 1375 states have internal predecessors, (1957), 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-08 21:19:24,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 1990 transitions. [2025-03-08 21:19:24,123 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 1990 transitions. Word has length 250 [2025-03-08 21:19:24,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:19:24,123 INFO L471 AbstractCegarLoop]: Abstraction has 1391 states and 1990 transitions. [2025-03-08 21:19:24,124 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-08 21:19:24,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1990 transitions. [2025-03-08 21:19:24,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-08 21:19:24,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:19:24,127 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-08 21:19:24,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 21:19:24,127 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:19:24,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:19:24,130 INFO L85 PathProgramCache]: Analyzing trace with hash -95409252, now seen corresponding path program 1 times [2025-03-08 21:19:24,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:19:24,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746860838] [2025-03-08 21:19:24,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:19:24,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:19:24,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-08 21:19:24,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-08 21:19:24,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:19:24,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:19:24,911 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-08 21:19:24,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:19:24,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746860838] [2025-03-08 21:19:24,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746860838] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:19:24,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818119622] [2025-03-08 21:19:24,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:19:24,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:19:24,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:19:24,914 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:19:24,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 21:19:25,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-08 21:19:25,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-08 21:19:25,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:19:25,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:19:25,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 1260 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 21:19:25,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:19:25,852 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-08 21:19:25,866 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-08 21:19:25,882 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-08 21:19:25,882 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:19:25,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818119622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:19:25,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:19:25,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-03-08 21:19:25,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376155452] [2025-03-08 21:19:25,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:19:25,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 21:19:25,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:19:25,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 21:19:25,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-08 21:19:25,883 INFO L87 Difference]: Start difference. First operand 1391 states and 1990 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-08 21:19:26,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:19:26,487 INFO L93 Difference]: Finished difference Result 2577 states and 3702 transitions. [2025-03-08 21:19:26,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 21:19:26,487 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-08 21:19:26,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:19:26,493 INFO L225 Difference]: With dead ends: 2577 [2025-03-08 21:19:26,494 INFO L226 Difference]: Without dead ends: 1710 [2025-03-08 21:19:26,495 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-08 21:19:26,496 INFO L435 NwaCegarLoop]: 1093 mSDtfsCounter, 2444 mSDsluCounter, 2952 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2452 SdHoareTripleChecker+Valid, 4045 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 21:19:26,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2452 Valid, 4045 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 21:19:26,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2025-03-08 21:19:26,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1559. [2025-03-08 21:19:26,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1528 states have (on average 1.4201570680628273) internal successors, (2170), 1537 states have internal predecessors, (2170), 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-08 21:19:26,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2217 transitions. [2025-03-08 21:19:26,544 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2217 transitions. Word has length 250 [2025-03-08 21:19:26,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:19:26,545 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2217 transitions. [2025-03-08 21:19:26,545 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-08 21:19:26,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2217 transitions. [2025-03-08 21:19:26,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-08 21:19:26,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:19:26,549 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-08 21:19:26,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 21:19:26,750 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-08 21:19:26,750 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:19:26,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:19:26,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1852733502, now seen corresponding path program 1 times [2025-03-08 21:19:26,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:19:26,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908744737] [2025-03-08 21:19:26,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:19:26,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:19:26,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-08 21:19:26,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-08 21:19:26,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:19:26,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:19:27,711 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-08 21:19:27,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:19:27,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908744737] [2025-03-08 21:19:27,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908744737] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:19:27,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052396383] [2025-03-08 21:19:27,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:19:27,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:19:27,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:19:27,716 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:19:27,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 21:19:28,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-08 21:19:28,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-08 21:19:28,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:19:28,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:19:28,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 1639 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 21:19:28,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:19:28,285 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-08 21:19:28,590 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-08 21:19:28,602 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-08 21:19:28,607 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-08 21:19:28,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:19:28,867 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-08 21:19:28,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052396383] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:19:28,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:19:28,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 12 [2025-03-08 21:19:28,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848827403] [2025-03-08 21:19:28,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:19:28,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 21:19:28,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:19:28,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 21:19:28,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-08 21:19:28,871 INFO L87 Difference]: Start difference. First operand 1559 states and 2217 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-08 21:19:29,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:19:29,650 INFO L93 Difference]: Finished difference Result 3811 states and 5371 transitions. [2025-03-08 21:19:29,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:19:29,651 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-08 21:19:29,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:19:29,659 INFO L225 Difference]: With dead ends: 3811 [2025-03-08 21:19:29,659 INFO L226 Difference]: Without dead ends: 2485 [2025-03-08 21:19:29,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 639 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-08 21:19:29,662 INFO L435 NwaCegarLoop]: 1121 mSDtfsCounter, 2120 mSDsluCounter, 6837 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2138 SdHoareTripleChecker+Valid, 7958 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 21:19:29,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2138 Valid, 7958 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 21:19:29,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2025-03-08 21:19:29,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2203. [2025-03-08 21:19:29,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2203 states, 2160 states have (on average 1.3953703703703704) internal successors, (3014), 2169 states have internal predecessors, (3014), 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-08 21:19:29,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2203 states to 2203 states and 3083 transitions. [2025-03-08 21:19:29,715 INFO L78 Accepts]: Start accepts. Automaton has 2203 states and 3083 transitions. Word has length 325 [2025-03-08 21:19:29,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:19:29,715 INFO L471 AbstractCegarLoop]: Abstraction has 2203 states and 3083 transitions. [2025-03-08 21:19:29,715 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-08 21:19:29,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2203 states and 3083 transitions. [2025-03-08 21:19:29,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 758 [2025-03-08 21:19:29,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:19:29,726 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-08 21:19:29,737 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-08 21:19:29,930 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-08 21:19:29,930 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:19:29,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:19:29,931 INFO L85 PathProgramCache]: Analyzing trace with hash 347781465, now seen corresponding path program 1 times [2025-03-08 21:19:29,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:19:29,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084681190] [2025-03-08 21:19:29,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:19:29,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:19:30,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 757 statements into 1 equivalence classes. [2025-03-08 21:19:30,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 757 of 757 statements. [2025-03-08 21:19:30,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:19:30,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:19:34,074 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-08 21:19:34,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:19:34,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084681190] [2025-03-08 21:19:34,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084681190] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:19:34,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914195649] [2025-03-08 21:19:34,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:19:34,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:19:34,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:19:34,077 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:19:34,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 21:19:34,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 757 statements into 1 equivalence classes. [2025-03-08 21:19:35,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 757 of 757 statements. [2025-03-08 21:19:35,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:19:35,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:19:35,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 3754 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 21:19:35,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:19:35,134 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-08 21:19:35,415 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-08 21:19:35,576 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-08 21:19:35,742 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-08 21:19:35,904 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-08 21:19:35,911 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-08 21:19:35,916 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-08 21:19:35,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:19:36,622 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-08 21:19:36,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914195649] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:19:36,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:19:36,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 21 [2025-03-08 21:19:36,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527127430] [2025-03-08 21:19:36,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:19:36,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 21:19:36,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:19:36,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 21:19:36,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2025-03-08 21:19:36,626 INFO L87 Difference]: Start difference. First operand 2203 states and 3083 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-08 21:19:37,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:19:37,738 INFO L93 Difference]: Finished difference Result 5533 states and 7702 transitions. [2025-03-08 21:19:37,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-08 21:19:37,739 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-08 21:19:37,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:19:37,753 INFO L225 Difference]: With dead ends: 5533 [2025-03-08 21:19:37,754 INFO L226 Difference]: Without dead ends: 4207 [2025-03-08 21:19:37,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1538 GetRequests, 1502 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-08 21:19:37,757 INFO L435 NwaCegarLoop]: 1121 mSDtfsCounter, 7653 mSDsluCounter, 8116 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7695 SdHoareTripleChecker+Valid, 9237 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 21:19:37,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7695 Valid, 9237 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 21:19:37,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4207 states. [2025-03-08 21:19:37,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4207 to 3925. [2025-03-08 21:19:37,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3925 states, 3858 states have (on average 1.372213582166926) internal successors, (5294), 3867 states have internal predecessors, (5294), 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-08 21:19:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3925 states to 3925 states and 5411 transitions. [2025-03-08 21:19:37,837 INFO L78 Accepts]: Start accepts. Automaton has 3925 states and 5411 transitions. Word has length 757 [2025-03-08 21:19:37,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:19:37,837 INFO L471 AbstractCegarLoop]: Abstraction has 3925 states and 5411 transitions. [2025-03-08 21:19:37,838 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-08 21:19:37,839 INFO L276 IsEmpty]: Start isEmpty. Operand 3925 states and 5411 transitions. [2025-03-08 21:19:37,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1622 [2025-03-08 21:19:37,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:19:37,887 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-08 21:19:37,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 21:19:38,088 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-08 21:19:38,088 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:19:38,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:19:38,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1409598863, now seen corresponding path program 2 times [2025-03-08 21:19:38,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:19:38,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139932835] [2025-03-08 21:19:38,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:19:38,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:19:38,405 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1621 statements into 2 equivalence classes. [2025-03-08 21:19:38,422 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 76 of 1621 statements. [2025-03-08 21:19:38,422 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:19:38,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:19:38,748 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-08 21:19:38,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:19:38,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139932835] [2025-03-08 21:19:38,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139932835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:19:38,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:19:38,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 21:19:38,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875735677] [2025-03-08 21:19:38,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:19:38,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 21:19:38,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:19:38,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 21:19:38,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 21:19:38,752 INFO L87 Difference]: Start difference. First operand 3925 states and 5411 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-08 21:19:39,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:19:39,477 INFO L93 Difference]: Finished difference Result 4786 states and 6692 transitions. [2025-03-08 21:19:39,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:19:39,478 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-08 21:19:39,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:19:39,491 INFO L225 Difference]: With dead ends: 4786 [2025-03-08 21:19:39,491 INFO L226 Difference]: Without dead ends: 3940 [2025-03-08 21:19:39,494 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-08 21:19:39,495 INFO L435 NwaCegarLoop]: 1141 mSDtfsCounter, 51 mSDsluCounter, 5381 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 6522 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 21:19:39,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 6522 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 21:19:39,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3940 states. [2025-03-08 21:19:39,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3940 to 3936. [2025-03-08 21:19:39,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3936 states, 3869 states have (on average 1.371155337296459) internal successors, (5305), 3878 states have internal predecessors, (5305), 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-08 21:19:39,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3936 states to 3936 states and 5422 transitions. [2025-03-08 21:19:39,568 INFO L78 Accepts]: Start accepts. Automaton has 3936 states and 5422 transitions. Word has length 1621 [2025-03-08 21:19:39,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:19:39,570 INFO L471 AbstractCegarLoop]: Abstraction has 3936 states and 5422 transitions. [2025-03-08 21:19:39,570 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-08 21:19:39,570 INFO L276 IsEmpty]: Start isEmpty. Operand 3936 states and 5422 transitions. [2025-03-08 21:19:39,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1623 [2025-03-08 21:19:39,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:19:39,587 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-08 21:19:39,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 21:19:39,588 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:19:39,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:19:39,589 INFO L85 PathProgramCache]: Analyzing trace with hash 217806673, now seen corresponding path program 1 times [2025-03-08 21:19:39,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:19:39,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062257908] [2025-03-08 21:19:39,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:19:39,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:19:39,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1622 statements into 1 equivalence classes. [2025-03-08 21:19:40,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1622 of 1622 statements. [2025-03-08 21:19:40,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:19:40,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:19:43,332 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-08 21:19:43,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:19:43,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062257908] [2025-03-08 21:19:43,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062257908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:19:43,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:19:43,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 21:19:43,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449413694] [2025-03-08 21:19:43,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:19:43,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 21:19:43,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:19:43,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 21:19:43,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 21:19:43,335 INFO L87 Difference]: Start difference. First operand 3936 states and 5422 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-08 21:19:43,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:19:43,835 INFO L93 Difference]: Finished difference Result 4780 states and 6678 transitions. [2025-03-08 21:19:43,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:19:43,835 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-08 21:19:43,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:19:43,848 INFO L225 Difference]: With dead ends: 4780 [2025-03-08 21:19:43,848 INFO L226 Difference]: Without dead ends: 3944 [2025-03-08 21:19:43,850 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-08 21:19:43,851 INFO L435 NwaCegarLoop]: 1146 mSDtfsCounter, 25 mSDsluCounter, 5415 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 6561 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 21:19:43,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 6561 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 21:19:43,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3944 states. [2025-03-08 21:19:43,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3944 to 3936. [2025-03-08 21:19:43,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3936 states, 3869 states have (on average 1.371155337296459) internal successors, (5305), 3878 states have internal predecessors, (5305), 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-08 21:19:43,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3936 states to 3936 states and 5422 transitions. [2025-03-08 21:19:43,924 INFO L78 Accepts]: Start accepts. Automaton has 3936 states and 5422 transitions. Word has length 1622 [2025-03-08 21:19:43,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:19:43,925 INFO L471 AbstractCegarLoop]: Abstraction has 3936 states and 5422 transitions. [2025-03-08 21:19:43,925 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-08 21:19:43,925 INFO L276 IsEmpty]: Start isEmpty. Operand 3936 states and 5422 transitions. [2025-03-08 21:19:43,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1623 [2025-03-08 21:19:43,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:19:43,940 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-08 21:19:43,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 21:19:43,941 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:19:43,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:19:43,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1933356568, now seen corresponding path program 1 times [2025-03-08 21:19:43,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:19:43,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583023248] [2025-03-08 21:19:43,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:19:43,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:19:44,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1622 statements into 1 equivalence classes. [2025-03-08 21:19:44,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1622 of 1622 statements. [2025-03-08 21:19:44,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:19:44,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:19:48,443 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-08 21:19:48,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:19:48,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583023248] [2025-03-08 21:19:48,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583023248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:19:48,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:19:48,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 21:19:48,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457578243] [2025-03-08 21:19:48,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:19:48,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 21:19:48,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:19:48,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 21:19:48,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:19:48,446 INFO L87 Difference]: Start difference. First operand 3936 states and 5422 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-08 21:19:48,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:19:48,936 INFO L93 Difference]: Finished difference Result 4786 states and 6687 transitions. [2025-03-08 21:19:48,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 21:19:48,937 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-08 21:19:48,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:19:48,944 INFO L225 Difference]: With dead ends: 4786 [2025-03-08 21:19:48,944 INFO L226 Difference]: Without dead ends: 3941 [2025-03-08 21:19:48,946 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-08 21:19:48,946 INFO L435 NwaCegarLoop]: 1147 mSDtfsCounter, 20 mSDsluCounter, 5366 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 6513 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 21:19:48,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 6513 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 21:19:48,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3941 states. [2025-03-08 21:19:48,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3941 to 3940. [2025-03-08 21:19:49,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3940 states, 3873 states have (on average 1.3710302091402014) internal successors, (5310), 3882 states have internal predecessors, (5310), 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-08 21:19:49,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3940 states to 3940 states and 5427 transitions. [2025-03-08 21:19:49,009 INFO L78 Accepts]: Start accepts. Automaton has 3940 states and 5427 transitions. Word has length 1622 [2025-03-08 21:19:49,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:19:49,011 INFO L471 AbstractCegarLoop]: Abstraction has 3940 states and 5427 transitions. [2025-03-08 21:19:49,011 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-08 21:19:49,011 INFO L276 IsEmpty]: Start isEmpty. Operand 3940 states and 5427 transitions. [2025-03-08 21:19:49,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1624 [2025-03-08 21:19:49,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:19:49,027 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-08 21:19:49,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 21:19:49,028 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:19:49,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:19:49,029 INFO L85 PathProgramCache]: Analyzing trace with hash -652462954, now seen corresponding path program 1 times [2025-03-08 21:19:49,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:19:49,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119933341] [2025-03-08 21:19:49,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:19:49,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:19:49,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1623 statements into 1 equivalence classes. [2025-03-08 21:19:50,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1623 of 1623 statements. [2025-03-08 21:19:50,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:19:50,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:19:53,219 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-08 21:19:53,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:19:53,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119933341] [2025-03-08 21:19:53,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119933341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:19:53,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:19:53,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:19:53,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294542496] [2025-03-08 21:19:53,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:19:53,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 21:19:53,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:19:53,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 21:19:53,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:19:53,222 INFO L87 Difference]: Start difference. First operand 3940 states and 5427 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-08 21:19:53,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:19:53,868 INFO L93 Difference]: Finished difference Result 4792 states and 6694 transitions. [2025-03-08 21:19:53,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:19:53,872 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-08 21:19:53,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:19:53,880 INFO L225 Difference]: With dead ends: 4792 [2025-03-08 21:19:53,880 INFO L226 Difference]: Without dead ends: 3951 [2025-03-08 21:19:53,882 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-08 21:19:53,883 INFO L435 NwaCegarLoop]: 1141 mSDtfsCounter, 31 mSDsluCounter, 7617 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 8758 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 21:19:53,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 8758 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 21:19:53,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2025-03-08 21:19:53,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3948. [2025-03-08 21:19:53,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3948 states, 3881 states have (on average 1.3707807266168512) internal successors, (5320), 3890 states have internal predecessors, (5320), 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-08 21:19:53,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 5437 transitions. [2025-03-08 21:19:53,959 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 5437 transitions. Word has length 1623 [2025-03-08 21:19:53,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:19:53,961 INFO L471 AbstractCegarLoop]: Abstraction has 3948 states and 5437 transitions. [2025-03-08 21:19:53,961 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-08 21:19:53,961 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 5437 transitions. [2025-03-08 21:19:53,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1625 [2025-03-08 21:19:53,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:19:53,976 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-08 21:19:53,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 21:19:53,977 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:19:53,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:19:53,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1348505836, now seen corresponding path program 1 times [2025-03-08 21:19:53,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:19:53,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869234410] [2025-03-08 21:19:53,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:19:53,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:19:54,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1624 statements into 1 equivalence classes. [2025-03-08 21:19:54,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1624 of 1624 statements. [2025-03-08 21:19:54,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:19:54,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:19:59,527 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-08 21:19:59,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:19:59,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869234410] [2025-03-08 21:19:59,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869234410] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:19:59,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667699750] [2025-03-08 21:19:59,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:19:59,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:19:59,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:19:59,530 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:19:59,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 21:20:00,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1624 statements into 1 equivalence classes. [2025-03-08 21:20:01,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1624 of 1624 statements. [2025-03-08 21:20:01,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:20:01,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:20:01,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 7984 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-08 21:20:01,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:20:01,675 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-08 21:20:01,949 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-08 21:20:02,104 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-08 21:20:02,241 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-08 21:20:02,363 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-08 21:20:02,484 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-08 21:20:02,611 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-08 21:20:02,736 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-08 21:20:02,859 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-08 21:20:02,994 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-08 21:20:03,113 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-08 21:20:03,173 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-08 21:20:03,176 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-08 21:20:03,188 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 7214 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 21:20:03,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:20:04,543 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 7214 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 21:20:04,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667699750] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:20:04,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:20:04,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 15] total 32 [2025-03-08 21:20:04,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362127987] [2025-03-08 21:20:04,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:20:04,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 21:20:04,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:20:04,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 21:20:04,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=636, Unknown=0, NotChecked=0, Total=992 [2025-03-08 21:20:04,549 INFO L87 Difference]: Start difference. First operand 3948 states and 5437 transitions. Second operand has 32 states, 32 states have (on average 103.21875) internal successors, (3303), 32 states have internal predecessors, (3303), 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-08 21:20:06,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:20:06,890 INFO L93 Difference]: Finished difference Result 6817 states and 9432 transitions. [2025-03-08 21:20:06,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-03-08 21:20:06,891 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 103.21875) internal successors, (3303), 32 states have internal predecessors, (3303), 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-08 21:20:06,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:20:06,901 INFO L225 Difference]: With dead ends: 6817 [2025-03-08 21:20:06,902 INFO L226 Difference]: Without dead ends: 5911 [2025-03-08 21:20:06,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3304 GetRequests, 3220 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1982 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1671, Invalid=4491, Unknown=0, NotChecked=0, Total=6162 [2025-03-08 21:20:06,907 INFO L435 NwaCegarLoop]: 1090 mSDtfsCounter, 10583 mSDsluCounter, 13485 mSDsCounter, 0 mSdLazyCounter, 2082 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10664 SdHoareTripleChecker+Valid, 14575 SdHoareTripleChecker+Invalid, 2135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:20:06,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10664 Valid, 14575 Invalid, 2135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2082 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 21:20:06,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5911 states. [2025-03-08 21:20:07,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5911 to 5911. [2025-03-08 21:20:07,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5911 states, 5805 states have (on average 1.3598621877691646) internal successors, (7894), 5814 states have internal predecessors, (7894), 98 states have call successors, (98), 7 states have call predecessors, (98), 7 states have return successors, (97), 91 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-08 21:20:07,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5911 states to 5911 states and 8089 transitions. [2025-03-08 21:20:07,020 INFO L78 Accepts]: Start accepts. Automaton has 5911 states and 8089 transitions. Word has length 1624 [2025-03-08 21:20:07,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:20:07,022 INFO L471 AbstractCegarLoop]: Abstraction has 5911 states and 8089 transitions. [2025-03-08 21:20:07,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 103.21875) internal successors, (3303), 32 states have internal predecessors, (3303), 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-08 21:20:07,022 INFO L276 IsEmpty]: Start isEmpty. Operand 5911 states and 8089 transitions. [2025-03-08 21:20:07,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2600 [2025-03-08 21:20:07,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:20:07,054 INFO L218 NwaCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 14, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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-08 21:20:07,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 21:20:07,255 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-08 21:20:07,255 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:20:07,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:20:07,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1034625136, now seen corresponding path program 2 times [2025-03-08 21:20:07,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:20:07,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299598637] [2025-03-08 21:20:07,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:20:07,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:20:07,838 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2599 statements into 2 equivalence classes. [2025-03-08 21:20:07,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 79 of 2599 statements. [2025-03-08 21:20:07,850 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:20:07,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:20:08,017 INFO L134 CoverageAnalysis]: Checked inductivity of 23813 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23813 trivial. 0 not checked. [2025-03-08 21:20:08,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:20:08,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299598637] [2025-03-08 21:20:08,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299598637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:20:08,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:20:08,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 21:20:08,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038588403] [2025-03-08 21:20:08,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:20:08,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 21:20:08,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:20:08,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 21:20:08,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 21:20:08,019 INFO L87 Difference]: Start difference. First operand 5911 states and 8089 transitions. Second operand has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 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-08 21:20:08,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:20:08,623 INFO L93 Difference]: Finished difference Result 6767 states and 9359 transitions. [2025-03-08 21:20:08,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 21:20:08,623 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 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 2599 [2025-03-08 21:20:08,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:20:08,635 INFO L225 Difference]: With dead ends: 6767 [2025-03-08 21:20:08,635 INFO L226 Difference]: Without dead ends: 5917 [2025-03-08 21:20:08,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:20:08,639 INFO L435 NwaCegarLoop]: 1134 mSDtfsCounter, 410 mSDsluCounter, 5963 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 7097 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 21:20:08,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 7097 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 21:20:08,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5917 states. [2025-03-08 21:20:08,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5917 to 5911. [2025-03-08 21:20:08,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5911 states, 5805 states have (on average 1.3598621877691646) internal successors, (7894), 5814 states have internal predecessors, (7894), 98 states have call successors, (98), 7 states have call predecessors, (98), 7 states have return successors, (97), 91 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-08 21:20:08,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5911 states to 5911 states and 8089 transitions. [2025-03-08 21:20:08,723 INFO L78 Accepts]: Start accepts. Automaton has 5911 states and 8089 transitions. Word has length 2599 [2025-03-08 21:20:08,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:20:08,725 INFO L471 AbstractCegarLoop]: Abstraction has 5911 states and 8089 transitions. [2025-03-08 21:20:08,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 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-08 21:20:08,726 INFO L276 IsEmpty]: Start isEmpty. Operand 5911 states and 8089 transitions. [2025-03-08 21:20:08,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2600 [2025-03-08 21:20:08,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:20:08,756 INFO L218 NwaCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 14, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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-08 21:20:08,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 21:20:08,757 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:20:08,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:20:08,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1896541575, now seen corresponding path program 1 times [2025-03-08 21:20:08,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:20:08,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983384950] [2025-03-08 21:20:08,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:20:08,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:20:09,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2599 statements into 1 equivalence classes. [2025-03-08 21:20:10,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2599 of 2599 statements. [2025-03-08 21:20:10,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:20:10,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:20:16,178 INFO L134 CoverageAnalysis]: Checked inductivity of 23813 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23813 trivial. 0 not checked. [2025-03-08 21:20:16,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:20:16,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983384950] [2025-03-08 21:20:16,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983384950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:20:16,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:20:16,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 21:20:16,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053237139] [2025-03-08 21:20:16,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:20:16,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 21:20:16,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:20:16,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 21:20:16,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:20:16,180 INFO L87 Difference]: Start difference. First operand 5911 states and 8089 transitions. Second operand has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 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-08 21:20:16,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:20:16,517 INFO L93 Difference]: Finished difference Result 6763 states and 9356 transitions. [2025-03-08 21:20:16,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 21:20:16,518 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 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 2599 [2025-03-08 21:20:16,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:20:16,529 INFO L225 Difference]: With dead ends: 6763 [2025-03-08 21:20:16,529 INFO L226 Difference]: Without dead ends: 5916 [2025-03-08 21:20:16,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:20:16,532 INFO L435 NwaCegarLoop]: 1150 mSDtfsCounter, 16 mSDsluCounter, 3272 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4422 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 21:20:16,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4422 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 21:20:16,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5916 states. [2025-03-08 21:20:16,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5916 to 5914. [2025-03-08 21:20:16,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5914 states, 5808 states have (on average 1.3596763085399448) internal successors, (7897), 5817 states have internal predecessors, (7897), 98 states have call successors, (98), 7 states have call predecessors, (98), 7 states have return successors, (97), 91 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-08 21:20:16,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5914 states to 5914 states and 8092 transitions. [2025-03-08 21:20:16,615 INFO L78 Accepts]: Start accepts. Automaton has 5914 states and 8092 transitions. Word has length 2599 [2025-03-08 21:20:16,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:20:16,618 INFO L471 AbstractCegarLoop]: Abstraction has 5914 states and 8092 transitions. [2025-03-08 21:20:16,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 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-08 21:20:16,618 INFO L276 IsEmpty]: Start isEmpty. Operand 5914 states and 8092 transitions. [2025-03-08 21:20:16,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2600 [2025-03-08 21:20:16,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:20:16,650 INFO L218 NwaCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 14, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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-08 21:20:16,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 21:20:16,651 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:20:16,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:20:16,652 INFO L85 PathProgramCache]: Analyzing trace with hash 98565457, now seen corresponding path program 1 times [2025-03-08 21:20:16,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:20:16,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532718408] [2025-03-08 21:20:16,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:20:16,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:20:17,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2599 statements into 1 equivalence classes. [2025-03-08 21:20:17,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2599 of 2599 statements. [2025-03-08 21:20:17,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:20:17,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:20:20,387 INFO L134 CoverageAnalysis]: Checked inductivity of 23813 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23813 trivial. 0 not checked. [2025-03-08 21:20:20,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:20:20,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532718408] [2025-03-08 21:20:20,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532718408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:20:20,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:20:20,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:20:20,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574541339] [2025-03-08 21:20:20,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:20:20,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:20:20,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:20:20,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:20:20,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:20:20,390 INFO L87 Difference]: Start difference. First operand 5914 states and 8092 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 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-08 21:20:20,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:20:20,604 INFO L93 Difference]: Finished difference Result 6770 states and 9364 transitions. [2025-03-08 21:20:20,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:20:20,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 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 2599 [2025-03-08 21:20:20,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:20:20,619 INFO L225 Difference]: With dead ends: 6770 [2025-03-08 21:20:20,619 INFO L226 Difference]: Without dead ends: 5895 [2025-03-08 21:20:20,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:20:20,623 INFO L435 NwaCegarLoop]: 1145 mSDtfsCounter, 1 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2268 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:20:20,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2268 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:20:20,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5895 states. [2025-03-08 21:20:20,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5895 to 5895. [2025-03-08 21:20:20,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5895 states, 5789 states have (on average 1.3596476075315254) internal successors, (7871), 5798 states have internal predecessors, (7871), 98 states have call successors, (98), 7 states have call predecessors, (98), 7 states have return successors, (97), 91 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-08 21:20:20,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5895 states to 5895 states and 8066 transitions. [2025-03-08 21:20:20,754 INFO L78 Accepts]: Start accepts. Automaton has 5895 states and 8066 transitions. Word has length 2599 [2025-03-08 21:20:20,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:20:20,756 INFO L471 AbstractCegarLoop]: Abstraction has 5895 states and 8066 transitions. [2025-03-08 21:20:20,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 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-08 21:20:20,757 INFO L276 IsEmpty]: Start isEmpty. Operand 5895 states and 8066 transitions. [2025-03-08 21:20:20,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2601 [2025-03-08 21:20:20,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:20:20,825 INFO L218 NwaCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 14, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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-08 21:20:20,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 21:20:20,825 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:20:20,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:20:20,826 INFO L85 PathProgramCache]: Analyzing trace with hash 879778901, now seen corresponding path program 1 times [2025-03-08 21:20:20,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:20:20,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243069917] [2025-03-08 21:20:20,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:20:20,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:20:21,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2600 statements into 1 equivalence classes. [2025-03-08 21:20:22,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2600 of 2600 statements. [2025-03-08 21:20:22,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:20:22,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat