./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3db5e6ee1090a5741e563a010c3676d5357df7fec89fabe5a888b2d307357a0e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:26:31,022 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:26:31,075 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 10:26:31,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:26:31,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:26:31,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:26:31,099 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:26:31,099 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:26:31,100 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 10:26:31,100 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 10:26:31,100 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:26:31,101 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:26:31,101 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:26:31,101 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:26:31,101 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:26:31,101 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:26:31,101 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:26:31,102 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:26:31,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:26:31,102 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:26:31,102 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:26:31,102 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:26:31,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:26:31,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:26:31,102 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:26:31,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:26:31,102 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:26:31,102 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:26:31,102 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:26:31,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:26:31,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 10:26:31,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:26:31,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:26:31,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:26:31,102 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:26:31,102 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:26:31,102 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:26:31,102 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:26:31,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:26:31,102 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:26:31,102 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:26:31,103 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:26:31,103 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:26:31,103 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3db5e6ee1090a5741e563a010c3676d5357df7fec89fabe5a888b2d307357a0e [2025-03-17 10:26:31,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:26:31,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:26:31,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:26:31,364 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:26:31,365 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:26:31,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-2.i [2025-03-17 10:26:32,665 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf84a285f/c7293a63fc3849f9b5b52970493472b1/FLAG8c35bf25a [2025-03-17 10:26:33,014 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:26:33,014 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-2.i [2025-03-17 10:26:33,035 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf84a285f/c7293a63fc3849f9b5b52970493472b1/FLAG8c35bf25a [2025-03-17 10:26:33,231 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf84a285f/c7293a63fc3849f9b5b52970493472b1 [2025-03-17 10:26:33,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:26:33,234 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:26:33,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:26:33,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:26:33,238 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:26:33,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:26:33" (1/1) ... [2025-03-17 10:26:33,240 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2adabe3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:26:33, skipping insertion in model container [2025-03-17 10:26:33,240 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:26:33" (1/1) ... [2025-03-17 10:26:33,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:26:33,578 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-2.i[33022,33035] [2025-03-17 10:26:33,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:26:33,743 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:26:33,775 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-2.i[33022,33035] [2025-03-17 10:26:33,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:26:33,903 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:26:33,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:26:33 WrapperNode [2025-03-17 10:26:33,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:26:33,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:26:33,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:26:33,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:26:33,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:26:33" (1/1) ... [2025-03-17 10:26:33,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:26:33" (1/1) ... [2025-03-17 10:26:34,018 INFO L138 Inliner]: procedures = 177, calls = 557, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3464 [2025-03-17 10:26:34,019 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:26:34,019 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:26:34,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:26:34,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:26:34,026 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:26:33" (1/1) ... [2025-03-17 10:26:34,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:26:33" (1/1) ... [2025-03-17 10:26:34,046 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:26:33" (1/1) ... [2025-03-17 10:26:34,197 INFO L175 MemorySlicer]: Split 528 memory accesses to 3 slices as follows [2, 106, 420]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 94 writes are split as follows [0, 4, 90]. [2025-03-17 10:26:34,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:26:33" (1/1) ... [2025-03-17 10:26:34,198 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:26:33" (1/1) ... [2025-03-17 10:26:34,252 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:26:33" (1/1) ... [2025-03-17 10:26:34,258 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:26:33" (1/1) ... [2025-03-17 10:26:34,267 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:26:33" (1/1) ... [2025-03-17 10:26:34,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:26:33" (1/1) ... [2025-03-17 10:26:34,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:26:34,299 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:26:34,299 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:26:34,299 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:26:34,300 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:26:33" (1/1) ... [2025-03-17 10:26:34,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:26:34,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:26:34,325 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 10:26:34,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 10:26:34,344 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2025-03-17 10:26:34,344 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2025-03-17 10:26:34,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 10:26:34,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 10:26:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 10:26:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 10:26:34,345 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 10:26:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 10:26:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 10:26:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 10:26:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 10:26:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 10:26:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 10:26:34,345 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 10:26:34,346 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 10:26:34,346 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 10:26:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 10:26:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:26:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 10:26:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 10:26:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 10:26:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 10:26:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 10:26:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 10:26:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 10:26:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:26:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 10:26:34,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 10:26:34,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 10:26:34,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:26:34,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:26:34,588 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:26:34,589 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:26:36,663 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L731: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-17 10:26:36,842 INFO L? ?]: Removed 806 outVars from TransFormulas that were not future-live. [2025-03-17 10:26:36,842 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:26:36,927 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:26:36,928 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 10:26:36,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:26:36 BoogieIcfgContainer [2025-03-17 10:26:36,928 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:26:36,930 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:26:36,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:26:36,934 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:26:36,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:26:33" (1/3) ... [2025-03-17 10:26:36,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f12f809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:26:36, skipping insertion in model container [2025-03-17 10:26:36,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:26:33" (2/3) ... [2025-03-17 10:26:36,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f12f809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:26:36, skipping insertion in model container [2025-03-17 10:26:36,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:26:36" (3/3) ... [2025-03-17 10:26:36,938 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test10-2.i [2025-03-17 10:26:36,951 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:26:36,953 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test10-2.i that has 6 procedures, 1056 locations, 1 initial locations, 83 loop locations, and 1 error locations. [2025-03-17 10:26:37,010 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:26:37,018 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;@31a575fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:26:37,018 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 10:26:37,024 INFO L276 IsEmpty]: Start isEmpty. Operand has 1048 states, 1029 states have (on average 1.6258503401360545) internal successors, (1673), 1034 states have internal predecessors, (1673), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 10:26:37,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 10:26:37,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:26:37,031 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:26:37,032 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:26:37,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:26:37,037 INFO L85 PathProgramCache]: Analyzing trace with hash 2010662633, now seen corresponding path program 1 times [2025-03-17 10:26:37,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:26:37,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385374514] [2025-03-17 10:26:37,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:26:37,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:26:37,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 10:26:37,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 10:26:37,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:26:37,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:26:37,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:26:37,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:26:37,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385374514] [2025-03-17 10:26:37,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385374514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:26:37,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:26:37,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:26:37,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007314024] [2025-03-17 10:26:37,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:26:37,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 10:26:37,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:26:37,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 10:26:37,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 10:26:37,227 INFO L87 Difference]: Start difference. First operand has 1048 states, 1029 states have (on average 1.6258503401360545) internal successors, (1673), 1034 states have internal predecessors, (1673), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:26:37,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:26:37,475 INFO L93 Difference]: Finished difference Result 2095 states and 3409 transitions. [2025-03-17 10:26:37,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 10:26:37,476 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-17 10:26:37,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:26:37,489 INFO L225 Difference]: With dead ends: 2095 [2025-03-17 10:26:37,490 INFO L226 Difference]: Without dead ends: 1011 [2025-03-17 10:26:37,497 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-17 10:26:37,499 INFO L435 NwaCegarLoop]: 1425 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:26:37,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1425 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:26:37,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2025-03-17 10:26:37,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2025-03-17 10:26:37,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 993 states have (on average 1.4793554884189326) internal successors, (1469), 998 states have internal predecessors, (1469), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:26:37,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1496 transitions. [2025-03-17 10:26:37,581 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1496 transitions. Word has length 12 [2025-03-17 10:26:37,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:26:37,582 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1496 transitions. [2025-03-17 10:26:37,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:26:37,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1496 transitions. [2025-03-17 10:26:37,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 10:26:37,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:26:37,587 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] [2025-03-17 10:26:37,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:26:37,587 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:26:37,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:26:37,588 INFO L85 PathProgramCache]: Analyzing trace with hash -2083463603, now seen corresponding path program 1 times [2025-03-17 10:26:37,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:26:37,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146030839] [2025-03-17 10:26:37,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:26:37,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:26:37,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 10:26:37,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 10:26:37,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:26:37,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:26:38,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:26:38,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:26:38,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146030839] [2025-03-17 10:26:38,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146030839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:26:38,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:26:38,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:26:38,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789771825] [2025-03-17 10:26:38,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:26:38,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:26:38,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:26:38,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:26:38,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:26:38,012 INFO L87 Difference]: Start difference. First operand 1011 states and 1496 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:26:38,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:26:38,401 INFO L93 Difference]: Finished difference Result 2017 states and 2987 transitions. [2025-03-17 10:26:38,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:26:38,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-17 10:26:38,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:26:38,413 INFO L225 Difference]: With dead ends: 2017 [2025-03-17 10:26:38,413 INFO L226 Difference]: Without dead ends: 1391 [2025-03-17 10:26:38,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:26:38,416 INFO L435 NwaCegarLoop]: 1411 mSDtfsCounter, 542 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 4128 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:26:38,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 4128 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:26:38,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2025-03-17 10:26:38,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1013. [2025-03-17 10:26:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 995 states have (on average 1.478391959798995) internal successors, (1471), 1000 states have internal predecessors, (1471), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:26:38,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1498 transitions. [2025-03-17 10:26:38,448 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1498 transitions. Word has length 65 [2025-03-17 10:26:38,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:26:38,448 INFO L471 AbstractCegarLoop]: Abstraction has 1013 states and 1498 transitions. [2025-03-17 10:26:38,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:26:38,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1498 transitions. [2025-03-17 10:26:38,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 10:26:38,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:26:38,453 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:26:38,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:26:38,453 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:26:38,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:26:38,454 INFO L85 PathProgramCache]: Analyzing trace with hash -447013746, now seen corresponding path program 1 times [2025-03-17 10:26:38,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:26:38,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183804769] [2025-03-17 10:26:38,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:26:38,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:26:38,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 10:26:38,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 10:26:38,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:26:38,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:26:38,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:26:38,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:26:38,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183804769] [2025-03-17 10:26:38,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183804769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:26:38,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:26:38,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:26:38,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799311496] [2025-03-17 10:26:38,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:26:38,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:26:38,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:26:38,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:26:38,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:26:38,943 INFO L87 Difference]: Start difference. First operand 1013 states and 1498 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:26:39,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:26:39,291 INFO L93 Difference]: Finished difference Result 2401 states and 3546 transitions. [2025-03-17 10:26:39,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:26:39,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2025-03-17 10:26:39,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:26:39,297 INFO L225 Difference]: With dead ends: 2401 [2025-03-17 10:26:39,297 INFO L226 Difference]: Without dead ends: 1391 [2025-03-17 10:26:39,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:26:39,302 INFO L435 NwaCegarLoop]: 1411 mSDtfsCounter, 538 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 4128 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:26:39,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 4128 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:26:39,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2025-03-17 10:26:39,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1016. [2025-03-17 10:26:39,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 998 states have (on average 1.4769539078156313) internal successors, (1474), 1003 states have internal predecessors, (1474), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:26:39,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1501 transitions. [2025-03-17 10:26:39,326 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1501 transitions. Word has length 140 [2025-03-17 10:26:39,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:26:39,327 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1501 transitions. [2025-03-17 10:26:39,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:26:39,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1501 transitions. [2025-03-17 10:26:39,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-17 10:26:39,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:26:39,330 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:26:39,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:26:39,330 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:26:39,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:26:39,334 INFO L85 PathProgramCache]: Analyzing trace with hash -994193565, now seen corresponding path program 1 times [2025-03-17 10:26:39,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:26:39,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251834500] [2025-03-17 10:26:39,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:26:39,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:26:39,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-17 10:26:39,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-17 10:26:39,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:26:39,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:26:39,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:26:39,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:26:39,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251834500] [2025-03-17 10:26:39,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251834500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:26:39,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:26:39,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:26:39,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630916587] [2025-03-17 10:26:39,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:26:39,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:26:39,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:26:39,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:26:39,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:26:39,697 INFO L87 Difference]: Start difference. First operand 1016 states and 1501 transitions. Second operand has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:26:39,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:26:39,951 INFO L93 Difference]: Finished difference Result 1984 states and 2930 transitions. [2025-03-17 10:26:39,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:26:39,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 209 [2025-03-17 10:26:39,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:26:39,956 INFO L225 Difference]: With dead ends: 1984 [2025-03-17 10:26:39,956 INFO L226 Difference]: Without dead ends: 974 [2025-03-17 10:26:39,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:26:39,958 INFO L435 NwaCegarLoop]: 1284 mSDtfsCounter, 30 mSDsluCounter, 2549 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3833 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:26:39,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3833 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:26:39,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-03-17 10:26:39,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2025-03-17 10:26:39,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 956 states have (on average 1.461297071129707) internal successors, (1397), 961 states have internal predecessors, (1397), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:26:39,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1424 transitions. [2025-03-17 10:26:39,980 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1424 transitions. Word has length 209 [2025-03-17 10:26:39,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:26:39,980 INFO L471 AbstractCegarLoop]: Abstraction has 974 states and 1424 transitions. [2025-03-17 10:26:39,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:26:39,982 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1424 transitions. [2025-03-17 10:26:39,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-17 10:26:39,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:26:39,983 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:26:39,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:26:39,983 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:26:39,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:26:39,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1733001187, now seen corresponding path program 1 times [2025-03-17 10:26:39,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:26:39,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319448913] [2025-03-17 10:26:39,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:26:39,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:26:40,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-17 10:26:40,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-17 10:26:40,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:26:40,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:26:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:26:40,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:26:40,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319448913] [2025-03-17 10:26:40,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319448913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:26:40,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:26:40,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:26:40,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394608567] [2025-03-17 10:26:40,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:26:40,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:26:40,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:26:40,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:26:40,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:26:40,197 INFO L87 Difference]: Start difference. First operand 974 states and 1424 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:26:40,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:26:40,452 INFO L93 Difference]: Finished difference Result 2465 states and 3617 transitions. [2025-03-17 10:26:40,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:26:40,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 209 [2025-03-17 10:26:40,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:26:40,458 INFO L225 Difference]: With dead ends: 2465 [2025-03-17 10:26:40,458 INFO L226 Difference]: Without dead ends: 1497 [2025-03-17 10:26:40,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:26:40,461 INFO L435 NwaCegarLoop]: 1300 mSDtfsCounter, 710 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 2582 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:26:40,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 2582 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:26:40,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2025-03-17 10:26:40,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1340. [2025-03-17 10:26:40,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 1320 states have (on average 1.4643939393939394) internal successors, (1933), 1325 states have internal predecessors, (1933), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 10:26:40,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1964 transitions. [2025-03-17 10:26:40,493 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1964 transitions. Word has length 209 [2025-03-17 10:26:40,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:26:40,493 INFO L471 AbstractCegarLoop]: Abstraction has 1340 states and 1964 transitions. [2025-03-17 10:26:40,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:26:40,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1964 transitions. [2025-03-17 10:26:40,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-17 10:26:40,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:26:40,496 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:26:40,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:26:40,496 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:26:40,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:26:40,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1856962892, now seen corresponding path program 1 times [2025-03-17 10:26:40,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:26:40,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930426281] [2025-03-17 10:26:40,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:26:40,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:26:40,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-17 10:26:40,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-17 10:26:40,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:26:40,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:26:40,888 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-17 10:26:40,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:26:40,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930426281] [2025-03-17 10:26:40,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930426281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:26:40,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:26:40,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:26:40,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816679807] [2025-03-17 10:26:40,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:26:40,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:26:40,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:26:40,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:26:40,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:26:40,890 INFO L87 Difference]: Start difference. First operand 1340 states and 1964 transitions. Second operand has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:26:41,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:26:41,127 INFO L93 Difference]: Finished difference Result 2549 states and 3742 transitions. [2025-03-17 10:26:41,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:26:41,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 224 [2025-03-17 10:26:41,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:26:41,134 INFO L225 Difference]: With dead ends: 2549 [2025-03-17 10:26:41,134 INFO L226 Difference]: Without dead ends: 1298 [2025-03-17 10:26:41,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:26:41,136 INFO L435 NwaCegarLoop]: 1210 mSDtfsCounter, 30 mSDsluCounter, 2401 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3611 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:26:41,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3611 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:26:41,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2025-03-17 10:26:41,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1298. [2025-03-17 10:26:41,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 1278 states have (on average 1.4522691705790298) internal successors, (1856), 1283 states have internal predecessors, (1856), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 10:26:41,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1887 transitions. [2025-03-17 10:26:41,164 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1887 transitions. Word has length 224 [2025-03-17 10:26:41,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:26:41,164 INFO L471 AbstractCegarLoop]: Abstraction has 1298 states and 1887 transitions. [2025-03-17 10:26:41,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:26:41,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1887 transitions. [2025-03-17 10:26:41,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-17 10:26:41,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:26:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:26:41,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:26:41,167 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:26:41,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:26:41,167 INFO L85 PathProgramCache]: Analyzing trace with hash -992638405, now seen corresponding path program 1 times [2025-03-17 10:26:41,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:26:41,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054399752] [2025-03-17 10:26:41,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:26:41,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:26:41,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-17 10:26:41,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-17 10:26:41,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:26:41,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:26:41,427 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-17 10:26:41,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:26:41,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054399752] [2025-03-17 10:26:41,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054399752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:26:41,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:26:41,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:26:41,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283158549] [2025-03-17 10:26:41,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:26:41,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:26:41,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:26:41,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:26:41,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:26:41,430 INFO L87 Difference]: Start difference. First operand 1298 states and 1887 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:26:41,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:26:41,662 INFO L93 Difference]: Finished difference Result 3069 states and 4479 transitions. [2025-03-17 10:26:41,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:26:41,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 224 [2025-03-17 10:26:41,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:26:41,670 INFO L225 Difference]: With dead ends: 3069 [2025-03-17 10:26:41,670 INFO L226 Difference]: Without dead ends: 1860 [2025-03-17 10:26:41,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:26:41,673 INFO L435 NwaCegarLoop]: 1435 mSDtfsCounter, 592 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 2644 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:26:41,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 2644 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:26:41,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2025-03-17 10:26:41,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1855. [2025-03-17 10:26:41,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1855 states, 1829 states have (on average 1.4554401312192455) internal successors, (2662), 1834 states have internal predecessors, (2662), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 10:26:41,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1855 states to 1855 states and 2705 transitions. [2025-03-17 10:26:41,712 INFO L78 Accepts]: Start accepts. Automaton has 1855 states and 2705 transitions. Word has length 224 [2025-03-17 10:26:41,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:26:41,712 INFO L471 AbstractCegarLoop]: Abstraction has 1855 states and 2705 transitions. [2025-03-17 10:26:41,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:26:41,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1855 states and 2705 transitions. [2025-03-17 10:26:41,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-03-17 10:26:41,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:26:41,715 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:26:41,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:26:41,716 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:26:41,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:26:41,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1664845679, now seen corresponding path program 1 times [2025-03-17 10:26:41,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:26:41,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033596676] [2025-03-17 10:26:41,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:26:41,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:26:41,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-17 10:26:41,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-17 10:26:41,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:26:41,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:26:41,979 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:26:41,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:26:41,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033596676] [2025-03-17 10:26:41,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033596676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:26:41,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:26:41,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:26:41,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040587141] [2025-03-17 10:26:41,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:26:41,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:26:41,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:26:41,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:26:41,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:26:41,981 INFO L87 Difference]: Start difference. First operand 1855 states and 2705 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 10:26:43,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:26:43,408 INFO L93 Difference]: Finished difference Result 3055 states and 4461 transitions. [2025-03-17 10:26:43,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:26:43,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 239 [2025-03-17 10:26:43,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:26:43,414 INFO L225 Difference]: With dead ends: 3055 [2025-03-17 10:26:43,414 INFO L226 Difference]: Without dead ends: 1432 [2025-03-17 10:26:43,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:26:43,417 INFO L435 NwaCegarLoop]: 1255 mSDtfsCounter, 2348 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2348 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 10:26:43,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2348 Valid, 1435 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 10:26:43,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2025-03-17 10:26:43,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1432. [2025-03-17 10:26:43,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1411 states have (on average 1.440822111977321) internal successors, (2033), 1416 states have internal predecessors, (2033), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 10:26:43,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2066 transitions. [2025-03-17 10:26:43,450 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2066 transitions. Word has length 239 [2025-03-17 10:26:43,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:26:43,450 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 2066 transitions. [2025-03-17 10:26:43,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 10:26:43,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2066 transitions. [2025-03-17 10:26:43,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-17 10:26:43,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:26:43,453 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:26:43,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 10:26:43,453 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:26:43,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:26:43,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1358130275, now seen corresponding path program 1 times [2025-03-17 10:26:43,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:26:43,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250209059] [2025-03-17 10:26:43,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:26:43,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:26:43,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-17 10:26:43,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-17 10:26:43,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:26:43,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:26:43,808 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-17 10:26:43,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:26:43,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250209059] [2025-03-17 10:26:43,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250209059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:26:43,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:26:43,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:26:43,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846944899] [2025-03-17 10:26:43,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:26:43,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:26:43,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:26:43,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:26:43,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:26:43,810 INFO L87 Difference]: Start difference. First operand 1432 states and 2066 transitions. Second operand has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:26:44,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:26:44,082 INFO L93 Difference]: Finished difference Result 2296 states and 3355 transitions. [2025-03-17 10:26:44,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:26:44,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 249 [2025-03-17 10:26:44,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:26:44,088 INFO L225 Difference]: With dead ends: 2296 [2025-03-17 10:26:44,088 INFO L226 Difference]: Without dead ends: 1390 [2025-03-17 10:26:44,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:26:44,090 INFO L435 NwaCegarLoop]: 1134 mSDtfsCounter, 30 mSDsluCounter, 2249 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3383 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:26:44,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3383 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:26:44,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2025-03-17 10:26:44,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1390. [2025-03-17 10:26:44,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1369 states have (on average 1.4287801314828341) internal successors, (1956), 1374 states have internal predecessors, (1956), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 10:26:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1989 transitions. [2025-03-17 10:26:44,120 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1989 transitions. Word has length 249 [2025-03-17 10:26:44,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:26:44,121 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 1989 transitions. [2025-03-17 10:26:44,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:26:44,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1989 transitions. [2025-03-17 10:26:44,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-17 10:26:44,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:26:44,123 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:26:44,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 10:26:44,123 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:26:44,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:26:44,124 INFO L85 PathProgramCache]: Analyzing trace with hash -27813444, now seen corresponding path program 1 times [2025-03-17 10:26:44,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:26:44,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900411302] [2025-03-17 10:26:44,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:26:44,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:26:44,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-17 10:26:44,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-17 10:26:44,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:26:44,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:26:44,916 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:26:44,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:26:44,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900411302] [2025-03-17 10:26:44,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900411302] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:26:44,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897322184] [2025-03-17 10:26:44,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:26:44,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:26:44,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:26:44,919 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:26:44,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 10:26:45,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-17 10:26:45,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-17 10:26:45,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:26:45,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:26:45,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 1260 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 10:26:45,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:26:45,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 10:26:45,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 10:26:45,868 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:26:45,868 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 10:26:45,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897322184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:26:45,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 10:26:45,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-03-17 10:26:45,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48728747] [2025-03-17 10:26:45,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:26:45,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:26:45,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:26:45,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:26:45,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-17 10:26:45,871 INFO L87 Difference]: Start difference. First operand 1390 states and 1989 transitions. Second operand has 7 states, 7 states have (on average 32.857142857142854) internal successors, (230), 7 states have internal predecessors, (230), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:26:46,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:26:46,483 INFO L93 Difference]: Finished difference Result 2576 states and 3701 transitions. [2025-03-17 10:26:46,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 10:26:46,484 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.857142857142854) internal successors, (230), 7 states have internal predecessors, (230), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 249 [2025-03-17 10:26:46,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:26:46,490 INFO L225 Difference]: With dead ends: 2576 [2025-03-17 10:26:46,490 INFO L226 Difference]: Without dead ends: 1709 [2025-03-17 10:26:46,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 238 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-17 10:26:46,492 INFO L435 NwaCegarLoop]: 1092 mSDtfsCounter, 1257 mSDsluCounter, 3605 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 4697 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 10:26:46,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1265 Valid, 4697 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 10:26:46,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states. [2025-03-17 10:26:46,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1558. [2025-03-17 10:26:46,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1527 states have (on average 1.4204322200392927) internal successors, (2169), 1536 states have internal predecessors, (2169), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (23), 17 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 10:26:46,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2216 transitions. [2025-03-17 10:26:46,533 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2216 transitions. Word has length 249 [2025-03-17 10:26:46,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:26:46,533 INFO L471 AbstractCegarLoop]: Abstraction has 1558 states and 2216 transitions. [2025-03-17 10:26:46,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.857142857142854) internal successors, (230), 7 states have internal predecessors, (230), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:26:46,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2216 transitions. [2025-03-17 10:26:46,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-17 10:26:46,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:26:46,537 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:26:46,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 10:26:46,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 10:26:46,738 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:26:46,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:26:46,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1119449988, now seen corresponding path program 1 times [2025-03-17 10:26:46,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:26:46,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835444036] [2025-03-17 10:26:46,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:26:46,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:26:46,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-17 10:26:46,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-17 10:26:46,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:26:46,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:26:47,751 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 72 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:26:47,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:26:47,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835444036] [2025-03-17 10:26:47,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835444036] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:26:47,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899136719] [2025-03-17 10:26:47,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:26:47,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:26:47,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:26:47,753 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:26:47,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 10:26:48,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-17 10:26:48,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-17 10:26:48,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:26:48,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:26:48,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 1639 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 10:26:48,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:26:48,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 10:26:48,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 10:26:48,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 10:26:48,731 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 72 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:26:48,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:26:49,018 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 72 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:26:49,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899136719] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:26:49,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:26:49,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2025-03-17 10:26:49,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274136989] [2025-03-17 10:26:49,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:26:49,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 10:26:49,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:26:49,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 10:26:49,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-17 10:26:49,022 INFO L87 Difference]: Start difference. First operand 1558 states and 2216 transitions. Second operand has 12 states, 12 states have (on average 39.416666666666664) internal successors, (473), 12 states have internal predecessors, (473), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 10:26:49,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:26:49,829 INFO L93 Difference]: Finished difference Result 3810 states and 5370 transitions. [2025-03-17 10:26:49,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 10:26:49,830 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 39.416666666666664) internal successors, (473), 12 states have internal predecessors, (473), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 324 [2025-03-17 10:26:49,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:26:49,840 INFO L225 Difference]: With dead ends: 3810 [2025-03-17 10:26:49,840 INFO L226 Difference]: Without dead ends: 2484 [2025-03-17 10:26:49,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 658 GetRequests, 637 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2025-03-17 10:26:49,844 INFO L435 NwaCegarLoop]: 1120 mSDtfsCounter, 2124 mSDsluCounter, 7008 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2142 SdHoareTripleChecker+Valid, 8128 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 10:26:49,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2142 Valid, 8128 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 10:26:49,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2025-03-17 10:26:49,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 2202. [2025-03-17 10:26:49,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2202 states, 2159 states have (on average 1.3955534969893468) internal successors, (3013), 2168 states have internal predecessors, (3013), 35 states have call successors, (35), 7 states have call predecessors, (35), 7 states have return successors, (34), 28 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 10:26:49,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 3082 transitions. [2025-03-17 10:26:49,893 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 3082 transitions. Word has length 324 [2025-03-17 10:26:49,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:26:49,894 INFO L471 AbstractCegarLoop]: Abstraction has 2202 states and 3082 transitions. [2025-03-17 10:26:49,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 39.416666666666664) internal successors, (473), 12 states have internal predecessors, (473), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 10:26:49,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 3082 transitions. [2025-03-17 10:26:49,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 757 [2025-03-17 10:26:49,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:26:49,904 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:26:49,917 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-17 10:26:50,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 10:26:50,105 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:26:50,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:26:50,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1709302679, now seen corresponding path program 1 times [2025-03-17 10:26:50,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:26:50,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329244443] [2025-03-17 10:26:50,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:26:50,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:26:50,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 756 statements into 1 equivalence classes. [2025-03-17 10:26:50,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 756 of 756 statements. [2025-03-17 10:26:50,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:26:50,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:26:54,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 288 proven. 872 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:26:54,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:26:54,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329244443] [2025-03-17 10:26:54,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329244443] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:26:54,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202638526] [2025-03-17 10:26:54,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:26:54,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:26:54,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:26:54,435 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-17 10:26:54,437 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-17 10:26:54,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 756 statements into 1 equivalence classes. [2025-03-17 10:26:55,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 756 of 756 statements. [2025-03-17 10:26:55,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:26:55,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:26:55,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 3754 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 10:26:55,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:26:55,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 10:26:55,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 10:26:55,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 10:26:56,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 10:26:56,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 10:26:56,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 10:26:56,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 288 proven. 872 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:26:56,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:26:56,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 288 proven. 872 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:26:56,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202638526] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:26:56,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:26:56,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 21 [2025-03-17 10:26:56,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928141310] [2025-03-17 10:26:56,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:26:56,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 10:26:56,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:26:56,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 10:26:56,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2025-03-17 10:26:56,893 INFO L87 Difference]: Start difference. First operand 2202 states and 3082 transitions. Second operand has 21 states, 21 states have (on average 63.95238095238095) internal successors, (1343), 21 states have internal predecessors, (1343), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 10:26:58,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:26:58,138 INFO L93 Difference]: Finished difference Result 5532 states and 7701 transitions. [2025-03-17 10:26:58,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 10:26:58,139 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 63.95238095238095) internal successors, (1343), 21 states have internal predecessors, (1343), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 756 [2025-03-17 10:26:58,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:26:58,153 INFO L225 Difference]: With dead ends: 5532 [2025-03-17 10:26:58,154 INFO L226 Difference]: Without dead ends: 4206 [2025-03-17 10:26:58,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1537 GetRequests, 1501 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=286, Invalid=644, Unknown=0, NotChecked=0, Total=930 [2025-03-17 10:26:58,158 INFO L435 NwaCegarLoop]: 1120 mSDtfsCounter, 4417 mSDsluCounter, 10875 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4459 SdHoareTripleChecker+Valid, 11995 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 10:26:58,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4459 Valid, 11995 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1520 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 10:26:58,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4206 states. [2025-03-17 10:26:58,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4206 to 3924. [2025-03-17 10:26:58,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3924 states, 3857 states have (on average 1.3723100855587245) internal successors, (5293), 3866 states have internal predecessors, (5293), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 10:26:58,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3924 states to 3924 states and 5410 transitions. [2025-03-17 10:26:58,277 INFO L78 Accepts]: Start accepts. Automaton has 3924 states and 5410 transitions. Word has length 756 [2025-03-17 10:26:58,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:26:58,278 INFO L471 AbstractCegarLoop]: Abstraction has 3924 states and 5410 transitions. [2025-03-17 10:26:58,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 63.95238095238095) internal successors, (1343), 21 states have internal predecessors, (1343), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 10:26:58,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3924 states and 5410 transitions. [2025-03-17 10:26:58,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1621 [2025-03-17 10:26:58,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:26:58,323 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:26:58,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 10:26:58,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:26:58,524 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:26:58,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:26:58,526 INFO L85 PathProgramCache]: Analyzing trace with hash -887219251, now seen corresponding path program 2 times [2025-03-17 10:26:58,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:26:58,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897099146] [2025-03-17 10:26:58,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:26:58,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:26:58,900 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1620 statements into 2 equivalence classes. [2025-03-17 10:26:58,917 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 75 of 1620 statements. [2025-03-17 10:26:58,917 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 10:26:58,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:26:59,165 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-17 10:26:59,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:26:59,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897099146] [2025-03-17 10:26:59,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897099146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:26:59,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:26:59,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 10:26:59,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596006113] [2025-03-17 10:26:59,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:26:59,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 10:26:59,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:26:59,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 10:26:59,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 10:26:59,168 INFO L87 Difference]: Start difference. First operand 3924 states and 5410 transitions. Second operand has 8 states, 8 states have (on average 29.5) internal successors, (236), 8 states have internal predecessors, (236), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:26:59,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:26:59,741 INFO L93 Difference]: Finished difference Result 4785 states and 6691 transitions. [2025-03-17 10:26:59,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:26:59,742 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.5) internal successors, (236), 8 states have internal predecessors, (236), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1620 [2025-03-17 10:26:59,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:26:59,756 INFO L225 Difference]: With dead ends: 4785 [2025-03-17 10:26:59,756 INFO L226 Difference]: Without dead ends: 3939 [2025-03-17 10:26:59,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-17 10:26:59,759 INFO L435 NwaCegarLoop]: 1140 mSDtfsCounter, 53 mSDsluCounter, 4325 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 5465 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 10:26:59,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 5465 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 10:26:59,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3939 states. [2025-03-17 10:26:59,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3939 to 3935. [2025-03-17 10:26:59,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3935 states, 3868 states have (on average 1.3712512926577043) internal successors, (5304), 3877 states have internal predecessors, (5304), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 10:26:59,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3935 states to 3935 states and 5421 transitions. [2025-03-17 10:26:59,889 INFO L78 Accepts]: Start accepts. Automaton has 3935 states and 5421 transitions. Word has length 1620 [2025-03-17 10:26:59,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:26:59,892 INFO L471 AbstractCegarLoop]: Abstraction has 3935 states and 5421 transitions. [2025-03-17 10:26:59,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.5) internal successors, (236), 8 states have internal predecessors, (236), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:26:59,892 INFO L276 IsEmpty]: Start isEmpty. Operand 3935 states and 5421 transitions. [2025-03-17 10:26:59,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1622 [2025-03-17 10:26:59,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:26:59,919 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:26:59,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 10:26:59,919 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:26:59,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:26:59,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1407847951, now seen corresponding path program 1 times [2025-03-17 10:26:59,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:26:59,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408549776] [2025-03-17 10:26:59,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:26:59,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:27:00,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1621 statements into 1 equivalence classes. [2025-03-17 10:27:01,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1621 of 1621 statements. [2025-03-17 10:27:01,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:27:01,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:27:04,190 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-17 10:27:04,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:27:04,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408549776] [2025-03-17 10:27:04,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408549776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:27:04,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:27:04,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 10:27:04,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21731201] [2025-03-17 10:27:04,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:27:04,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 10:27:04,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:27:04,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 10:27:04,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 10:27:04,193 INFO L87 Difference]: Start difference. First operand 3935 states and 5421 transitions. Second operand has 8 states, 8 states have (on average 29.625) internal successors, (237), 8 states have internal predecessors, (237), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:27:04,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:27:04,951 INFO L93 Difference]: Finished difference Result 4779 states and 6677 transitions. [2025-03-17 10:27:04,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:27:04,952 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.625) internal successors, (237), 8 states have internal predecessors, (237), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1621 [2025-03-17 10:27:04,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:27:04,965 INFO L225 Difference]: With dead ends: 4779 [2025-03-17 10:27:04,966 INFO L226 Difference]: Without dead ends: 3943 [2025-03-17 10:27:04,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:27:04,970 INFO L435 NwaCegarLoop]: 1145 mSDtfsCounter, 24 mSDsluCounter, 6461 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 7606 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 10:27:04,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 7606 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 10:27:04,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3943 states. [2025-03-17 10:27:05,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3943 to 3935. [2025-03-17 10:27:05,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3935 states, 3868 states have (on average 1.3712512926577043) internal successors, (5304), 3877 states have internal predecessors, (5304), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 10:27:05,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3935 states to 3935 states and 5421 transitions. [2025-03-17 10:27:05,080 INFO L78 Accepts]: Start accepts. Automaton has 3935 states and 5421 transitions. Word has length 1621 [2025-03-17 10:27:05,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:27:05,082 INFO L471 AbstractCegarLoop]: Abstraction has 3935 states and 5421 transitions. [2025-03-17 10:27:05,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.625) internal successors, (237), 8 states have internal predecessors, (237), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:27:05,082 INFO L276 IsEmpty]: Start isEmpty. Operand 3935 states and 5421 transitions. [2025-03-17 10:27:05,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1622 [2025-03-17 10:27:05,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:27:05,113 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:27:05,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 10:27:05,113 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:27:05,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:27:05,115 INFO L85 PathProgramCache]: Analyzing trace with hash 307701944, now seen corresponding path program 1 times [2025-03-17 10:27:05,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:27:05,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533299123] [2025-03-17 10:27:05,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:27:05,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:27:05,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1621 statements into 1 equivalence classes. [2025-03-17 10:27:06,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1621 of 1621 statements. [2025-03-17 10:27:06,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:27:06,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:27:09,674 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-17 10:27:09,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:27:09,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533299123] [2025-03-17 10:27:09,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533299123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:27:09,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:27:09,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 10:27:09,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795631382] [2025-03-17 10:27:09,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:27:09,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:27:09,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:27:09,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:27:09,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:27:09,677 INFO L87 Difference]: Start difference. First operand 3935 states and 5421 transitions. Second operand has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:27:10,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:27:10,150 INFO L93 Difference]: Finished difference Result 4785 states and 6686 transitions. [2025-03-17 10:27:10,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 10:27:10,150 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1621 [2025-03-17 10:27:10,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:27:10,162 INFO L225 Difference]: With dead ends: 4785 [2025-03-17 10:27:10,162 INFO L226 Difference]: Without dead ends: 3940 [2025-03-17 10:27:10,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 10:27:10,164 INFO L435 NwaCegarLoop]: 1146 mSDtfsCounter, 20 mSDsluCounter, 5361 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 6507 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 10:27:10,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 6507 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 10:27:10,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3940 states. [2025-03-17 10:27:10,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3940 to 3939. [2025-03-17 10:27:10,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3939 states, 3872 states have (on average 1.3711260330578512) internal successors, (5309), 3881 states have internal predecessors, (5309), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 10:27:10,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3939 states to 3939 states and 5426 transitions. [2025-03-17 10:27:10,224 INFO L78 Accepts]: Start accepts. Automaton has 3939 states and 5426 transitions. Word has length 1621 [2025-03-17 10:27:10,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:27:10,225 INFO L471 AbstractCegarLoop]: Abstraction has 3939 states and 5426 transitions. [2025-03-17 10:27:10,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:27:10,225 INFO L276 IsEmpty]: Start isEmpty. Operand 3939 states and 5426 transitions. [2025-03-17 10:27:10,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1623 [2025-03-17 10:27:10,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:27:10,240 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:27:10,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 10:27:10,240 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:27:10,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:27:10,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1348081428, now seen corresponding path program 1 times [2025-03-17 10:27:10,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:27:10,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931709925] [2025-03-17 10:27:10,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:27:10,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:27:10,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1622 statements into 1 equivalence classes. [2025-03-17 10:27:11,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1622 of 1622 statements. [2025-03-17 10:27:11,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:27:11,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:27:14,180 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-17 10:27:14,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:27:14,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931709925] [2025-03-17 10:27:14,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931709925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:27:14,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:27:14,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 10:27:14,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537274553] [2025-03-17 10:27:14,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:27:14,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 10:27:14,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:27:14,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 10:27:14,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:27:14,182 INFO L87 Difference]: Start difference. First operand 3939 states and 5426 transitions. Second operand has 9 states, 9 states have (on average 26.444444444444443) internal successors, (238), 9 states have internal predecessors, (238), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:27:14,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:27:14,837 INFO L93 Difference]: Finished difference Result 4791 states and 6693 transitions. [2025-03-17 10:27:14,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:27:14,837 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 26.444444444444443) internal successors, (238), 9 states have internal predecessors, (238), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1622 [2025-03-17 10:27:14,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:27:14,846 INFO L225 Difference]: With dead ends: 4791 [2025-03-17 10:27:14,847 INFO L226 Difference]: Without dead ends: 3950 [2025-03-17 10:27:14,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 10:27:14,849 INFO L435 NwaCegarLoop]: 1140 mSDtfsCounter, 31 mSDsluCounter, 7610 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 8750 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 10:27:14,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 8750 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 10:27:14,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3950 states. [2025-03-17 10:27:14,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3950 to 3947. [2025-03-17 10:27:14,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3947 states, 3880 states have (on average 1.3708762886597938) internal successors, (5319), 3889 states have internal predecessors, (5319), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 10:27:14,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3947 states to 3947 states and 5436 transitions. [2025-03-17 10:27:14,934 INFO L78 Accepts]: Start accepts. Automaton has 3947 states and 5436 transitions. Word has length 1622 [2025-03-17 10:27:14,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:27:14,935 INFO L471 AbstractCegarLoop]: Abstraction has 3947 states and 5436 transitions. [2025-03-17 10:27:14,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.444444444444443) internal successors, (238), 9 states have internal predecessors, (238), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:27:14,936 INFO L276 IsEmpty]: Start isEmpty. Operand 3947 states and 5436 transitions. [2025-03-17 10:27:14,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1624 [2025-03-17 10:27:14,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:27:14,963 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:27:14,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 10:27:14,963 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:27:14,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:27:14,964 INFO L85 PathProgramCache]: Analyzing trace with hash 245799051, now seen corresponding path program 1 times [2025-03-17 10:27:14,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:27:14,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79144741] [2025-03-17 10:27:14,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:27:14,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:27:15,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1623 statements into 1 equivalence classes. [2025-03-17 10:27:15,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1623 of 1623 statements. [2025-03-17 10:27:15,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:27:15,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:27:20,430 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 1961 proven. 74 refuted. 0 times theorem prover too weak. 5203 trivial. 0 not checked. [2025-03-17 10:27:20,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:27:20,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79144741] [2025-03-17 10:27:20,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79144741] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:27:20,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904543129] [2025-03-17 10:27:20,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:27:20,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:27:20,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:27:20,433 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-17 10:27:20,434 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-17 10:27:21,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1623 statements into 1 equivalence classes. [2025-03-17 10:27:22,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1623 of 1623 statements. [2025-03-17 10:27:22,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:27:22,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:27:22,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 7984 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 10:27:22,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:27:22,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 10:27:23,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 10:27:23,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 10:27:23,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 10:27:23,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 10:27:23,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 10:27:23,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 10:27:23,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 10:27:23,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 10:27:24,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 10:27:24,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 10:27:24,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 10:27:24,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 10:27:24,300 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 7214 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:27:24,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:27:25,677 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 7214 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:27:25,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904543129] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:27:25,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:27:25,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 32 [2025-03-17 10:27:25,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543398361] [2025-03-17 10:27:25,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:27:25,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 10:27:25,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:27:25,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 10:27:25,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=636, Unknown=0, NotChecked=0, Total=992 [2025-03-17 10:27:25,683 INFO L87 Difference]: Start difference. First operand 3947 states and 5436 transitions. Second operand has 32 states, 32 states have (on average 103.1875) internal successors, (3302), 32 states have internal predecessors, (3302), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 10:27:27,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:27:27,879 INFO L93 Difference]: Finished difference Result 6816 states and 9431 transitions. [2025-03-17 10:27:27,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-03-17 10:27:27,880 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 103.1875) internal successors, (3302), 32 states have internal predecessors, (3302), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 1623 [2025-03-17 10:27:27,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:27:27,891 INFO L225 Difference]: With dead ends: 6816 [2025-03-17 10:27:27,891 INFO L226 Difference]: Without dead ends: 5910 [2025-03-17 10:27:27,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3302 GetRequests, 3218 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1982 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1671, Invalid=4491, Unknown=0, NotChecked=0, Total=6162 [2025-03-17 10:27:27,894 INFO L435 NwaCegarLoop]: 1089 mSDtfsCounter, 14083 mSDsluCounter, 12320 mSDsCounter, 0 mSdLazyCounter, 1858 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14164 SdHoareTripleChecker+Valid, 13409 SdHoareTripleChecker+Invalid, 1931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:27:27,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14164 Valid, 13409 Invalid, 1931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1858 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 10:27:27,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5910 states. [2025-03-17 10:27:27,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5910 to 5910. [2025-03-17 10:27:27,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5910 states, 5804 states have (on average 1.3599241902136459) internal successors, (7893), 5813 states have internal predecessors, (7893), 98 states have call successors, (98), 7 states have call predecessors, (98), 7 states have return successors, (97), 91 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-17 10:27:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5910 states to 5910 states and 8088 transitions. [2025-03-17 10:27:27,975 INFO L78 Accepts]: Start accepts. Automaton has 5910 states and 8088 transitions. Word has length 1623 [2025-03-17 10:27:27,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:27:27,976 INFO L471 AbstractCegarLoop]: Abstraction has 5910 states and 8088 transitions. [2025-03-17 10:27:27,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 103.1875) internal successors, (3302), 32 states have internal predecessors, (3302), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 10:27:27,977 INFO L276 IsEmpty]: Start isEmpty. Operand 5910 states and 8088 transitions. [2025-03-17 10:27:28,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2599 [2025-03-17 10:27:28,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:27:28,011 INFO L218 NwaCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 14, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:27:28,047 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-17 10:27:28,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 10:27:28,212 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:27:28,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:27:28,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1224961357, now seen corresponding path program 2 times [2025-03-17 10:27:28,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:27:28,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415738070] [2025-03-17 10:27:28,214 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:27:28,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:27:28,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2598 statements into 2 equivalence classes. [2025-03-17 10:27:28,745 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 78 of 2598 statements. [2025-03-17 10:27:28,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 10:27:28,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:27:28,917 INFO L134 CoverageAnalysis]: Checked inductivity of 23813 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23813 trivial. 0 not checked. [2025-03-17 10:27:28,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:27:28,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415738070] [2025-03-17 10:27:28,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415738070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:27:28,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:27:28,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 10:27:28,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495080924] [2025-03-17 10:27:28,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:27:28,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 10:27:28,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:27:28,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 10:27:28,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 10:27:28,920 INFO L87 Difference]: Start difference. First operand 5910 states and 8088 transitions. Second operand has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:27:29,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:27:29,496 INFO L93 Difference]: Finished difference Result 6766 states and 9358 transitions. [2025-03-17 10:27:29,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 10:27:29,496 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 2598 [2025-03-17 10:27:29,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:27:29,508 INFO L225 Difference]: With dead ends: 6766 [2025-03-17 10:27:29,508 INFO L226 Difference]: Without dead ends: 5916 [2025-03-17 10:27:29,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-17 10:27:29,511 INFO L435 NwaCegarLoop]: 1133 mSDtfsCounter, 411 mSDsluCounter, 4955 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 6088 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 10:27:29,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 6088 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 10:27:29,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5916 states. [2025-03-17 10:27:29,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5916 to 5910. [2025-03-17 10:27:29,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5910 states, 5804 states have (on average 1.3599241902136459) internal successors, (7893), 5813 states have internal predecessors, (7893), 98 states have call successors, (98), 7 states have call predecessors, (98), 7 states have return successors, (97), 91 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-17 10:27:29,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5910 states to 5910 states and 8088 transitions. [2025-03-17 10:27:29,591 INFO L78 Accepts]: Start accepts. Automaton has 5910 states and 8088 transitions. Word has length 2598 [2025-03-17 10:27:29,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:27:29,593 INFO L471 AbstractCegarLoop]: Abstraction has 5910 states and 8088 transitions. [2025-03-17 10:27:29,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:27:29,593 INFO L276 IsEmpty]: Start isEmpty. Operand 5910 states and 8088 transitions. [2025-03-17 10:27:29,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2599 [2025-03-17 10:27:29,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:27:29,625 INFO L218 NwaCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 14, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:27:29,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 10:27:29,625 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:27:29,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:27:29,626 INFO L85 PathProgramCache]: Analyzing trace with hash -85651721, now seen corresponding path program 1 times [2025-03-17 10:27:29,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:27:29,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500676266] [2025-03-17 10:27:29,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:27:29,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:27:30,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2598 statements into 1 equivalence classes. [2025-03-17 10:27:31,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2598 of 2598 statements. [2025-03-17 10:27:31,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:27:31,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:27:36,309 INFO L134 CoverageAnalysis]: Checked inductivity of 23813 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23813 trivial. 0 not checked. [2025-03-17 10:27:36,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:27:36,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500676266] [2025-03-17 10:27:36,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500676266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:27:36,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:27:36,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 10:27:36,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662652558] [2025-03-17 10:27:36,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:27:36,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:27:36,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:27:36,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:27:36,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:27:36,311 INFO L87 Difference]: Start difference. First operand 5910 states and 8088 transitions. Second operand has 7 states, 7 states have (on average 34.142857142857146) internal successors, (239), 7 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:27:36,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:27:36,705 INFO L93 Difference]: Finished difference Result 6762 states and 9355 transitions. [2025-03-17 10:27:36,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 10:27:36,705 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.142857142857146) internal successors, (239), 7 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 2598 [2025-03-17 10:27:36,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:27:36,720 INFO L225 Difference]: With dead ends: 6762 [2025-03-17 10:27:36,720 INFO L226 Difference]: Without dead ends: 5915 [2025-03-17 10:27:36,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:27:36,723 INFO L435 NwaCegarLoop]: 1149 mSDtfsCounter, 16 mSDsluCounter, 4325 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 5474 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:27:36,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 5474 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:27:36,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5915 states. [2025-03-17 10:27:36,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5915 to 5913. [2025-03-17 10:27:36,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5913 states, 5807 states have (on average 1.3597382469433443) internal successors, (7896), 5816 states have internal predecessors, (7896), 98 states have call successors, (98), 7 states have call predecessors, (98), 7 states have return successors, (97), 91 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-17 10:27:36,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5913 states to 5913 states and 8091 transitions. [2025-03-17 10:27:36,816 INFO L78 Accepts]: Start accepts. Automaton has 5913 states and 8091 transitions. Word has length 2598 [2025-03-17 10:27:36,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:27:36,818 INFO L471 AbstractCegarLoop]: Abstraction has 5913 states and 8091 transitions. [2025-03-17 10:27:36,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.142857142857146) internal successors, (239), 7 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:27:36,819 INFO L276 IsEmpty]: Start isEmpty. Operand 5913 states and 8091 transitions. [2025-03-17 10:27:36,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2599 [2025-03-17 10:27:36,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:27:36,851 INFO L218 NwaCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 14, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:27:36,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 10:27:36,851 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:27:36,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:27:36,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1936815346, now seen corresponding path program 1 times [2025-03-17 10:27:36,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:27:36,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026868965] [2025-03-17 10:27:36,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:27:36,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:27:37,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2598 statements into 1 equivalence classes. [2025-03-17 10:27:38,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2598 of 2598 statements. [2025-03-17 10:27:38,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:27:38,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:27:41,733 INFO L134 CoverageAnalysis]: Checked inductivity of 23813 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23813 trivial. 0 not checked. [2025-03-17 10:27:41,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:27:41,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026868965] [2025-03-17 10:27:41,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026868965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:27:41,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:27:41,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:27:41,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020831337] [2025-03-17 10:27:41,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:27:41,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:27:41,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:27:41,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:27:41,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:27:41,735 INFO L87 Difference]: Start difference. First operand 5913 states and 8091 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:27:41,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:27:41,948 INFO L93 Difference]: Finished difference Result 6769 states and 9363 transitions. [2025-03-17 10:27:41,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:27:41,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 2598 [2025-03-17 10:27:41,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:27:41,961 INFO L225 Difference]: With dead ends: 6769 [2025-03-17 10:27:41,961 INFO L226 Difference]: Without dead ends: 5894 [2025-03-17 10:27:41,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:27:41,963 INFO L435 NwaCegarLoop]: 1144 mSDtfsCounter, 1 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:27:41,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2266 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:27:41,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5894 states. [2025-03-17 10:27:42,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5894 to 5894. [2025-03-17 10:27:42,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5894 states, 5788 states have (on average 1.3597097442985486) internal successors, (7870), 5797 states have internal predecessors, (7870), 98 states have call successors, (98), 7 states have call predecessors, (98), 7 states have return successors, (97), 91 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-17 10:27:42,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5894 states to 5894 states and 8065 transitions. [2025-03-17 10:27:42,046 INFO L78 Accepts]: Start accepts. Automaton has 5894 states and 8065 transitions. Word has length 2598 [2025-03-17 10:27:42,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:27:42,047 INFO L471 AbstractCegarLoop]: Abstraction has 5894 states and 8065 transitions. [2025-03-17 10:27:42,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:27:42,048 INFO L276 IsEmpty]: Start isEmpty. Operand 5894 states and 8065 transitions. [2025-03-17 10:27:42,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2600 [2025-03-17 10:27:42,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:27:42,079 INFO L218 NwaCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 14, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:27:42,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 10:27:42,079 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:27:42,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:27:42,081 INFO L85 PathProgramCache]: Analyzing trace with hash 2039019701, now seen corresponding path program 1 times [2025-03-17 10:27:42,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:27:42,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295981755] [2025-03-17 10:27:42,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:27:42,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:27:42,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2599 statements into 1 equivalence classes. [2025-03-17 10:27:44,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2599 of 2599 statements. [2025-03-17 10:27:44,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:27:44,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat