./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 05:58:54,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 05:58:54,713 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 05:58:54,719 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 05:58:54,719 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 05:58:54,734 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 05:58:54,735 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 05:58:54,735 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 05:58:54,735 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 05:58:54,735 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 05:58:54,735 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 05:58:54,735 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 05:58:54,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 05:58:54,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 05:58:54,737 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 05:58:54,737 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 05:58:54,737 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 05:58:54,737 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 05:58:54,738 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 05:58:54,738 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 05:58:54,738 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 05:58:54,738 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 05:58:54,738 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 05:58:54,738 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 05:58:54,738 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 05:58:54,738 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 05:58:54,738 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 05:58:54,738 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 05:58:54,738 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 05:58:54,738 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 05:58:54,739 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 05:58:54,739 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 05:58:54,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 05:58:54,739 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 05:58:54,739 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 05:58:54,739 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 05:58:54,739 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 05:58:54,739 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 05:58:54,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 05:58:54,739 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 05:58:54,739 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 05:58:54,739 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 05:58:54,739 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 05:58:54,739 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 -> 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f [2025-03-04 05:58:54,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 05:58:54,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 05:58:54,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 05:58:54,976 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 05:58:54,976 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 05:58:54,977 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-1.i [2025-03-04 05:58:56,098 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/638b2a068/1581ae357e794e7ba4afd930b196492a/FLAG7e93fe99e [2025-03-04 05:58:56,386 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 05:58:56,387 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-1.i [2025-03-04 05:58:56,409 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/638b2a068/1581ae357e794e7ba4afd930b196492a/FLAG7e93fe99e [2025-03-04 05:58:56,419 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/638b2a068/1581ae357e794e7ba4afd930b196492a [2025-03-04 05:58:56,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 05:58:56,426 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 05:58:56,427 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 05:58:56,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 05:58:56,430 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 05:58:56,431 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 05:58:56" (1/1) ... [2025-03-04 05:58:56,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3c5206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:56, skipping insertion in model container [2025-03-04 05:58:56,432 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 05:58:56" (1/1) ... [2025-03-04 05:58:56,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 05:58:56,710 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_BER_nondet_test3-1.i[33519,33532] [2025-03-04 05:58:56,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 05:58:56,816 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 05:58:56,844 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_BER_nondet_test3-1.i[33519,33532] [2025-03-04 05:58:56,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 05:58:56,925 INFO L204 MainTranslator]: Completed translation [2025-03-04 05:58:56,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:56 WrapperNode [2025-03-04 05:58:56,926 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 05:58:56,927 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 05:58:56,927 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 05:58:56,927 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 05:58:56,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:56" (1/1) ... [2025-03-04 05:58:56,950 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:56" (1/1) ... [2025-03-04 05:58:56,989 INFO L138 Inliner]: procedures = 177, calls = 273, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1386 [2025-03-04 05:58:56,989 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 05:58:56,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 05:58:56,990 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 05:58:56,990 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 05:58:56,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:56" (1/1) ... [2025-03-04 05:58:56,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:56" (1/1) ... [2025-03-04 05:58:57,008 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:56" (1/1) ... [2025-03-04 05:58:57,058 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 34, 218]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2025-03-04 05:58:57,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:56" (1/1) ... [2025-03-04 05:58:57,059 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:56" (1/1) ... [2025-03-04 05:58:57,083 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:56" (1/1) ... [2025-03-04 05:58:57,085 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:56" (1/1) ... [2025-03-04 05:58:57,088 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:56" (1/1) ... [2025-03-04 05:58:57,090 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:56" (1/1) ... [2025-03-04 05:58:57,101 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 05:58:57,102 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 05:58:57,103 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 05:58:57,103 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 05:58:57,104 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:56" (1/1) ... [2025-03-04 05:58:57,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 05:58:57,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:58:57,130 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 05:58:57,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 05:58:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 05:58:57,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 05:58:57,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 05:58:57,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 05:58:57,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 05:58:57,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 05:58:57,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 05:58:57,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 05:58:57,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 05:58:57,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 05:58:57,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 05:58:57,159 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 05:58:57,159 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 05:58:57,159 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 05:58:57,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 05:58:57,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 05:58:57,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 05:58:57,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 05:58:57,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 05:58:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 05:58:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 05:58:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 05:58:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 05:58:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 05:58:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 05:58:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 05:58:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 05:58:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 05:58:57,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 05:58:57,326 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 05:58:57,328 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 05:58:58,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-04 05:58:58,464 INFO L? ?]: Removed 313 outVars from TransFormulas that were not future-live. [2025-03-04 05:58:58,464 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 05:58:58,512 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 05:58:58,512 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 05:58:58,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 05:58:58 BoogieIcfgContainer [2025-03-04 05:58:58,513 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 05:58:58,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 05:58:58,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 05:58:58,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 05:58:58,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 05:58:56" (1/3) ... [2025-03-04 05:58:58,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e72c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 05:58:58, skipping insertion in model container [2025-03-04 05:58:58,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:56" (2/3) ... [2025-03-04 05:58:58,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e72c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 05:58:58, skipping insertion in model container [2025-03-04 05:58:58,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 05:58:58" (3/3) ... [2025-03-04 05:58:58,523 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test3-1.i [2025-03-04 05:58:58,535 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 05:58:58,537 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_nondet_test3-1.i that has 5 procedures, 403 locations, 1 initial locations, 36 loop locations, and 1 error locations. [2025-03-04 05:58:58,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 05:58:58,604 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;@41bcbc7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 05:58:58,604 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 05:58:58,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 395 states, 386 states have (on average 1.6191709844559585) internal successors, (625), 388 states have internal predecessors, (625), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 05:58:58,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 05:58:58,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:58:58,614 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:58:58,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:58:58,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:58:58,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1168373514, now seen corresponding path program 1 times [2025-03-04 05:58:58,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:58:58,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319107080] [2025-03-04 05:58:58,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:58:58,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:58:58,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 05:58:58,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 05:58:58,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:58:58,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:58:58,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 05:58:58,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:58:58,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319107080] [2025-03-04 05:58:58,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319107080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:58:58,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:58:58,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 05:58:58,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907560734] [2025-03-04 05:58:58,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:58:58,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 05:58:58,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:58:58,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 05:58:58,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 05:58:58,784 INFO L87 Difference]: Start difference. First operand has 395 states, 386 states have (on average 1.6191709844559585) internal successors, (625), 388 states have internal predecessors, (625), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 05:58:58,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:58:58,906 INFO L93 Difference]: Finished difference Result 787 states and 1268 transitions. [2025-03-04 05:58:58,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 05:58:58,908 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 05:58:58,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:58:58,919 INFO L225 Difference]: With dead ends: 787 [2025-03-04 05:58:58,920 INFO L226 Difference]: Without dead ends: 392 [2025-03-04 05:58:58,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 05:58:58,925 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:58:58,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 530 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:58:58,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-04 05:58:58,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-03-04 05:58:58,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 384 states have (on average 1.453125) internal successors, (558), 385 states have internal predecessors, (558), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 05:58:58,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 568 transitions. [2025-03-04 05:58:58,979 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 568 transitions. Word has length 12 [2025-03-04 05:58:58,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:58:58,979 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 568 transitions. [2025-03-04 05:58:58,980 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 05:58:58,980 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 568 transitions. [2025-03-04 05:58:58,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 05:58:58,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:58:58,980 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:58:58,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 05:58:58,980 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:58:58,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:58:58,981 INFO L85 PathProgramCache]: Analyzing trace with hash -2052111927, now seen corresponding path program 1 times [2025-03-04 05:58:58,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:58:58,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356084724] [2025-03-04 05:58:58,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:58:58,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:58:58,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 05:58:59,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 05:58:59,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:58:59,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:58:59,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 05:58:59,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:58:59,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356084724] [2025-03-04 05:58:59,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356084724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:58:59,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:58:59,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:58:59,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371145030] [2025-03-04 05:58:59,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:58:59,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:58:59,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:58:59,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:58:59,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:58:59,152 INFO L87 Difference]: Start difference. First operand 392 states and 568 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 05:58:59,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:58:59,505 INFO L93 Difference]: Finished difference Result 1073 states and 1573 transitions. [2025-03-04 05:58:59,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:58:59,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-04 05:58:59,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:58:59,509 INFO L225 Difference]: With dead ends: 1073 [2025-03-04 05:58:59,509 INFO L226 Difference]: Without dead ends: 682 [2025-03-04 05:58:59,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:58:59,511 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 426 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 05:58:59,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1498 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 05:58:59,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-03-04 05:58:59,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 681. [2025-03-04 05:58:59,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 672 states have (on average 1.4732142857142858) internal successors, (990), 674 states have internal predecessors, (990), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 05:58:59,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1002 transitions. [2025-03-04 05:58:59,544 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1002 transitions. Word has length 14 [2025-03-04 05:58:59,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:58:59,544 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 1002 transitions. [2025-03-04 05:58:59,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 05:58:59,544 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1002 transitions. [2025-03-04 05:58:59,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 05:58:59,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:58:59,546 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:58:59,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 05:58:59,546 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:58:59,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:58:59,546 INFO L85 PathProgramCache]: Analyzing trace with hash 905864474, now seen corresponding path program 1 times [2025-03-04 05:58:59,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:58:59,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766469789] [2025-03-04 05:58:59,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:58:59,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:58:59,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 05:58:59,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 05:58:59,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:58:59,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:58:59,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 05:58:59,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:58:59,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766469789] [2025-03-04 05:58:59,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766469789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:58:59,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:58:59,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:58:59,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578354949] [2025-03-04 05:58:59,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:58:59,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:58:59,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:58:59,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:58:59,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:58:59,780 INFO L87 Difference]: Start difference. First operand 681 states and 1002 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 05:58:59,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:58:59,927 INFO L93 Difference]: Finished difference Result 948 states and 1387 transitions. [2025-03-04 05:58:59,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:58:59,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-04 05:58:59,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:58:59,930 INFO L225 Difference]: With dead ends: 948 [2025-03-04 05:58:59,930 INFO L226 Difference]: Without dead ends: 597 [2025-03-04 05:58:59,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:58:59,935 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 30 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:58:59,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1283 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:58:59,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-04 05:58:59,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2025-03-04 05:58:59,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 588 states have (on average 1.4217687074829932) internal successors, (836), 590 states have internal predecessors, (836), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 05:58:59,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 848 transitions. [2025-03-04 05:58:59,965 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 848 transitions. Word has length 66 [2025-03-04 05:58:59,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:58:59,965 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 848 transitions. [2025-03-04 05:58:59,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 05:58:59,965 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 848 transitions. [2025-03-04 05:58:59,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 05:58:59,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:58:59,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:58:59,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 05:58:59,967 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:58:59,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:58:59,968 INFO L85 PathProgramCache]: Analyzing trace with hash 620657441, now seen corresponding path program 1 times [2025-03-04 05:58:59,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:58:59,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901867736] [2025-03-04 05:58:59,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:58:59,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:58:59,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 05:59:00,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 05:59:00,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:00,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:00,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 05:59:00,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:00,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901867736] [2025-03-04 05:59:00,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901867736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:00,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:00,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 05:59:00,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871807291] [2025-03-04 05:59:00,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:00,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 05:59:00,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:00,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 05:59:00,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:59:00,469 INFO L87 Difference]: Start difference. First operand 597 states and 848 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 05:59:00,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:00,748 INFO L93 Difference]: Finished difference Result 1103 states and 1536 transitions. [2025-03-04 05:59:00,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 05:59:00,748 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-04 05:59:00,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:00,752 INFO L225 Difference]: With dead ends: 1103 [2025-03-04 05:59:00,752 INFO L226 Difference]: Without dead ends: 833 [2025-03-04 05:59:00,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 05:59:00,753 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 459 mSDsluCounter, 2275 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 2754 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:00,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 2754 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:59:00,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-03-04 05:59:00,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 596. [2025-03-04 05:59:00,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 587 states have (on average 1.4207836456558773) internal successors, (834), 589 states have internal predecessors, (834), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 05:59:00,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 846 transitions. [2025-03-04 05:59:00,772 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 846 transitions. Word has length 66 [2025-03-04 05:59:00,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:00,772 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 846 transitions. [2025-03-04 05:59:00,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 05:59:00,773 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 846 transitions. [2025-03-04 05:59:00,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 05:59:00,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:00,775 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] [2025-03-04 05:59:00,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 05:59:00,775 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:00,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:00,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1089864033, now seen corresponding path program 1 times [2025-03-04 05:59:00,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:00,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057892802] [2025-03-04 05:59:00,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:00,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:00,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 05:59:00,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 05:59:00,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:00,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:00,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 05:59:00,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:00,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057892802] [2025-03-04 05:59:00,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057892802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:00,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:00,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:59:00,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313911796] [2025-03-04 05:59:00,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:00,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:59:00,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:00,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:59:00,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:59:00,996 INFO L87 Difference]: Start difference. First operand 596 states and 846 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:01,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:01,112 INFO L93 Difference]: Finished difference Result 1139 states and 1610 transitions. [2025-03-04 05:59:01,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:59:01,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-03-04 05:59:01,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:01,115 INFO L225 Difference]: With dead ends: 1139 [2025-03-04 05:59:01,115 INFO L226 Difference]: Without dead ends: 602 [2025-03-04 05:59:01,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:59:01,116 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 105 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:01,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1191 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:59:01,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-03-04 05:59:01,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 596. [2025-03-04 05:59:01,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 587 states have (on average 1.3969335604770017) internal successors, (820), 589 states have internal predecessors, (820), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 05:59:01,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 832 transitions. [2025-03-04 05:59:01,130 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 832 transitions. Word has length 103 [2025-03-04 05:59:01,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:01,130 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 832 transitions. [2025-03-04 05:59:01,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:01,131 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 832 transitions. [2025-03-04 05:59:01,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 05:59:01,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:01,132 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] [2025-03-04 05:59:01,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 05:59:01,132 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:01,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:01,133 INFO L85 PathProgramCache]: Analyzing trace with hash -867177305, now seen corresponding path program 1 times [2025-03-04 05:59:01,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:01,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002569710] [2025-03-04 05:59:01,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:01,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:01,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 05:59:01,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 05:59:01,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:01,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:01,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 05:59:01,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:01,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002569710] [2025-03-04 05:59:01,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002569710] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:01,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486485405] [2025-03-04 05:59:01,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:01,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:01,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:01,530 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:01,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 05:59:01,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 05:59:01,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 05:59:01,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:01,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:01,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 05:59:01,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:01,838 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 11 treesize of output 7 [2025-03-04 05:59:01,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-03-04 05:59:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 05:59:02,648 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:59:02,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486485405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:02,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:59:02,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-04 05:59:02,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725798658] [2025-03-04 05:59:02,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:02,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 05:59:02,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:02,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 05:59:02,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-04 05:59:02,651 INFO L87 Difference]: Start difference. First operand 596 states and 832 transitions. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:04,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:04,582 INFO L93 Difference]: Finished difference Result 1392 states and 1929 transitions. [2025-03-04 05:59:04,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 05:59:04,585 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-03-04 05:59:04,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:04,588 INFO L225 Difference]: With dead ends: 1392 [2025-03-04 05:59:04,589 INFO L226 Difference]: Without dead ends: 881 [2025-03-04 05:59:04,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-03-04 05:59:04,592 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 723 mSDsluCounter, 2388 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 2863 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:04,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 2863 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 05:59:04,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-03-04 05:59:04,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 621. [2025-03-04 05:59:04,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 612 states have (on average 1.3888888888888888) internal successors, (850), 614 states have internal predecessors, (850), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 05:59:04,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 862 transitions. [2025-03-04 05:59:04,612 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 862 transitions. Word has length 103 [2025-03-04 05:59:04,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:04,613 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 862 transitions. [2025-03-04 05:59:04,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:04,613 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 862 transitions. [2025-03-04 05:59:04,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 05:59:04,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:04,616 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] [2025-03-04 05:59:04,624 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-04 05:59:04,816 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,SelfDestructingSolverStorable5 [2025-03-04 05:59:04,816 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:04,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:04,817 INFO L85 PathProgramCache]: Analyzing trace with hash 152886527, now seen corresponding path program 1 times [2025-03-04 05:59:04,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:04,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769992310] [2025-03-04 05:59:04,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:04,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:04,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 05:59:04,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 05:59:04,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:04,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:05,126 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 05:59:05,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:05,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769992310] [2025-03-04 05:59:05,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769992310] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:05,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786442757] [2025-03-04 05:59:05,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:05,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:05,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:05,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:05,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 05:59:05,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 05:59:05,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 05:59:05,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:05,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:05,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 05:59:05,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:05,366 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 11 treesize of output 7 [2025-03-04 05:59:05,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 05:59:05,542 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 11 treesize of output 7 [2025-03-04 05:59:05,570 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 05:59:05,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 05:59:05,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 05:59:05,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786442757] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:05,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 05:59:05,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 7] total 11 [2025-03-04 05:59:05,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804361585] [2025-03-04 05:59:05,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:05,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:59:05,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:05,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:59:05,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 05:59:05,785 INFO L87 Difference]: Start difference. First operand 621 states and 862 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:05,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:05,944 INFO L93 Difference]: Finished difference Result 803 states and 1109 transitions. [2025-03-04 05:59:05,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:59:05,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2025-03-04 05:59:05,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:05,948 INFO L225 Difference]: With dead ends: 803 [2025-03-04 05:59:05,948 INFO L226 Difference]: Without dead ends: 793 [2025-03-04 05:59:05,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 05:59:05,951 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 554 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:05,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 1308 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:59:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2025-03-04 05:59:05,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 623. [2025-03-04 05:59:05,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 614 states have (on average 1.3876221498371335) internal successors, (852), 616 states have internal predecessors, (852), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 05:59:05,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 864 transitions. [2025-03-04 05:59:05,991 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 864 transitions. Word has length 104 [2025-03-04 05:59:05,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:05,993 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 864 transitions. [2025-03-04 05:59:05,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:05,993 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 864 transitions. [2025-03-04 05:59:05,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 05:59:05,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:05,995 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] [2025-03-04 05:59:06,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 05:59:06,199 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,SelfDestructingSolverStorable6 [2025-03-04 05:59:06,199 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:06,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:06,200 INFO L85 PathProgramCache]: Analyzing trace with hash 264636247, now seen corresponding path program 1 times [2025-03-04 05:59:06,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:06,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841485288] [2025-03-04 05:59:06,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:06,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:06,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 05:59:06,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 05:59:06,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:06,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:06,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 05:59:06,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:06,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841485288] [2025-03-04 05:59:06,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841485288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:06,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:06,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 05:59:06,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039989319] [2025-03-04 05:59:06,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:06,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:59:06,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:06,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:59:06,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:59:06,381 INFO L87 Difference]: Start difference. First operand 623 states and 864 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:06,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:06,777 INFO L93 Difference]: Finished difference Result 1429 states and 1973 transitions. [2025-03-04 05:59:06,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:59:06,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 156 [2025-03-04 05:59:06,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:06,782 INFO L225 Difference]: With dead ends: 1429 [2025-03-04 05:59:06,782 INFO L226 Difference]: Without dead ends: 963 [2025-03-04 05:59:06,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:59:06,785 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 1469 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:06,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 1298 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 05:59:06,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-03-04 05:59:06,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 761. [2025-03-04 05:59:06,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 751 states have (on average 1.3834886817576564) internal successors, (1039), 754 states have internal predecessors, (1039), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 05:59:06,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1053 transitions. [2025-03-04 05:59:06,810 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1053 transitions. Word has length 156 [2025-03-04 05:59:06,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:06,811 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 1053 transitions. [2025-03-04 05:59:06,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:06,811 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1053 transitions. [2025-03-04 05:59:06,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-04 05:59:06,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:06,814 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] [2025-03-04 05:59:06,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 05:59:06,814 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:06,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:06,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1287913989, now seen corresponding path program 1 times [2025-03-04 05:59:06,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:06,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660479482] [2025-03-04 05:59:06,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:06,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:06,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-04 05:59:06,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 05:59:06,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:06,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:07,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 05:59:07,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:07,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660479482] [2025-03-04 05:59:07,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660479482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:07,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211314361] [2025-03-04 05:59:07,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:07,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:07,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:07,167 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:07,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 05:59:07,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-04 05:59:07,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 05:59:07,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:07,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:07,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 05:59:07,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:07,521 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 05:59:07,525 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:59:07,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211314361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:07,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:59:07,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 05:59:07,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013912327] [2025-03-04 05:59:07,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:07,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:59:07,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:07,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:59:07,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:59:07,528 INFO L87 Difference]: Start difference. First operand 761 states and 1053 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:07,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:07,735 INFO L93 Difference]: Finished difference Result 1455 states and 2015 transitions. [2025-03-04 05:59:07,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:59:07,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 166 [2025-03-04 05:59:07,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:07,739 INFO L225 Difference]: With dead ends: 1455 [2025-03-04 05:59:07,739 INFO L226 Difference]: Without dead ends: 804 [2025-03-04 05:59:07,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:59:07,741 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 17 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:07,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1145 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:59:07,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-03-04 05:59:07,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 788. [2025-03-04 05:59:07,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 778 states have (on average 1.3778920308483291) internal successors, (1072), 781 states have internal predecessors, (1072), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 05:59:07,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1086 transitions. [2025-03-04 05:59:07,764 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1086 transitions. Word has length 166 [2025-03-04 05:59:07,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:07,764 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1086 transitions. [2025-03-04 05:59:07,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:07,765 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1086 transitions. [2025-03-04 05:59:07,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-04 05:59:07,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:07,768 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] [2025-03-04 05:59:07,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 05:59:07,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:07,969 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:07,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:07,970 INFO L85 PathProgramCache]: Analyzing trace with hash -27010038, now seen corresponding path program 1 times [2025-03-04 05:59:07,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:07,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240900385] [2025-03-04 05:59:07,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:07,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:08,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 05:59:08,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 05:59:08,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:08,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:08,256 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 05:59:08,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:08,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240900385] [2025-03-04 05:59:08,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240900385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:08,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:08,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 05:59:08,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439843301] [2025-03-04 05:59:08,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:08,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 05:59:08,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:08,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 05:59:08,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:59:08,258 INFO L87 Difference]: Start difference. First operand 788 states and 1086 transitions. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:08,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:08,694 INFO L93 Difference]: Finished difference Result 1474 states and 2034 transitions. [2025-03-04 05:59:08,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 05:59:08,695 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 167 [2025-03-04 05:59:08,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:08,698 INFO L225 Difference]: With dead ends: 1474 [2025-03-04 05:59:08,698 INFO L226 Difference]: Without dead ends: 800 [2025-03-04 05:59:08,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:59:08,699 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 8 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:08,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1708 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 05:59:08,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-03-04 05:59:08,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 796. [2025-03-04 05:59:08,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 786 states have (on average 1.376590330788804) internal successors, (1082), 789 states have internal predecessors, (1082), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 05:59:08,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1096 transitions. [2025-03-04 05:59:08,718 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1096 transitions. Word has length 167 [2025-03-04 05:59:08,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:08,718 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1096 transitions. [2025-03-04 05:59:08,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:08,719 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1096 transitions. [2025-03-04 05:59:08,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 05:59:08,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:08,720 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] [2025-03-04 05:59:08,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 05:59:08,720 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:08,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:08,721 INFO L85 PathProgramCache]: Analyzing trace with hash -719344543, now seen corresponding path program 1 times [2025-03-04 05:59:08,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:08,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139672439] [2025-03-04 05:59:08,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:08,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:08,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 05:59:08,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 05:59:08,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:08,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:09,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 05:59:09,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:09,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139672439] [2025-03-04 05:59:09,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139672439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:09,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:09,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 05:59:09,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465228332] [2025-03-04 05:59:09,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:09,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 05:59:09,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:09,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 05:59:09,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:59:09,016 INFO L87 Difference]: Start difference. First operand 796 states and 1096 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:09,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:09,503 INFO L93 Difference]: Finished difference Result 1489 states and 2054 transitions. [2025-03-04 05:59:09,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 05:59:09,503 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2025-03-04 05:59:09,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:09,506 INFO L225 Difference]: With dead ends: 1489 [2025-03-04 05:59:09,508 INFO L226 Difference]: Without dead ends: 818 [2025-03-04 05:59:09,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:59:09,510 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 12 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2021 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:09,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2021 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 05:59:09,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2025-03-04 05:59:09,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 812. [2025-03-04 05:59:09,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 802 states have (on average 1.3765586034912718) internal successors, (1104), 805 states have internal predecessors, (1104), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 05:59:09,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1118 transitions. [2025-03-04 05:59:09,533 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1118 transitions. Word has length 168 [2025-03-04 05:59:09,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:09,533 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1118 transitions. [2025-03-04 05:59:09,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:09,534 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1118 transitions. [2025-03-04 05:59:09,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 05:59:09,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:09,535 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] [2025-03-04 05:59:09,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 05:59:09,535 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:09,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:09,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2020492911, now seen corresponding path program 1 times [2025-03-04 05:59:09,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:09,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847981447] [2025-03-04 05:59:09,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:09,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:09,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 05:59:09,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 05:59:09,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:09,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:09,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 05:59:09,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:09,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847981447] [2025-03-04 05:59:09,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847981447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:09,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173035926] [2025-03-04 05:59:09,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:09,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:09,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:09,882 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:09,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 05:59:10,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 05:59:10,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 05:59:10,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:10,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:10,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 05:59:10,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:10,224 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 11 treesize of output 7 [2025-03-04 05:59:10,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 05:59:10,715 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:59:10,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173035926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:10,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:59:10,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-03-04 05:59:10,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660972761] [2025-03-04 05:59:10,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:10,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 05:59:10,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:10,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 05:59:10,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 05:59:10,717 INFO L87 Difference]: Start difference. First operand 812 states and 1118 transitions. Second operand has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:11,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:11,435 INFO L93 Difference]: Finished difference Result 1446 states and 1975 transitions. [2025-03-04 05:59:11,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 05:59:11,436 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2025-03-04 05:59:11,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:11,439 INFO L225 Difference]: With dead ends: 1446 [2025-03-04 05:59:11,439 INFO L226 Difference]: Without dead ends: 1041 [2025-03-04 05:59:11,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-04 05:59:11,441 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 468 mSDsluCounter, 2082 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 2566 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:11,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 2566 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 05:59:11,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2025-03-04 05:59:11,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 845. [2025-03-04 05:59:11,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 835 states have (on average 1.3664670658682634) internal successors, (1141), 838 states have internal predecessors, (1141), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 05:59:11,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1155 transitions. [2025-03-04 05:59:11,463 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1155 transitions. Word has length 168 [2025-03-04 05:59:11,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:11,463 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1155 transitions. [2025-03-04 05:59:11,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:11,463 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1155 transitions. [2025-03-04 05:59:11,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-04 05:59:11,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:11,465 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] [2025-03-04 05:59:11,476 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-04 05:59:11,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:11,669 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:11,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:11,669 INFO L85 PathProgramCache]: Analyzing trace with hash 905426220, now seen corresponding path program 1 times [2025-03-04 05:59:11,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:11,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875593100] [2025-03-04 05:59:11,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:11,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:11,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 05:59:11,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 05:59:11,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:11,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:11,920 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 05:59:11,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:11,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875593100] [2025-03-04 05:59:11,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875593100] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:11,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250360400] [2025-03-04 05:59:11,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:11,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:11,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:11,923 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:11,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 05:59:12,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 05:59:12,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 05:59:12,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:12,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:12,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 05:59:12,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:12,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 05:59:12,300 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:59:12,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250360400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:12,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:59:12,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2025-03-04 05:59:12,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572310411] [2025-03-04 05:59:12,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:12,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 05:59:12,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:12,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 05:59:12,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 05:59:12,302 INFO L87 Difference]: Start difference. First operand 845 states and 1155 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:12,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:12,570 INFO L93 Difference]: Finished difference Result 1256 states and 1716 transitions. [2025-03-04 05:59:12,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 05:59:12,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 169 [2025-03-04 05:59:12,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:12,573 INFO L225 Difference]: With dead ends: 1256 [2025-03-04 05:59:12,573 INFO L226 Difference]: Without dead ends: 851 [2025-03-04 05:59:12,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 05:59:12,574 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 34 mSDsluCounter, 1431 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:12,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1859 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:59:12,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2025-03-04 05:59:12,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 845. [2025-03-04 05:59:12,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 835 states have (on average 1.362874251497006) internal successors, (1138), 838 states have internal predecessors, (1138), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 05:59:12,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1152 transitions. [2025-03-04 05:59:12,592 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1152 transitions. Word has length 169 [2025-03-04 05:59:12,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:12,593 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1152 transitions. [2025-03-04 05:59:12,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:12,593 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1152 transitions. [2025-03-04 05:59:12,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-04 05:59:12,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:12,594 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] [2025-03-04 05:59:12,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 05:59:12,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 05:59:12,795 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:12,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:12,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1719563692, now seen corresponding path program 1 times [2025-03-04 05:59:12,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:12,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106661732] [2025-03-04 05:59:12,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:12,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:12,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 05:59:12,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 05:59:12,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:12,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:13,044 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 05:59:13,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:13,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106661732] [2025-03-04 05:59:13,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106661732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:13,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:13,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 05:59:13,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27376005] [2025-03-04 05:59:13,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:13,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 05:59:13,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:13,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 05:59:13,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:59:13,047 INFO L87 Difference]: Start difference. First operand 845 states and 1152 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:13,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:13,309 INFO L93 Difference]: Finished difference Result 1259 states and 1717 transitions. [2025-03-04 05:59:13,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 05:59:13,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 170 [2025-03-04 05:59:13,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:13,313 INFO L225 Difference]: With dead ends: 1259 [2025-03-04 05:59:13,313 INFO L226 Difference]: Without dead ends: 854 [2025-03-04 05:59:13,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:59:13,314 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 8 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:13,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1915 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:59:13,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2025-03-04 05:59:13,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 854. [2025-03-04 05:59:13,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 844 states have (on average 1.3590047393364928) internal successors, (1147), 847 states have internal predecessors, (1147), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 05:59:13,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1161 transitions. [2025-03-04 05:59:13,335 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1161 transitions. Word has length 170 [2025-03-04 05:59:13,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:13,335 INFO L471 AbstractCegarLoop]: Abstraction has 854 states and 1161 transitions. [2025-03-04 05:59:13,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:13,335 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1161 transitions. [2025-03-04 05:59:13,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-04 05:59:13,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:13,337 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] [2025-03-04 05:59:13,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 05:59:13,337 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:13,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:13,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2133409304, now seen corresponding path program 1 times [2025-03-04 05:59:13,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:13,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255090734] [2025-03-04 05:59:13,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:13,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:13,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-04 05:59:13,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 05:59:13,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:13,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:13,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 05:59:13,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:13,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255090734] [2025-03-04 05:59:13,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255090734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:13,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:13,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 05:59:13,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857476261] [2025-03-04 05:59:13,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:13,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 05:59:13,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:13,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 05:59:13,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:59:13,619 INFO L87 Difference]: Start difference. First operand 854 states and 1161 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:13,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:13,910 INFO L93 Difference]: Finished difference Result 1283 states and 1744 transitions. [2025-03-04 05:59:13,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 05:59:13,915 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 171 [2025-03-04 05:59:13,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:13,917 INFO L225 Difference]: With dead ends: 1283 [2025-03-04 05:59:13,917 INFO L226 Difference]: Without dead ends: 869 [2025-03-04 05:59:13,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:59:13,919 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 12 mSDsluCounter, 1849 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2276 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:13,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2276 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 05:59:13,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2025-03-04 05:59:13,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 866. [2025-03-04 05:59:13,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 856 states have (on average 1.3574766355140186) internal successors, (1162), 859 states have internal predecessors, (1162), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 05:59:13,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1176 transitions. [2025-03-04 05:59:13,937 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1176 transitions. Word has length 171 [2025-03-04 05:59:13,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:13,938 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1176 transitions. [2025-03-04 05:59:13,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:13,938 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1176 transitions. [2025-03-04 05:59:13,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-04 05:59:13,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:13,939 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] [2025-03-04 05:59:13,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 05:59:13,940 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:13,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:13,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1495607235, now seen corresponding path program 1 times [2025-03-04 05:59:13,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:13,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276323285] [2025-03-04 05:59:13,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:13,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:13,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-04 05:59:14,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 05:59:14,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:14,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:14,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 05:59:14,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:14,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276323285] [2025-03-04 05:59:14,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276323285] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:14,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137309836] [2025-03-04 05:59:14,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:14,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:14,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:14,192 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:14,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 05:59:14,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-04 05:59:14,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 05:59:14,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:14,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:14,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 05:59:14,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:14,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 05:59:14,838 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:59:14,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137309836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:14,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:59:14,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-04 05:59:14,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697233908] [2025-03-04 05:59:14,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:14,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 05:59:14,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:14,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 05:59:14,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 05:59:14,840 INFO L87 Difference]: Start difference. First operand 866 states and 1176 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:15,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:15,154 INFO L93 Difference]: Finished difference Result 1307 states and 1774 transitions. [2025-03-04 05:59:15,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 05:59:15,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 171 [2025-03-04 05:59:15,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:15,157 INFO L225 Difference]: With dead ends: 1307 [2025-03-04 05:59:15,157 INFO L226 Difference]: Without dead ends: 881 [2025-03-04 05:59:15,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 05:59:15,159 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 12 mSDsluCounter, 1850 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2282 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:15,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2282 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 05:59:15,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-03-04 05:59:15,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 866. [2025-03-04 05:59:15,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 856 states have (on average 1.3574766355140186) internal successors, (1162), 859 states have internal predecessors, (1162), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 05:59:15,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1176 transitions. [2025-03-04 05:59:15,180 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1176 transitions. Word has length 171 [2025-03-04 05:59:15,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:15,181 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1176 transitions. [2025-03-04 05:59:15,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:15,181 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1176 transitions. [2025-03-04 05:59:15,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-04 05:59:15,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:15,182 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] [2025-03-04 05:59:15,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 05:59:15,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 05:59:15,383 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:15,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:15,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1019440187, now seen corresponding path program 1 times [2025-03-04 05:59:15,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:15,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934751755] [2025-03-04 05:59:15,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:15,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:15,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 05:59:15,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 05:59:15,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:15,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:15,672 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 05:59:15,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:15,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934751755] [2025-03-04 05:59:15,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934751755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:15,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:15,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 05:59:15,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048179145] [2025-03-04 05:59:15,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:15,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 05:59:15,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:15,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 05:59:15,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 05:59:15,673 INFO L87 Difference]: Start difference. First operand 866 states and 1176 transitions. Second operand has 9 states, 9 states have (on average 18.11111111111111) internal successors, (163), 9 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:15,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:15,988 INFO L93 Difference]: Finished difference Result 1322 states and 1792 transitions. [2025-03-04 05:59:15,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 05:59:15,988 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.11111111111111) internal successors, (163), 9 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 172 [2025-03-04 05:59:15,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:15,991 INFO L225 Difference]: With dead ends: 1322 [2025-03-04 05:59:15,991 INFO L226 Difference]: Without dead ends: 896 [2025-03-04 05:59:15,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 05:59:15,993 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 20 mSDsluCounter, 2292 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2719 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:15,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2719 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 05:59:15,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2025-03-04 05:59:16,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 887. [2025-03-04 05:59:16,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 877 states have (on average 1.3557582668187) internal successors, (1189), 880 states have internal predecessors, (1189), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 05:59:16,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1203 transitions. [2025-03-04 05:59:16,012 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1203 transitions. Word has length 172 [2025-03-04 05:59:16,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:16,013 INFO L471 AbstractCegarLoop]: Abstraction has 887 states and 1203 transitions. [2025-03-04 05:59:16,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.11111111111111) internal successors, (163), 9 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:16,013 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1203 transitions. [2025-03-04 05:59:16,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-04 05:59:16,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:16,015 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] [2025-03-04 05:59:16,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 05:59:16,015 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:16,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:16,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1572554768, now seen corresponding path program 1 times [2025-03-04 05:59:16,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:16,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656458381] [2025-03-04 05:59:16,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:16,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:16,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 05:59:16,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 05:59:16,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:16,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:16,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 05:59:16,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:16,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656458381] [2025-03-04 05:59:16,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656458381] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:16,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106829982] [2025-03-04 05:59:16,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:16,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:16,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:16,262 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:16,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 05:59:16,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 05:59:16,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 05:59:16,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:16,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:16,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 05:59:16,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:16,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 05:59:16,701 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:59:16,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106829982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:16,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:59:16,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2025-03-04 05:59:16,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484473631] [2025-03-04 05:59:16,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:16,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 05:59:16,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:16,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 05:59:16,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 05:59:16,704 INFO L87 Difference]: Start difference. First operand 887 states and 1203 transitions. Second operand has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:17,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:17,060 INFO L93 Difference]: Finished difference Result 1372 states and 1854 transitions. [2025-03-04 05:59:17,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 05:59:17,060 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 172 [2025-03-04 05:59:17,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:17,063 INFO L225 Difference]: With dead ends: 1372 [2025-03-04 05:59:17,063 INFO L226 Difference]: Without dead ends: 925 [2025-03-04 05:59:17,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-04 05:59:17,064 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 40 mSDsluCounter, 2251 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 2684 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:17,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 2684 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 05:59:17,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2025-03-04 05:59:17,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 902. [2025-03-04 05:59:17,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 892 states have (on average 1.3531390134529149) internal successors, (1207), 895 states have internal predecessors, (1207), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 05:59:17,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1221 transitions. [2025-03-04 05:59:17,081 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1221 transitions. Word has length 172 [2025-03-04 05:59:17,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:17,082 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1221 transitions. [2025-03-04 05:59:17,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:17,082 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1221 transitions. [2025-03-04 05:59:17,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-04 05:59:17,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:17,085 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] [2025-03-04 05:59:17,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 05:59:17,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:17,289 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:17,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:17,289 INFO L85 PathProgramCache]: Analyzing trace with hash -327391647, now seen corresponding path program 1 times [2025-03-04 05:59:17,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:17,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271440860] [2025-03-04 05:59:17,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:17,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:17,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 05:59:17,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 05:59:17,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:17,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:17,656 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 05:59:17,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:17,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271440860] [2025-03-04 05:59:17,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271440860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:17,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:17,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 05:59:17,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582641991] [2025-03-04 05:59:17,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:17,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 05:59:17,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:17,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 05:59:17,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 05:59:17,657 INFO L87 Difference]: Start difference. First operand 902 states and 1221 transitions. Second operand has 10 states, 10 states have (on average 16.4) internal successors, (164), 10 states have internal predecessors, (164), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:18,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:18,029 INFO L93 Difference]: Finished difference Result 1391 states and 1882 transitions. [2025-03-04 05:59:18,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 05:59:18,030 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.4) internal successors, (164), 10 states have internal predecessors, (164), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 173 [2025-03-04 05:59:18,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:18,032 INFO L225 Difference]: With dead ends: 1391 [2025-03-04 05:59:18,032 INFO L226 Difference]: Without dead ends: 929 [2025-03-04 05:59:18,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 05:59:18,034 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 23 mSDsluCounter, 2667 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3100 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:18,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3100 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 05:59:18,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2025-03-04 05:59:18,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 911. [2025-03-04 05:59:18,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 901 states have (on average 1.3496115427302997) internal successors, (1216), 904 states have internal predecessors, (1216), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 05:59:18,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1230 transitions. [2025-03-04 05:59:18,052 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1230 transitions. Word has length 173 [2025-03-04 05:59:18,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:18,052 INFO L471 AbstractCegarLoop]: Abstraction has 911 states and 1230 transitions. [2025-03-04 05:59:18,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.4) internal successors, (164), 10 states have internal predecessors, (164), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:18,052 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1230 transitions. [2025-03-04 05:59:18,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-04 05:59:18,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:18,054 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] [2025-03-04 05:59:18,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 05:59:18,054 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:18,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:18,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1976329638, now seen corresponding path program 1 times [2025-03-04 05:59:18,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:18,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528598454] [2025-03-04 05:59:18,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:18,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:18,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 05:59:18,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 05:59:18,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:18,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:18,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 05:59:18,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:18,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528598454] [2025-03-04 05:59:18,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528598454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:18,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781812612] [2025-03-04 05:59:18,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:18,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:18,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:18,331 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:18,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 05:59:18,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 05:59:18,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 05:59:18,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:18,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:18,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 05:59:18,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:18,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 05:59:18,850 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:59:18,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781812612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:18,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:59:18,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-04 05:59:18,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579133487] [2025-03-04 05:59:18,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:18,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 05:59:18,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:18,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 05:59:18,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 05:59:18,851 INFO L87 Difference]: Start difference. First operand 911 states and 1230 transitions. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:19,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:19,138 INFO L93 Difference]: Finished difference Result 1397 states and 1882 transitions. [2025-03-04 05:59:19,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 05:59:19,138 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 173 [2025-03-04 05:59:19,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:19,141 INFO L225 Difference]: With dead ends: 1397 [2025-03-04 05:59:19,141 INFO L226 Difference]: Without dead ends: 926 [2025-03-04 05:59:19,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 05:59:19,144 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 10 mSDsluCounter, 1850 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2282 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:19,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2282 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 05:59:19,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2025-03-04 05:59:19,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 911. [2025-03-04 05:59:19,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 901 states have (on average 1.3496115427302997) internal successors, (1216), 904 states have internal predecessors, (1216), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 05:59:19,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1230 transitions. [2025-03-04 05:59:19,166 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1230 transitions. Word has length 173 [2025-03-04 05:59:19,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:19,166 INFO L471 AbstractCegarLoop]: Abstraction has 911 states and 1230 transitions. [2025-03-04 05:59:19,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:19,166 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1230 transitions. [2025-03-04 05:59:19,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-04 05:59:19,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:19,167 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] [2025-03-04 05:59:19,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 05:59:19,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:19,368 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:19,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:19,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1577752086, now seen corresponding path program 1 times [2025-03-04 05:59:19,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:19,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319699598] [2025-03-04 05:59:19,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:19,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:19,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 05:59:19,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 05:59:19,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:19,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:19,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 05:59:19,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:19,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319699598] [2025-03-04 05:59:19,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319699598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:19,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957437841] [2025-03-04 05:59:19,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:19,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:19,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:19,717 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:19,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 05:59:19,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 05:59:20,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 05:59:20,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:20,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:20,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 05:59:20,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:20,150 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 05:59:20,150 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:59:20,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957437841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:20,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:59:20,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-04 05:59:20,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842482809] [2025-03-04 05:59:20,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:20,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 05:59:20,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:20,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 05:59:20,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 05:59:20,152 INFO L87 Difference]: Start difference. First operand 911 states and 1230 transitions. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:20,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:20,373 INFO L93 Difference]: Finished difference Result 1405 states and 1890 transitions. [2025-03-04 05:59:20,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 05:59:20,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 173 [2025-03-04 05:59:20,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:20,377 INFO L225 Difference]: With dead ends: 1405 [2025-03-04 05:59:20,377 INFO L226 Difference]: Without dead ends: 934 [2025-03-04 05:59:20,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 05:59:20,379 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 39 mSDsluCounter, 1866 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 2288 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:20,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 2288 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:59:20,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2025-03-04 05:59:20,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 902. [2025-03-04 05:59:20,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 892 states have (on average 1.3497757847533631) internal successors, (1204), 895 states have internal predecessors, (1204), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 05:59:20,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1218 transitions. [2025-03-04 05:59:20,398 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1218 transitions. Word has length 173 [2025-03-04 05:59:20,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:20,398 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1218 transitions. [2025-03-04 05:59:20,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:20,398 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1218 transitions. [2025-03-04 05:59:20,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-04 05:59:20,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:20,399 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] [2025-03-04 05:59:20,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 05:59:20,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:20,600 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:20,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:20,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1579926666, now seen corresponding path program 1 times [2025-03-04 05:59:20,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:20,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165341972] [2025-03-04 05:59:20,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:20,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:20,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 05:59:20,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 05:59:20,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:20,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:20,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 05:59:20,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:20,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165341972] [2025-03-04 05:59:20,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165341972] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:20,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987444718] [2025-03-04 05:59:20,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:20,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:20,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:20,884 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:20,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 05:59:21,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 05:59:21,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 05:59:21,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:21,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:21,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 05:59:21,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:21,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 05:59:21,280 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:59:21,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987444718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:21,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:59:21,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-04 05:59:21,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977964358] [2025-03-04 05:59:21,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:21,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:59:21,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:21,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:59:21,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:59:21,281 INFO L87 Difference]: Start difference. First operand 902 states and 1218 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:21,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:21,345 INFO L93 Difference]: Finished difference Result 1634 states and 2200 transitions. [2025-03-04 05:59:21,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:59:21,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 173 [2025-03-04 05:59:21,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:21,352 INFO L225 Difference]: With dead ends: 1634 [2025-03-04 05:59:21,352 INFO L226 Difference]: Without dead ends: 905 [2025-03-04 05:59:21,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:59:21,356 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 0 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:21,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1319 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:59:21,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2025-03-04 05:59:21,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 905. [2025-03-04 05:59:21,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 894 states have (on average 1.3501118568232662) internal successors, (1207), 898 states have internal predecessors, (1207), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 05:59:21,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1222 transitions. [2025-03-04 05:59:21,380 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1222 transitions. Word has length 173 [2025-03-04 05:59:21,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:21,381 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1222 transitions. [2025-03-04 05:59:21,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:21,381 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1222 transitions. [2025-03-04 05:59:21,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-04 05:59:21,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:21,382 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 05:59:21,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 05:59:21,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 05:59:21,583 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:21,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:21,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1116127666, now seen corresponding path program 1 times [2025-03-04 05:59:21,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:21,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413106541] [2025-03-04 05:59:21,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:21,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:21,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 05:59:21,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 05:59:21,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:21,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:21,926 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 05:59:21,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:21,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413106541] [2025-03-04 05:59:21,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413106541] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:21,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266570061] [2025-03-04 05:59:21,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:21,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:21,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:21,930 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:21,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 05:59:22,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 05:59:22,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 05:59:22,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:22,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:22,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 05:59:22,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 05:59:22,503 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:59:22,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266570061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:22,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:59:22,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-03-04 05:59:22,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100014154] [2025-03-04 05:59:22,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:22,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 05:59:22,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:22,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 05:59:22,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 05:59:22,505 INFO L87 Difference]: Start difference. First operand 905 states and 1222 transitions. Second operand has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:22,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:22,998 INFO L93 Difference]: Finished difference Result 1691 states and 2283 transitions. [2025-03-04 05:59:22,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 05:59:22,999 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 175 [2025-03-04 05:59:22,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:23,002 INFO L225 Difference]: With dead ends: 1691 [2025-03-04 05:59:23,002 INFO L226 Difference]: Without dead ends: 919 [2025-03-04 05:59:23,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 05:59:23,003 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 12 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2021 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:23,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2021 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 05:59:23,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2025-03-04 05:59:23,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 905. [2025-03-04 05:59:23,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 894 states have (on average 1.3501118568232662) internal successors, (1207), 898 states have internal predecessors, (1207), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 05:59:23,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1222 transitions. [2025-03-04 05:59:23,022 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1222 transitions. Word has length 175 [2025-03-04 05:59:23,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:23,022 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1222 transitions. [2025-03-04 05:59:23,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:23,022 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1222 transitions. [2025-03-04 05:59:23,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-04 05:59:23,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:23,023 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 05:59:23,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 05:59:23,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 05:59:23,224 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:23,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:23,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1239525026, now seen corresponding path program 1 times [2025-03-04 05:59:23,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:23,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874293968] [2025-03-04 05:59:23,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:23,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:23,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 05:59:23,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 05:59:23,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:23,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:23,565 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 05:59:23,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:23,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874293968] [2025-03-04 05:59:23,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874293968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:23,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:23,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 05:59:23,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403973007] [2025-03-04 05:59:23,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:23,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 05:59:23,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:23,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 05:59:23,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 05:59:23,567 INFO L87 Difference]: Start difference. First operand 905 states and 1222 transitions. Second operand has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:24,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:24,053 INFO L93 Difference]: Finished difference Result 1698 states and 2289 transitions. [2025-03-04 05:59:24,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 05:59:24,053 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 176 [2025-03-04 05:59:24,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:24,056 INFO L225 Difference]: With dead ends: 1698 [2025-03-04 05:59:24,056 INFO L226 Difference]: Without dead ends: 931 [2025-03-04 05:59:24,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 05:59:24,057 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 20 mSDsluCounter, 2333 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2760 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:24,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2760 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 05:59:24,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-03-04 05:59:24,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 919. [2025-03-04 05:59:24,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 908 states have (on average 1.3491189427312775) internal successors, (1225), 912 states have internal predecessors, (1225), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 05:59:24,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1240 transitions. [2025-03-04 05:59:24,076 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1240 transitions. Word has length 176 [2025-03-04 05:59:24,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:24,076 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1240 transitions. [2025-03-04 05:59:24,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:24,076 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1240 transitions. [2025-03-04 05:59:24,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-04 05:59:24,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:24,077 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 05:59:24,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 05:59:24,077 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:24,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:24,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1911620972, now seen corresponding path program 1 times [2025-03-04 05:59:24,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:24,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036491462] [2025-03-04 05:59:24,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:24,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:24,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 05:59:24,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 05:59:24,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:24,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:24,433 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 05:59:24,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:24,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036491462] [2025-03-04 05:59:24,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036491462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:24,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30823213] [2025-03-04 05:59:24,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:24,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:24,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:24,435 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:24,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 05:59:24,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 05:59:24,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 05:59:24,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:24,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:24,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 05:59:24,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:24,870 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 05:59:24,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:59:24,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30823213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:24,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:59:24,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-03-04 05:59:24,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675104575] [2025-03-04 05:59:24,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:24,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 05:59:24,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:24,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 05:59:24,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 05:59:24,873 INFO L87 Difference]: Start difference. First operand 919 states and 1240 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:25,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:25,199 INFO L93 Difference]: Finished difference Result 1717 states and 2318 transitions. [2025-03-04 05:59:25,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 05:59:25,200 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 176 [2025-03-04 05:59:25,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:25,203 INFO L225 Difference]: With dead ends: 1717 [2025-03-04 05:59:25,203 INFO L226 Difference]: Without dead ends: 943 [2025-03-04 05:59:25,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 05:59:25,204 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 17 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2044 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:25,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2044 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 05:59:25,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2025-03-04 05:59:25,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 933. [2025-03-04 05:59:25,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 922 states have (on average 1.3503253796095445) internal successors, (1245), 926 states have internal predecessors, (1245), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 05:59:25,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1260 transitions. [2025-03-04 05:59:25,225 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1260 transitions. Word has length 176 [2025-03-04 05:59:25,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:25,226 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1260 transitions. [2025-03-04 05:59:25,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:25,226 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1260 transitions. [2025-03-04 05:59:25,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-04 05:59:25,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:25,227 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 05:59:25,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 05:59:25,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 05:59:25,428 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:25,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:25,428 INFO L85 PathProgramCache]: Analyzing trace with hash 29720967, now seen corresponding path program 1 times [2025-03-04 05:59:25,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:25,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405213729] [2025-03-04 05:59:25,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:25,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:25,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-04 05:59:25,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-04 05:59:25,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:25,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:25,795 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 05:59:25,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:25,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405213729] [2025-03-04 05:59:25,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405213729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:25,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:25,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 05:59:25,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450893669] [2025-03-04 05:59:25,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:25,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 05:59:25,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:25,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 05:59:25,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 05:59:25,796 INFO L87 Difference]: Start difference. First operand 933 states and 1260 transitions. Second operand has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:26,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:26,306 INFO L93 Difference]: Finished difference Result 1737 states and 2344 transitions. [2025-03-04 05:59:26,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 05:59:26,306 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 177 [2025-03-04 05:59:26,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:26,309 INFO L225 Difference]: With dead ends: 1737 [2025-03-04 05:59:26,309 INFO L226 Difference]: Without dead ends: 951 [2025-03-04 05:59:26,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 05:59:26,310 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 26 mSDsluCounter, 2279 mSDsCounter, 0 mSdLazyCounter, 1233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2712 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:26,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2712 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1233 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 05:59:26,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2025-03-04 05:59:26,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 939. [2025-03-04 05:59:26,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 928 states have (on average 1.3480603448275863) internal successors, (1251), 932 states have internal predecessors, (1251), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 05:59:26,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1266 transitions. [2025-03-04 05:59:26,327 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1266 transitions. Word has length 177 [2025-03-04 05:59:26,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:26,327 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 1266 transitions. [2025-03-04 05:59:26,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:26,327 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1266 transitions. [2025-03-04 05:59:26,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-04 05:59:26,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:26,328 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 05:59:26,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 05:59:26,329 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:26,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:26,330 INFO L85 PathProgramCache]: Analyzing trace with hash -606305067, now seen corresponding path program 1 times [2025-03-04 05:59:26,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:26,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661715259] [2025-03-04 05:59:26,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:26,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:26,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-04 05:59:26,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-04 05:59:26,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:26,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 05:59:26,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:26,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661715259] [2025-03-04 05:59:26,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661715259] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:26,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050621783] [2025-03-04 05:59:26,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:26,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:26,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:26,624 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:26,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 05:59:26,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-04 05:59:27,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-04 05:59:27,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:27,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:27,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 114 conjuncts are in the unsatisfiable core [2025-03-04 05:59:27,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:27,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 05:59:27,444 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-03-04 05:59:27,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-03-04 05:59:27,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 05:59:27,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 05:59:27,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-04 05:59:27,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 05:59:27,705 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 05:59:27,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 51 [2025-03-04 05:59:27,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-04 06:00:08,970 INFO L224 Elim1Store]: Index analysis took 1018 ms