./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-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 961225f1af8bda006e5a86aed07a62a3e426daf2d218eb9a2332372592a548eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:21:49,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:21:49,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 21:21:49,971 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:21:49,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:21:49,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:21:49,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:21:49,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:21:49,995 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 21:21:49,995 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 21:21:49,995 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:21:49,995 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:21:49,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:21:49,996 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:21:49,996 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:21:49,996 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:21:49,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:21:49,997 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:21:49,997 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:21:49,997 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:21:49,997 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:21:49,997 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:21:49,997 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:21:49,997 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:21:49,998 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:21:49,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:21:49,998 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:21:49,998 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:21:49,998 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:21:49,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:21:49,998 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 21:21:49,998 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:21:49,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:21:49,998 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:21:49,998 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:21:49,998 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:21:49,999 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:21:49,999 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:21:49,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:21:49,999 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:21:49,999 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:21:49,999 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:21:49,999 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:21:49,999 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 -> 961225f1af8bda006e5a86aed07a62a3e426daf2d218eb9a2332372592a548eb [2025-03-08 21:21:50,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:21:50,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:21:50,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:21:50,220 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:21:50,221 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:21:50,221 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_test9-2.i [2025-03-08 21:21:51,380 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a01677e6/993f0c41a8ce4dfb815c0f2e7975cac5/FLAGb3cc446b0 [2025-03-08 21:21:51,697 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:21:51,700 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.i [2025-03-08 21:21:51,714 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a01677e6/993f0c41a8ce4dfb815c0f2e7975cac5/FLAGb3cc446b0 [2025-03-08 21:21:51,942 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a01677e6/993f0c41a8ce4dfb815c0f2e7975cac5 [2025-03-08 21:21:51,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:21:51,944 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:21:51,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:21:51,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:21:51,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:21:51,949 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:21:51" (1/1) ... [2025-03-08 21:21:51,949 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@139dcbe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:51, skipping insertion in model container [2025-03-08 21:21:51,949 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:21:51" (1/1) ... [2025-03-08 21:21:51,989 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:21:52,220 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_test9-2.i[33021,33034] [2025-03-08 21:21:52,369 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.i[84583,84596] [2025-03-08 21:21:52,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:21:52,387 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:21:52,426 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_test9-2.i[33021,33034] [2025-03-08 21:21:52,496 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_test9-2.i[84583,84596] [2025-03-08 21:21:52,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:21:52,532 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:21:52,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:52 WrapperNode [2025-03-08 21:21:52,533 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:21:52,534 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:21:52,534 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:21:52,534 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:21:52,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:52" (1/1) ... [2025-03-08 21:21:52,567 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:52" (1/1) ... [2025-03-08 21:21:52,667 INFO L138 Inliner]: procedures = 177, calls = 773, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3403 [2025-03-08 21:21:52,667 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:21:52,668 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:21:52,668 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:21:52,668 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:21:52,674 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:52" (1/1) ... [2025-03-08 21:21:52,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:52" (1/1) ... [2025-03-08 21:21:52,688 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:52" (1/1) ... [2025-03-08 21:21:52,751 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 34, 220]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2025-03-08 21:21:52,751 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:52" (1/1) ... [2025-03-08 21:21:52,751 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:52" (1/1) ... [2025-03-08 21:21:52,792 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:52" (1/1) ... [2025-03-08 21:21:52,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:52" (1/1) ... [2025-03-08 21:21:52,809 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:52" (1/1) ... [2025-03-08 21:21:52,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:52" (1/1) ... [2025-03-08 21:21:52,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:21:52,835 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:21:52,836 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:21:52,836 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:21:52,837 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:52" (1/1) ... [2025-03-08 21:21:52,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:21:52,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:21:52,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 21:21:52,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 21:21:52,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 21:21:52,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 21:21:52,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 21:21:52,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 21:21:52,883 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 21:21:52,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 21:21:52,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 21:21:52,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 21:21:52,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-08 21:21:52,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-08 21:21:52,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-08 21:21:52,884 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-08 21:21:52,884 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-08 21:21:52,884 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-08 21:21:52,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 21:21:52,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:21:52,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 21:21:52,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 21:21:52,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 21:21:52,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 21:21:52,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 21:21:52,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 21:21:52,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 21:21:52,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 21:21:52,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 21:21:52,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 21:21:52,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 21:21:52,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:21:52,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:21:53,046 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:21:53,048 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:21:55,024 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2218: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-08 21:21:55,208 INFO L? ?]: Removed 823 outVars from TransFormulas that were not future-live. [2025-03-08 21:21:55,208 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:21:55,269 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:21:55,270 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 21:21:55,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:21:55 BoogieIcfgContainer [2025-03-08 21:21:55,270 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:21:55,272 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:21:55,272 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:21:55,275 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:21:55,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:21:51" (1/3) ... [2025-03-08 21:21:55,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b9a461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:21:55, skipping insertion in model container [2025-03-08 21:21:55,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:52" (2/3) ... [2025-03-08 21:21:55,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b9a461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:21:55, skipping insertion in model container [2025-03-08 21:21:55,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:21:55" (3/3) ... [2025-03-08 21:21:55,277 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test9-2.i [2025-03-08 21:21:55,288 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:21:55,289 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test9-2.i that has 5 procedures, 1407 locations, 1 initial locations, 36 loop locations, and 2 error locations. [2025-03-08 21:21:55,366 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:21:55,376 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;@3cdecd7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:21:55,376 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 21:21:55,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 1399 states, 891 states have (on average 1.8316498316498318) internal successors, (1632), 1393 states have internal predecessors, (1632), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-08 21:21:55,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 21:21:55,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:21:55,388 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:21:55,388 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:21:55,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:21:55,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1715556443, now seen corresponding path program 1 times [2025-03-08 21:21:55,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:21:55,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309493640] [2025-03-08 21:21:55,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:21:55,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:21:55,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 21:21:55,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 21:21:55,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:21:55,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:21:55,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:21:55,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:21:55,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309493640] [2025-03-08 21:21:55,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309493640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:21:55,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:21:55,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:21:55,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421038270] [2025-03-08 21:21:55,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:21:55,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 21:21:55,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:21:55,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 21:21:55,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 21:21:55,545 INFO L87 Difference]: Start difference. First operand has 1399 states, 891 states have (on average 1.8316498316498318) internal successors, (1632), 1393 states have internal predecessors, (1632), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:21:55,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:21:55,763 INFO L93 Difference]: Finished difference Result 2796 states and 5774 transitions. [2025-03-08 21:21:55,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 21:21:55,765 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 21:21:55,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:21:55,791 INFO L225 Difference]: With dead ends: 2796 [2025-03-08 21:21:55,791 INFO L226 Difference]: Without dead ends: 1362 [2025-03-08 21:21:55,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 21:21:55,801 INFO L435 NwaCegarLoop]: 2532 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2532 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:21:55,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2532 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:21:55,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2025-03-08 21:21:56,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1362. [2025-03-08 21:21:56,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 855 states have (on average 1.775438596491228) internal successors, (1518), 1356 states have internal predecessors, (1518), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-08 21:21:56,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 2524 transitions. [2025-03-08 21:21:56,042 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 2524 transitions. Word has length 9 [2025-03-08 21:21:56,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:21:56,043 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 2524 transitions. [2025-03-08 21:21:56,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:21:56,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 2524 transitions. [2025-03-08 21:21:56,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 21:21:56,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:21:56,045 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] [2025-03-08 21:21:56,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:21:56,046 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:21:56,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:21:56,046 INFO L85 PathProgramCache]: Analyzing trace with hash 726888382, now seen corresponding path program 1 times [2025-03-08 21:21:56,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:21:56,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596524554] [2025-03-08 21:21:56,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:21:56,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:21:56,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 21:21:56,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 21:21:56,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:21:56,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:21:56,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:21:56,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:21:56,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596524554] [2025-03-08 21:21:56,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596524554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:21:56,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:21:56,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:21:56,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946091758] [2025-03-08 21:21:56,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:21:56,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:21:56,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:21:56,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:21:56,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:21:56,443 INFO L87 Difference]: Start difference. First operand 1362 states and 2524 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:21:57,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:21:57,337 INFO L93 Difference]: Finished difference Result 3875 states and 7274 transitions. [2025-03-08 21:21:57,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:21:57,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-08 21:21:57,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:21:57,364 INFO L225 Difference]: With dead ends: 3875 [2025-03-08 21:21:57,365 INFO L226 Difference]: Without dead ends: 2711 [2025-03-08 21:21:57,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:21:57,370 INFO L435 NwaCegarLoop]: 2703 mSDtfsCounter, 1503 mSDsluCounter, 4661 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2006 SdHoareTripleChecker+Valid, 7364 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 21:21:57,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2006 Valid, 7364 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 21:21:57,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2711 states. [2025-03-08 21:21:57,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2711 to 1364. [2025-03-08 21:21:57,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 857 states have (on average 1.7736289381563595) internal successors, (1520), 1358 states have internal predecessors, (1520), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-08 21:21:57,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 2526 transitions. [2025-03-08 21:21:57,643 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 2526 transitions. Word has length 62 [2025-03-08 21:21:57,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:21:57,644 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 2526 transitions. [2025-03-08 21:21:57,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:21:57,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 2526 transitions. [2025-03-08 21:21:57,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 21:21:57,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:21:57,651 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] [2025-03-08 21:21:57,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:21:57,652 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:21:57,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:21:57,652 INFO L85 PathProgramCache]: Analyzing trace with hash 54422276, now seen corresponding path program 1 times [2025-03-08 21:21:57,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:21:57,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702486706] [2025-03-08 21:21:57,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:21:57,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:21:57,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 21:21:57,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 21:21:57,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:21:57,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:21:57,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:21:57,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:21:57,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702486706] [2025-03-08 21:21:57,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702486706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:21:57,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:21:57,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:21:57,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696947953] [2025-03-08 21:21:57,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:21:57,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:21:57,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:21:57,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:21:57,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:21:57,975 INFO L87 Difference]: Start difference. First operand 1364 states and 2526 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:21:58,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:21:58,121 INFO L93 Difference]: Finished difference Result 2682 states and 4982 transitions. [2025-03-08 21:21:58,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:21:58,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2025-03-08 21:21:58,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:21:58,131 INFO L225 Difference]: With dead ends: 2682 [2025-03-08 21:21:58,131 INFO L226 Difference]: Without dead ends: 1322 [2025-03-08 21:21:58,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:21:58,135 INFO L435 NwaCegarLoop]: 2391 mSDtfsCounter, 30 mSDsluCounter, 4763 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 7154 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:21:58,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 7154 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:21:58,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2025-03-08 21:21:58,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1322. [2025-03-08 21:21:58,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 815 states have (on average 1.7705521472392638) internal successors, (1443), 1316 states have internal predecessors, (1443), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-08 21:21:58,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 2449 transitions. [2025-03-08 21:21:58,256 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 2449 transitions. Word has length 136 [2025-03-08 21:21:58,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:21:58,257 INFO L471 AbstractCegarLoop]: Abstraction has 1322 states and 2449 transitions. [2025-03-08 21:21:58,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:21:58,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 2449 transitions. [2025-03-08 21:21:58,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 21:21:58,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:21:58,258 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] [2025-03-08 21:21:58,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:21:58,258 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:21:58,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:21:58,259 INFO L85 PathProgramCache]: Analyzing trace with hash -622833398, now seen corresponding path program 1 times [2025-03-08 21:21:58,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:21:58,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416799109] [2025-03-08 21:21:58,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:21:58,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:21:58,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 21:21:58,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 21:21:58,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:21:58,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:21:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:21:58,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:21:58,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416799109] [2025-03-08 21:21:58,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416799109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:21:58,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:21:58,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:21:58,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551760755] [2025-03-08 21:21:58,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:21:58,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:21:58,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:21:58,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:21:58,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:21:58,451 INFO L87 Difference]: Start difference. First operand 1322 states and 2449 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:21:58,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:21:58,653 INFO L93 Difference]: Finished difference Result 3861 states and 7214 transitions. [2025-03-08 21:21:58,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:21:58,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2025-03-08 21:21:58,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:21:58,670 INFO L225 Difference]: With dead ends: 3861 [2025-03-08 21:21:58,670 INFO L226 Difference]: Without dead ends: 2543 [2025-03-08 21:21:58,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:21:58,675 INFO L435 NwaCegarLoop]: 2821 mSDtfsCounter, 1259 mSDsluCounter, 2395 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1759 SdHoareTripleChecker+Valid, 5216 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:21:58,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1759 Valid, 5216 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:21:58,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2543 states. [2025-03-08 21:21:58,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2543 to 2541. [2025-03-08 21:21:58,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2541 states, 1534 states have (on average 1.7992177314211213) internal successors, (2760), 2535 states have internal predecessors, (2760), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-03-08 21:21:58,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 4766 transitions. [2025-03-08 21:21:58,925 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 4766 transitions. Word has length 136 [2025-03-08 21:21:58,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:21:58,925 INFO L471 AbstractCegarLoop]: Abstraction has 2541 states and 4766 transitions. [2025-03-08 21:21:58,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:21:58,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 4766 transitions. [2025-03-08 21:21:58,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 21:21:58,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:21:58,927 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] [2025-03-08 21:21:58,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:21:58,927 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:21:58,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:21:58,928 INFO L85 PathProgramCache]: Analyzing trace with hash 960578731, now seen corresponding path program 1 times [2025-03-08 21:21:58,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:21:58,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557828877] [2025-03-08 21:21:58,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:21:58,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:21:58,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 21:21:58,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 21:21:58,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:21:58,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:21:59,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 21:21:59,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:21:59,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557828877] [2025-03-08 21:21:59,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557828877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:21:59,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:21:59,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:21:59,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022083898] [2025-03-08 21:21:59,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:21:59,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:21:59,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:21:59,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:21:59,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:21:59,122 INFO L87 Difference]: Start difference. First operand 2541 states and 4766 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:21:59,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:21:59,295 INFO L93 Difference]: Finished difference Result 4878 states and 9264 transitions. [2025-03-08 21:21:59,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:21:59,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 151 [2025-03-08 21:21:59,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:21:59,317 INFO L225 Difference]: With dead ends: 4878 [2025-03-08 21:21:59,317 INFO L226 Difference]: Without dead ends: 2581 [2025-03-08 21:21:59,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:21:59,325 INFO L435 NwaCegarLoop]: 2389 mSDtfsCounter, 8 mSDsluCounter, 2374 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4763 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:21:59,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4763 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:21:59,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2581 states. [2025-03-08 21:21:59,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2581 to 2581. [2025-03-08 21:21:59,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2581 states, 1574 states have (on average 1.7789072426937738) internal successors, (2800), 2575 states have internal predecessors, (2800), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-03-08 21:21:59,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2581 states to 2581 states and 4806 transitions. [2025-03-08 21:21:59,575 INFO L78 Accepts]: Start accepts. Automaton has 2581 states and 4806 transitions. Word has length 151 [2025-03-08 21:21:59,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:21:59,576 INFO L471 AbstractCegarLoop]: Abstraction has 2581 states and 4806 transitions. [2025-03-08 21:21:59,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:21:59,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2581 states and 4806 transitions. [2025-03-08 21:21:59,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 21:21:59,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:21:59,578 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] [2025-03-08 21:21:59,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:21:59,578 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:21:59,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:21:59,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1324284724, now seen corresponding path program 1 times [2025-03-08 21:21:59,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:21:59,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383810741] [2025-03-08 21:21:59,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:21:59,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:21:59,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 21:21:59,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 21:21:59,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:21:59,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:21:59,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 21:21:59,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:21:59,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383810741] [2025-03-08 21:21:59,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383810741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:21:59,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:21:59,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:21:59,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804653137] [2025-03-08 21:21:59,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:21:59,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:21:59,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:21:59,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:21:59,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:21:59,799 INFO L87 Difference]: Start difference. First operand 2581 states and 4806 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:21:59,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:21:59,965 INFO L93 Difference]: Finished difference Result 4794 states and 9106 transitions. [2025-03-08 21:21:59,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:21:59,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 151 [2025-03-08 21:21:59,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:21:59,991 INFO L225 Difference]: With dead ends: 4794 [2025-03-08 21:21:59,991 INFO L226 Difference]: Without dead ends: 2457 [2025-03-08 21:21:59,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:21:59,999 INFO L435 NwaCegarLoop]: 2314 mSDtfsCounter, 32 mSDsluCounter, 4614 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 6928 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:21:59,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 6928 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:22:00,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2025-03-08 21:22:00,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2457. [2025-03-08 21:22:00,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2457 states, 1450 states have (on average 1.793103448275862) internal successors, (2600), 2451 states have internal predecessors, (2600), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-03-08 21:22:00,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 4606 transitions. [2025-03-08 21:22:00,421 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 4606 transitions. Word has length 151 [2025-03-08 21:22:00,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:22:00,422 INFO L471 AbstractCegarLoop]: Abstraction has 2457 states and 4606 transitions. [2025-03-08 21:22:00,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:22:00,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 4606 transitions. [2025-03-08 21:22:00,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 21:22:00,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:22:00,425 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] [2025-03-08 21:22:00,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:22:00,426 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:22:00,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:22:00,426 INFO L85 PathProgramCache]: Analyzing trace with hash -448461787, now seen corresponding path program 1 times [2025-03-08 21:22:00,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:22:00,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998359108] [2025-03-08 21:22:00,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:22:00,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:22:00,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 21:22:00,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 21:22:00,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:22:00,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:22:00,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:22:00,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:22:00,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998359108] [2025-03-08 21:22:00,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998359108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:22:00,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:22:00,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:22:00,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416925512] [2025-03-08 21:22:00,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:22:00,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:22:00,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:22:00,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:22:00,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:22:00,665 INFO L87 Difference]: Start difference. First operand 2457 states and 4606 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:22:01,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:22:01,934 INFO L93 Difference]: Finished difference Result 3733 states and 6971 transitions. [2025-03-08 21:22:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:22:01,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 151 [2025-03-08 21:22:01,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:22:01,946 INFO L225 Difference]: With dead ends: 3733 [2025-03-08 21:22:01,946 INFO L226 Difference]: Without dead ends: 1365 [2025-03-08 21:22:01,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:22:01,953 INFO L435 NwaCegarLoop]: 2395 mSDtfsCounter, 2541 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1003 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2541 SdHoareTripleChecker+Valid, 3524 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1003 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:22:01,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2541 Valid, 3524 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1003 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 21:22:01,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2025-03-08 21:22:02,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1365. [2025-03-08 21:22:02,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 858 states have (on average 1.7214452214452214) internal successors, (1477), 1359 states have internal predecessors, (1477), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-08 21:22:02,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 2483 transitions. [2025-03-08 21:22:02,072 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 2483 transitions. Word has length 151 [2025-03-08 21:22:02,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:22:02,073 INFO L471 AbstractCegarLoop]: Abstraction has 1365 states and 2483 transitions. [2025-03-08 21:22:02,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:22:02,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 2483 transitions. [2025-03-08 21:22:02,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 21:22:02,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:22:02,077 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] [2025-03-08 21:22:02,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:22:02,077 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:22:02,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:22:02,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1549615959, now seen corresponding path program 1 times [2025-03-08 21:22:02,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:22:02,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861032819] [2025-03-08 21:22:02,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:22:02,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:22:02,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 21:22:02,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 21:22:02,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:22:02,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:22:02,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:22:02,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:22:02,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861032819] [2025-03-08 21:22:02,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861032819] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:22:02,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991580686] [2025-03-08 21:22:02,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:22:02,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:22:02,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:22:02,695 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:22:02,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 21:22:02,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 21:22:02,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 21:22:02,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:22:02,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:22:02,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 21:22:02,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:22:02,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 21:22:03,169 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 23 treesize of output 3 [2025-03-08 21:22:03,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 21:22:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:22:03,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:22:03,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:22:03,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991580686] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:22:03,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:22:03,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-03-08 21:22:03,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959230818] [2025-03-08 21:22:03,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:22:03,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 21:22:03,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:22:03,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 21:22:03,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-08 21:22:03,323 INFO L87 Difference]: Start difference. First operand 1365 states and 2483 transitions. Second operand has 11 states, 11 states have (on average 28.90909090909091) internal successors, (318), 11 states have internal predecessors, (318), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 21:22:08,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:22:08,745 INFO L93 Difference]: Finished difference Result 5202 states and 9594 transitions. [2025-03-08 21:22:08,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 21:22:08,746 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 28.90909090909091) internal successors, (318), 11 states have internal predecessors, (318), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 161 [2025-03-08 21:22:08,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:22:08,772 INFO L225 Difference]: With dead ends: 5202 [2025-03-08 21:22:08,772 INFO L226 Difference]: Without dead ends: 4080 [2025-03-08 21:22:08,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 315 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-03-08 21:22:08,776 INFO L435 NwaCegarLoop]: 1859 mSDtfsCounter, 2992 mSDsluCounter, 12482 mSDsCounter, 0 mSdLazyCounter, 5837 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3996 SdHoareTripleChecker+Valid, 14341 SdHoareTripleChecker+Invalid, 6342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 5837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:22:08,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3996 Valid, 14341 Invalid, 6342 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [505 Valid, 5837 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-03-08 21:22:08,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4080 states. [2025-03-08 21:22:09,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4080 to 1705. [2025-03-08 21:22:09,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1705 states, 1194 states have (on average 1.6139028475711892) internal successors, (1927), 1695 states have internal predecessors, (1927), 506 states have call successors, (506), 3 states have call predecessors, (506), 3 states have return successors, (506), 7 states have call predecessors, (506), 506 states have call successors, (506) [2025-03-08 21:22:09,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2939 transitions. [2025-03-08 21:22:09,092 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2939 transitions. Word has length 161 [2025-03-08 21:22:09,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:22:09,092 INFO L471 AbstractCegarLoop]: Abstraction has 1705 states and 2939 transitions. [2025-03-08 21:22:09,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.90909090909091) internal successors, (318), 11 states have internal predecessors, (318), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 21:22:09,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2939 transitions. [2025-03-08 21:22:09,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-03-08 21:22:09,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:22:09,097 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 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] [2025-03-08 21:22:09,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 21:22:09,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:22:09,298 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:22:09,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:22:09,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1591850885, now seen corresponding path program 1 times [2025-03-08 21:22:09,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:22:09,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123835676] [2025-03-08 21:22:09,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:22:09,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:22:09,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-08 21:22:09,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-08 21:22:09,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:22:09,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:22:12,025 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:22:12,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:22:12,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123835676] [2025-03-08 21:22:12,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123835676] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:22:12,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477778294] [2025-03-08 21:22:12,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:22:12,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:22:12,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:22:12,028 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:22:12,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 21:22:12,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-08 21:22:12,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-08 21:22:12,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:22:12,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:22:12,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 1893 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 21:22:12,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:22:12,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 21:22:12,711 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 23 treesize of output 3 [2025-03-08 21:22:12,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 21:22:12,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 21:22:13,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 21:22:13,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 21:22:13,033 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:22:13,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:22:13,592 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:22:13,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477778294] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:22:13,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:22:13,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 20 [2025-03-08 21:22:13,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14071911] [2025-03-08 21:22:13,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:22:13,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 21:22:13,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:22:13,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 21:22:13,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2025-03-08 21:22:13,595 INFO L87 Difference]: Start difference. First operand 1705 states and 2939 transitions. Second operand has 20 states, 20 states have (on average 38.4) internal successors, (768), 20 states have internal predecessors, (768), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 21:22:23,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:22:23,282 INFO L93 Difference]: Finished difference Result 10508 states and 19341 transitions. [2025-03-08 21:22:23,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 21:22:23,283 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 38.4) internal successors, (768), 20 states have internal predecessors, (768), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 383 [2025-03-08 21:22:23,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:22:23,359 INFO L225 Difference]: With dead ends: 10508 [2025-03-08 21:22:23,360 INFO L226 Difference]: Without dead ends: 9386 [2025-03-08 21:22:23,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 785 GetRequests, 758 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=223, Invalid=427, Unknown=0, NotChecked=0, Total=650 [2025-03-08 21:22:23,373 INFO L435 NwaCegarLoop]: 1859 mSDtfsCounter, 14742 mSDsluCounter, 21024 mSDsCounter, 0 mSdLazyCounter, 11868 mSolverCounterSat, 2206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17752 SdHoareTripleChecker+Valid, 22883 SdHoareTripleChecker+Invalid, 14074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2206 IncrementalHoareTripleChecker+Valid, 11868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2025-03-08 21:22:23,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17752 Valid, 22883 Invalid, 14074 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2206 Valid, 11868 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2025-03-08 21:22:23,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9386 states. [2025-03-08 21:22:24,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9386 to 2551. [2025-03-08 21:22:24,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2551 states, 2034 states have (on average 1.5019665683382497) internal successors, (3055), 2535 states have internal predecessors, (3055), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-03-08 21:22:24,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 4079 transitions. [2025-03-08 21:22:24,120 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 4079 transitions. Word has length 383 [2025-03-08 21:22:24,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:22:24,120 INFO L471 AbstractCegarLoop]: Abstraction has 2551 states and 4079 transitions. [2025-03-08 21:22:24,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 38.4) internal successors, (768), 20 states have internal predecessors, (768), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 21:22:24,121 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 4079 transitions. [2025-03-08 21:22:24,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2025-03-08 21:22:24,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:22:24,151 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-08 21:22:24,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 21:22:24,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-08 21:22:24,352 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:22:24,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:22:24,353 INFO L85 PathProgramCache]: Analyzing trace with hash 73838019, now seen corresponding path program 2 times [2025-03-08 21:22:24,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:22:24,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443999358] [2025-03-08 21:22:24,353 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:22:24,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:22:24,540 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 827 statements into 2 equivalence classes. [2025-03-08 21:22:24,565 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 72 of 827 statements. [2025-03-08 21:22:24,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:22:24,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:22:24,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3336 trivial. 0 not checked. [2025-03-08 21:22:24,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:22:24,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443999358] [2025-03-08 21:22:24,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443999358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:22:24,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:22:24,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 21:22:24,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960090998] [2025-03-08 21:22:24,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:22:24,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:22:24,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:22:24,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:22:24,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:22:24,679 INFO L87 Difference]: Start difference. First operand 2551 states and 4079 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:22:25,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:22:25,070 INFO L93 Difference]: Finished difference Result 3712 states and 6291 transitions. [2025-03-08 21:22:25,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:22:25,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 827 [2025-03-08 21:22:25,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:22:25,084 INFO L225 Difference]: With dead ends: 3712 [2025-03-08 21:22:25,084 INFO L226 Difference]: Without dead ends: 2591 [2025-03-08 21:22:25,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:22:25,089 INFO L435 NwaCegarLoop]: 2342 mSDtfsCounter, 80 mSDsluCounter, 9115 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 11457 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 21:22:25,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 11457 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 21:22:25,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2025-03-08 21:22:25,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2553. [2025-03-08 21:22:25,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2553 states, 2036 states have (on average 1.5014734774066798) internal successors, (3057), 2537 states have internal predecessors, (3057), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-03-08 21:22:25,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 4081 transitions. [2025-03-08 21:22:25,245 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 4081 transitions. Word has length 827 [2025-03-08 21:22:25,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:22:25,246 INFO L471 AbstractCegarLoop]: Abstraction has 2553 states and 4081 transitions. [2025-03-08 21:22:25,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:22:25,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 4081 transitions. [2025-03-08 21:22:25,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 829 [2025-03-08 21:22:25,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:22:25,259 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-08 21:22:25,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 21:22:25,259 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:22:25,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:22:25,260 INFO L85 PathProgramCache]: Analyzing trace with hash -573182067, now seen corresponding path program 1 times [2025-03-08 21:22:25,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:22:25,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927771464] [2025-03-08 21:22:25,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:22:25,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:22:25,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 828 statements into 1 equivalence classes. [2025-03-08 21:22:25,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 828 of 828 statements. [2025-03-08 21:22:25,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:22:25,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:22:27,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3336 trivial. 0 not checked. [2025-03-08 21:22:27,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:22:27,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927771464] [2025-03-08 21:22:27,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927771464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:22:27,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:22:27,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 21:22:27,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195653916] [2025-03-08 21:22:27,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:22:27,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:22:27,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:22:27,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:22:27,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:22:27,203 INFO L87 Difference]: Start difference. First operand 2553 states and 4081 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:22:27,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:22:27,545 INFO L93 Difference]: Finished difference Result 3681 states and 6247 transitions. [2025-03-08 21:22:27,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:22:27,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 828 [2025-03-08 21:22:27,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:22:27,556 INFO L225 Difference]: With dead ends: 3681 [2025-03-08 21:22:27,556 INFO L226 Difference]: Without dead ends: 2558 [2025-03-08 21:22:27,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:22:27,560 INFO L435 NwaCegarLoop]: 2322 mSDtfsCounter, 14 mSDsluCounter, 9020 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 11342 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:22:27,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 11342 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:22:27,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2025-03-08 21:22:27,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 2557. [2025-03-08 21:22:27,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2040 states have (on average 1.5009803921568627) internal successors, (3062), 2541 states have internal predecessors, (3062), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-03-08 21:22:27,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 4086 transitions. [2025-03-08 21:22:27,718 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 4086 transitions. Word has length 828 [2025-03-08 21:22:27,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:22:27,720 INFO L471 AbstractCegarLoop]: Abstraction has 2557 states and 4086 transitions. [2025-03-08 21:22:27,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:22:27,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 4086 transitions. [2025-03-08 21:22:27,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2025-03-08 21:22:27,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:22:27,727 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-08 21:22:27,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 21:22:27,727 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:22:27,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:22:27,727 INFO L85 PathProgramCache]: Analyzing trace with hash 325287466, now seen corresponding path program 1 times [2025-03-08 21:22:27,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:22:27,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746677229] [2025-03-08 21:22:27,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:22:27,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:22:27,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes. [2025-03-08 21:22:28,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements. [2025-03-08 21:22:28,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:22:28,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:22:29,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3336 trivial. 0 not checked. [2025-03-08 21:22:29,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:22:29,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746677229] [2025-03-08 21:22:29,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746677229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:22:29,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:22:29,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:22:29,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614102573] [2025-03-08 21:22:29,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:22:29,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 21:22:29,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:22:29,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 21:22:29,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:22:29,802 INFO L87 Difference]: Start difference. First operand 2557 states and 4086 transitions. Second operand has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:22:30,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:22:30,247 INFO L93 Difference]: Finished difference Result 3695 states and 6266 transitions. [2025-03-08 21:22:30,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:22:30,247 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 829 [2025-03-08 21:22:30,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:22:30,257 INFO L225 Difference]: With dead ends: 3695 [2025-03-08 21:22:30,257 INFO L226 Difference]: Without dead ends: 2568 [2025-03-08 21:22:30,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-08 21:22:30,261 INFO L435 NwaCegarLoop]: 2323 mSDtfsCounter, 31 mSDsluCounter, 15885 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 18208 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 21:22:30,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 18208 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 21:22:30,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2025-03-08 21:22:30,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2565. [2025-03-08 21:22:30,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2565 states, 2048 states have (on average 1.49951171875) internal successors, (3071), 2549 states have internal predecessors, (3071), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-03-08 21:22:30,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 4095 transitions. [2025-03-08 21:22:30,439 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 4095 transitions. Word has length 829 [2025-03-08 21:22:30,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:22:30,440 INFO L471 AbstractCegarLoop]: Abstraction has 2565 states and 4095 transitions. [2025-03-08 21:22:30,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:22:30,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 4095 transitions. [2025-03-08 21:22:30,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 831 [2025-03-08 21:22:30,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:22:30,445 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-08 21:22:30,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 21:22:30,446 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:22:30,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:22:30,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1493848262, now seen corresponding path program 1 times [2025-03-08 21:22:30,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:22:30,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508421196] [2025-03-08 21:22:30,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:22:30,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:22:30,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 830 statements into 1 equivalence classes. [2025-03-08 21:22:30,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 830 of 830 statements. [2025-03-08 21:22:30,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:22:30,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:22:39,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 3332 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:22:39,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:22:39,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508421196] [2025-03-08 21:22:39,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508421196] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:22:39,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473376772] [2025-03-08 21:22:39,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:22:39,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:22:39,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:22:39,021 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:22:39,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 21:22:39,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 830 statements into 1 equivalence classes. [2025-03-08 21:22:40,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 830 of 830 statements. [2025-03-08 21:22:40,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:22:40,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:22:40,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 4149 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 21:22:40,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:22:40,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 21:22:40,178 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 23 treesize of output 3 [2025-03-08 21:22:40,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 21:22:40,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 21:22:40,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 21:22:40,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 21:22:40,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 21:22:40,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 21:22:40,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 21:22:40,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 21:22:40,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 21:22:40,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 21:22:40,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 3332 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:22:40,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:22:41,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 3332 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:22:41,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473376772] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:22:41,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:22:41,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 15, 14] total 38 [2025-03-08 21:22:41,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70603448] [2025-03-08 21:22:41,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:22:41,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-08 21:22:41,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:22:41,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-08 21:22:41,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=836, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 21:22:41,649 INFO L87 Difference]: Start difference. First operand 2565 states and 4095 transitions. Second operand has 38 states, 38 states have (on average 43.973684210526315) internal successors, (1671), 38 states have internal predecessors, (1671), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 21:23:08,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:23:08,853 INFO L93 Difference]: Finished difference Result 19086 states and 34757 transitions. [2025-03-08 21:23:08,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-08 21:23:08,854 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 43.973684210526315) internal successors, (1671), 38 states have internal predecessors, (1671), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 830 [2025-03-08 21:23:08,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:23:08,924 INFO L225 Difference]: With dead ends: 19086 [2025-03-08 21:23:08,924 INFO L226 Difference]: Without dead ends: 17950 [2025-03-08 21:23:08,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1700 GetRequests, 1649 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=871, Invalid=1579, Unknown=0, NotChecked=0, Total=2450 [2025-03-08 21:23:08,935 INFO L435 NwaCegarLoop]: 1858 mSDtfsCounter, 36423 mSDsluCounter, 35478 mSDsCounter, 0 mSdLazyCounter, 19977 mSolverCounterSat, 4416 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42445 SdHoareTripleChecker+Valid, 37336 SdHoareTripleChecker+Invalid, 24393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4416 IncrementalHoareTripleChecker+Valid, 19977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.7s IncrementalHoareTripleChecker+Time [2025-03-08 21:23:08,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42445 Valid, 37336 Invalid, 24393 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4416 Valid, 19977 Invalid, 0 Unknown, 0 Unchecked, 23.7s Time] [2025-03-08 21:23:08,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17950 states. [2025-03-08 21:23:10,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17950 to 4257. [2025-03-08 21:23:10,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4257 states, 3728 states have (on average 1.4289163090128756) internal successors, (5327), 4229 states have internal predecessors, (5327), 524 states have call successors, (524), 3 states have call predecessors, (524), 3 states have return successors, (524), 25 states have call predecessors, (524), 524 states have call successors, (524) [2025-03-08 21:23:10,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4257 states to 4257 states and 6375 transitions. [2025-03-08 21:23:10,434 INFO L78 Accepts]: Start accepts. Automaton has 4257 states and 6375 transitions. Word has length 830 [2025-03-08 21:23:10,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:23:10,435 INFO L471 AbstractCegarLoop]: Abstraction has 4257 states and 6375 transitions. [2025-03-08 21:23:10,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 43.973684210526315) internal successors, (1671), 38 states have internal predecessors, (1671), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 21:23:10,436 INFO L276 IsEmpty]: Start isEmpty. Operand 4257 states and 6375 transitions. [2025-03-08 21:23:10,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1719 [2025-03-08 21:23:10,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:23:10,467 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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] [2025-03-08 21:23:10,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 21:23:10,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:23:10,667 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:23:10,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:23:10,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1203097942, now seen corresponding path program 2 times [2025-03-08 21:23:10,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:23:10,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792335835] [2025-03-08 21:23:10,669 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:23:10,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms